A general algorithm for determining all essential solutions and inequalities for any convex polyhedron

DOI10.1007/BF02085640zbMath0815.90114OpenAlexW2072648768MaRDI QIDQ1339125

Luis Contesse B.

Publication date: 1 December 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

convex polyhedrondouble description methodall essential solutionsnon-simplex type algorithm

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear programming (90C05)

Cites Work

• Unnamed Item
• A counterexample to Greenberg's algorithm for solving linear inequalities
• An algorithm for determining redundant inequalities and all solutions to convex polyhedra
• The Complexity of Vertex Enumeration Methods
• An Algorithm for Finding All Vertices of Convex Polyhedral Sets
• Eliminating extraneous edges in Greenberg's algorithm
• Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
• Algorithms for finding the general solution of a system of linear inequalities

This page was built for publication: A general algorithm for determining all essential solutions and inequalities for any convex polyhedron