A finite cutting plane method for facial disjunctive programs
DOI10.1007/BF01415956zbMATH Open0741.90045OpenAlexW28399995MaRDI QIDQ3971356FDOQ3971356
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
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
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)
Cites Work
- Title not available (Why is that?)
- Disjunctive programming: Properties of the convex hull of feasible points
- Disjunctive Programming
- Title not available (Why is that?)
- Optimization with disjunctive constraints
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- Cutting-Planes for Complementarity Constraints
- A Cutting-Plane Game for Facial Disjunctive Programs
- Title not available (Why is that?)
- The Indefinite Quadratic Programming Problem
- A finitely convergent procedure for facial disjunctive programs
Cited In (8)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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)
