Abstract
Given a list of vectors that contains directions of the edges of a given polytope ℘ and the availability of an algorithm that solves linear programs over ℘, we describe a method for enumerating the vertices of ℘; in particular, the method is adaptable to polytopes which are presented as (linear) projections of polytopes having linear inequality representation. Polynomial complexity bounds under both the real and the binary computation models are derived when the dimension of the polytope is fixed and the given LP algorithm is polynomial.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Buck RC (1943) Partition of space. Am Math Mon 50:541–544
Cook WJ, Cunningham WH, Pulleyblank WR, Schrijver A (1997) Combinatorial optimization. Wiley, New York
Edelsbrunner H, O’Rourke J, Seidel R (1986) Constructing arrangements of lines and hyperplanes with applications. SIAM J Comput 15:341–363
Edelsbrunner H, Seidel R, Sharir M (1991) On the zone theorem for hyperplane arrangements. In: New results and trends in computer science. Lecture notes in computer science, vol 555. Springer, Berlin, pp 108–123
Gritzmann P, Sturmfels B (1993) Minkowski addition of polytopes: complexity and applications to Gröbner bases. SIAM J Discret Math 6:246–269
Grünbaum B (1967) Convex polytopes. Wiley, New York
Harding EF (1967) The number of partitions of a set of n points in k dimensions induced by hyperplanes. In: Proceedings of the Edinburgh mathematical society, vol 15, pp 285–289
Hwang FK, Rothblum UG (1996) Directional-quasi-convexity, asymmetric Schur-convexity and optimality of consecutive partitions. Math Oper Res 21:540–554
Hwang FK, Onn S, Rothblum UG (1999) A polynomial time algorithm for shaped partition problems. SIAM J Optim 10:70–81
Marshall AW, Olkin I (1979) Inequalities: theory of majorization and its applications. Academic, New York
Onn S, Rothblum UG (2004) Convex combinatorial optimization. Discret Comput Geom 32:549–566
Onn S, Schulman LJ (2001) The vector partition problem for convex objective functions. Math Oper Res 26:583–590
Onn S, Rothblum UG, Tangir Y (2005) Edge-directions of polyhedra with applications to network flows. J Global Optim 33:109–122
Rockaffelar RT (1984) Network flows and monotropic optimization. Pure and applied mathematics. Wiley–Interscience, New York
Schulz AS, Weismantel R, Ziegler G (1995) (0,1)-integer programming: optimization and augmentation are equivalent. In: Proceedings of the third annual European symposium on algorithms. Lecture notes in computer science, vol 979. Springer, Berlin, pp 473–483
Tardella F (1990) On the equivalence between some discrete and continuous optimization problems. Ann Oper Res 25:291–300
Zaslavsky T (1975) Facing up to arrangements: face count formulas for partitions of space by hyperplanes. Mem Am Math Soc 154
Ziegler GM (1995) Lecture notes on polytopes. Graduate texts in mathematics. Springer, New York
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to Professor Frank K. Hwang on the occasion of his sixty fifth birthday.
Supported in part by a grant from ISF—the Israel Science Foundation, by a VPR grant at the Technion and by the Fund for the Promotion of Research at the Technion.
Rights and permissions
About this article
Cite this article
Onn, S., Rothblum, U.G. The use of edge-directions and linear programming to enumerate vertices. J Comb Optim 14, 153–164 (2007). https://doi.org/10.1007/s10878-007-9063-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-007-9063-7