Combinatorial theory of polytopes and polyhedral sets
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).
KeywordsFinite Sequence Combinatorial Theory Supporting Hyperplane Affine Subspace Proper Face
Unable to display preview. Download preview PDF.