Sequential convexification in reverse convex and disjunctive programming

DOI10.1007/BF01587096zbMath0683.90063MaRDI QIDQ1825137

Jørgen Tind, Egon Balas, Joseph M. Tama

Publication date: 1989

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

reverse convex programsfacial disjunctive programsconvex hull generationsequential convexifiability

Mathematics Subject Classification ID

Convex programming (90C25) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items

A lift-and-project cutting plane algorithm for mixed 0-1 programs, Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations, D.C. representability of closed sets in reflexive Banach spaces and applications to optimization problems, Solving linear optimization over arithmetic constraint formula, A hierarchy of relaxations for linear generalized disjunctive programming, Lift-and-project for mixed 0-1 programming: recent progress, Stability in disjunctive linear optimization I: continuity of the feasible set, On solving two-stage distributionally robust disjunctive programs with a general ambiguity set, Stability in disjunctive optimization II:continuity of the feasible and optimal set, Projection, lifting and extended formulation integer and combinatorial optimization

Cites Work

• Global minimization of a concave function subject to mixed linear and reverse convex constraints
• Extensions of a theorem of Balas
• Reverse convex programming
• Disjunctive programming: Properties of the convex hull of feasible points
• Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
• On the facial structure of scheduling polyhedra
• A Cutting-Plane Game for Facial Disjunctive Programs
• Disjunctive Programming
• Convex Analysis
• Iterative Solution of Nonlinear Optimal Control Problems