A finite cutting plane method for facial disjunctive programs

DOI10.1007/BF01415956zbMath0741.90045OpenAlexW28399995MaRDI QIDQ3971356

János Fülöp

Publication date: 25 June 1992

Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 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

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

Related Items (1)

Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization with disjunctive constraints
• A finitely convergent procedure for facial disjunctive programs
• Disjunctive programming: Properties of the convex hull of feasible points
• A Cutting-Plane Game for Facial Disjunctive Programs
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• Cutting-Planes for Complementarity Constraints
• Disjunctive Programming
• The Indefinite Quadratic Programming Problem

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