Optimization with disjunctive constraints. (English) Zbl 0437.90052

Sherali, Hanif D.; Shetty, C. M.

Lecture Notes in Economics and Mathematical Systems, 181. Berlin-Heidelberg-New York: Springer-Verlag VIII, 156 p. DM 28.00; $ 16.60 (1980).

MSC:

90C30	Nonlinear programming
90-02	Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
52Bxx	Polytopes and polyhedra
65K05	Numerical mathematical programming methods
90C05	Linear programming
90C10	Integer programming
90C33	Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

Keywords:

cutting plane methods; disjunctive programs; relaxed program; valid cut; disjunctive cut principle; polyhedral sets; duality; Kuhn-Tucker conditions; subgradient optimization methods; algorithms; polyhedral annexation technique; facets; hyperplane; linearity space; primal-dual linear programming; finitely convergent algorithms; zero-line linear integer programming problem; linear complementarity problem; mixed integer cuts; generalized lattice point problem; cardinality constrained linear program