A finite cutting plane method for facial disjunctive programs

DOI10.1007/BF01415956MaRDI QIDQ3971356zbMATH OpenOpenAlexFDO

Authors János Fülöp

Publication date 25 June 1992

Published in ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01415956

zbMATH Keywords

cutting planelinear disjunctive programequivalent facial program

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Recommendations

• scientific article; zbMATH DE number 4039634
• scientific article; zbMATH DE number 4083363
• Disjunctive programming: Properties of the convex hull of feasible points
• A disjunctive cutting plane algorithm for the extreme point mathematical programming problem
• A disjunctive cutting plane procedure for general mixed-integer linear programs

Cites work

• scientific article; zbMATH DE number 3920182 (Why is no real title available?)
• scientific article; zbMATH DE number 3598222 (Why is no real title available?)
• scientific article; zbMATH DE number 3323651 (Why is no real title available?)
• A Cutting-Plane Game for Facial Disjunctive Programs
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• A finitely convergent procedure for facial disjunctive programs
• Cutting-Planes for Complementarity Constraints
• Disjunctive Programming
• Disjunctive programming: Properties of the convex hull of feasible points
• Optimization with disjunctive constraints
• The Indefinite Quadratic Programming Problem

Cited in

(8)

• scientific article; zbMATH DE number 4039634 (Why is no real title available?)
• scientific article; zbMATH DE number 4083363 (Why is no real title available?)
• Computing deep facet-defining disjunctive cuts for mixed-integer programming
• A disjunctive cutting plane algorithm for the extreme point mathematical programming problem
• Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint
• scientific article; zbMATH DE number 913208 (Why is no real title available?)
• Application of disjunctive programming to the linear complementarity problem
• Cutting planes from two-term disjunctions

This page was built for publication: A finite cutting plane method for facial disjunctive programs

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