A Cutting-Plane Game for Facial Disjunctive Programs

DOI10.1137/0318018zbMath0434.90063OpenAlexW1991781025MaRDI QIDQ3873916

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 algorithmsfacial constraintsfacial disjunctive programscutting-plane gametwo-person game on a polytope

Mathematics Subject Classification ID

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

Related Items

Extensions of a theorem of Balas, Facet inequalities from simple disjunctions in cutting plane theory, A lift-and-project cutting plane algorithm for mixed 0-1 programs, A finite cutting plane method for facial disjunctive programs, A finitely convergent procedure for facial disjunctive programs, Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights, A brief history of lift-and-project, 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, Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints, On solving two-stage distributionally robust disjunctive programs with a general ambiguity set, Sequential convexification in reverse convex and disjunctive programming, 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