Abstract
We introduce the concept of a segment of a degenerate convex polytope specified by a system of linear constraints, and explain its importance in developing algorithms for enumerating the faces. Using segments, we describe an algorithm that enumerates all the faces, in time polynomial in their number. The role of segments in the unsolved problem of enumerating the extreme points of a convex polytope specified by a degenerate system of linear constraints, in time polynomial in the number of extreme points, is discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
W. Altherr, “An algorithm for enumerating all vertices of a convex polyhedron,”Computing 15 (1975) 181–183.
D. Avis and K. Fukuda, “A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra,”Discrete and Computational Geometry 8 (1992) 295–313.
M.L. Balinski, “An algorithm for finding all vertices of convex polyhedral sets,”SIAM Journal on Applied Mathematics 9 (1961) 72–88.
C.A. Burdet, “Generating all the faces of a polyhedron,”SIAM Journal on Applied Mathematics 26 (1974) 479–489.
M.E. Dyer, “The complexity of vertex enumeration methods,”Mathematics of Operations Research 8 (1983) 381–402.
M.E. Dyer and L.G. Proll, “An algorithm for determining all extreme points of a convex polytope,”Mathematical Programming 12 (1977) 81–96.
R. Freund and J. Orlin, “On the complexity of four polyhedral containment problems,”Mathematical Programming 33 (1985) 139–145.
K. Fukuda and V. Rosta, “Combinatorial face enumeration in convex polytopes,” Research Report 93-1, Graduate School of Systems Management, University of Tsukuba (1993).
M. Manas and J. Nedoma, “Finding all vertices of a convex polyhedron,”Numerische Mathematik 12 (1968) 226–229.
T.H. Matheiss and D.S. Rubin, “A survey and comparison of methods for finding all vertices of convex polyhedral sets,”Mathematics of Operations Research 5 (1980) 167–185.
W.D. Morris, Private communication, 1992.
T.S. Motzkin, H. Raiffa, G.L. Thompson and R.M. Thrall, “The double description method,” in: H.W. Kuhn and A.W. Tucker, eds.,Contributions to the Theory of Games, Vol. II, Annals of Mathematics Studies 28 (Princeton University Press, Princeton, NJ, 1953) pp. 81–103.
K.G. Murty, “The graph of an abstract polytope,”Mathematical Programming 4 (1973) 336–346.
K.G. Murty,Linear Programming (Wiley, New York, 1983).
K.G. Murty, “Faces of a polyhedron,”Mathematical Programming Study 24 (1985) 219–224.
J.S. Provan, “Efficient enumeration of the vertices of polyhedra associated with network LPs,” Technical Report, Department of Operations Research, University of North Carolina (Chapel Hill, NC, 1991).
G. Swart, “Finding the convex hull facet by facet,”Journal of Algorithms 6 (1985) 17–48.
Author information
Authors and Affiliations
Additional information
Work carried out while on sabbatical leave in the Industrial and Operations Engineering Department at the University of Michigan in Ann Arbor, USA.
Rights and permissions
About this article
Cite this article
Murty, K.G., Chung, SJ. Segments in enumerating faces. Mathematical Programming 70, 27–45 (1995). https://doi.org/10.1007/BF01585927
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01585927