Facial disjunctive programs and sequences of cutting-planes
From MaRDI portal
Publication:1152308
DOI10.1016/0166-218X(80)90037-2zbMath0459.90054WikidataQ128113103 ScholiaQ128113103MaRDI QIDQ1152308
Publication date: 1980
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
disjunctive programmingfiniteness proofscutting algorithmfacial disjunctive constraintssequences of cutting-planes
Related Items
Disjunctive Programming and a Hierarchy of Relaxations for Discrete 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, Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints, The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification, On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs, Stability in disjunctive optimization II:continuity of the feasible and optimal set, Projection, lifting and extended formulation integer and combinatorial optimization
Cites Work
