A Cutting-Plane Game for Facial Disjunctive Programs

DOI10.1137/0318018MaRDI QIDQ3873916zbMATH OpenOpenAlexFDO

Authors Robert G. Jeroslow

Publication date 1980

Published in SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0318018

zbMATH Keywords

cutting-plane algorithmscutting-plane gamefacial constraintsfacial disjunctive programstwo-person game on a polytope

Mathematics Subject Classification ID

Integer programming (90C10) 2-person games (91A05) Applications of game theory (91A80)

Cited in

(15)

• Extensions of a theorem of Balas
• A finitely convergent procedure for facial disjunctive programs
• Sequential convexification in reverse convex and disjunctive programming
• On solving two-stage distributionally robust disjunctive programs with a general ambiguity set
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
• On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
• 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
• Two-stage stochastic mixed-integer programs: algorithms and insights
• On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
• Facet inequalities from simple disjunctions in cutting plane theory
• A finite cutting plane method for facial disjunctive programs
• Stability in disjunctive optimization II:continuity of the feasible and optimal set
• A brief history of lift-and-project

This page was built for publication: A Cutting-Plane Game for Facial Disjunctive Programs

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