Abstract
We will turn now to the specific properties of convex polytopes or, briefly, poly-topes. They have been introduced in I.1 as convex hulls of finite point sets in ℝn. Our first aim is to show that, equivalently, convex polytopes can be defined as bounded intersections of finitely many half-spaces. (This fact is of particular relevance in linear optimization).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Ewald, G. (1996). Combinatorial theory of polytopes and polyhedral sets. In: Combinatorial Convexity and Algebraic Geometry. Graduate Texts in Mathematics, vol 168. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4044-0_2
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4044-0_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-8476-5
Online ISBN: 978-1-4612-4044-0
eBook Packages: Springer Book Archive