Facial disjunctive programs and sequences of cutting-planes

DOI10.1016/0166-218X(80)90037-2MaRDI QIDQ1152308zbMATH OpenWikidataFDO

Authors C. E. Blair

Publication date 1980

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

disjunctive programmingfiniteness proofscutting algorithmfacial disjunctive constraintssequences of cutting-planes

Mathematics Subject Classification ID

Integer programming (90C10)

Cites work

• A converse for disjunctive constraints
• Disjunctive Programming

Cited in

(9)

• Stability in disjunctive optimization II:continuity of the feasible and optimal set
• Lift-and-project for mixed 0-1 programming: recent progress
• A hierarchy of relaxations for linear generalized disjunctive programming
• Projection, lifting and extended formulation integer and combinatorial optimization
• Solving linear optimization over arithmetic constraint formula
• On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
• The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
• Disjunctive decomposition for two-stage stochastic mixed-binary programs with generalized upper bound constraints
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems

This page was built for publication: Facial disjunctive programs and sequences of cutting-planes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1152308)