Enumerating extreme points of a highly degenerate polytope

DOI10.1016/0305-0548(94)90027-2zbMath0797.90079OpenAlexW2083855693MaRDI QIDQ1318458

V. Pereyra

Publication date: 25 October 1994

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90027-2

zbMATH Keywords

extreme pointspolytopedegeneracy

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Linear programming (90C05) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (3)

Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis. ⋮ A validation and verification tool for global optimization solvers ⋮ Linearly constrained global optimization: a general solution algorithm with applications.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving multiple objective linear programs in objective space
• On the structure of the set bases of a degenerate point
• A new pivoting rule for solving various degeneracy problems
• An algorithm for determining redundant inequalities and all solutions to convex polyhedra
• Finding all vertices of a convex polyhedron
• An Algorithm for Finding All Vertices of Convex Polyhedral Sets
• An algorithm for determining all extreme points of a convex polytope
• Finding all efficient extreme points for multiple objective linear programs
• Enumeration of the Elementary Circuits of a Directed Graph
• Generating All the Faces of a Polyhedron
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities

This page was built for publication: Enumerating extreme points of a highly degenerate polytope