A new algorithm to find all vertices of a polytope

DOI10.1016/0167-6377(89)90051-5zbMath1418.90153OpenAlexW2047075655MaRDI QIDQ2314411

Do Ba Khang, Okitsugu Fujiwara

Publication date: 22 July 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(89)90051-5

zbMATH Keywords

polytopedegeneracypolyhedral annexation algorithmvertex-set

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Linear programming (90C05)

Related Items

Constructing the set of efficient objective values in linear multiple objective transportation problems, A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program, On-line and off-line vertex enumeration by adjacency lists

Cites Work

• An outer approximation method for globally minimizing a concave function over a compact convex set
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• A Successive Underestimation Method for Concave Minimization Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item