Combinatorial theory of polytopes and polyhedral sets

  • Günter Ewald
Part of the Graduate Texts in Mathematics book series (GTM, volume 168)

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).

Keywords

Hull Pyramid 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York, Inc. 1996

Authors and Affiliations

  • Günter Ewald
    • 1
  1. 1.Fakultät für MathematikRuhr-Universität BochumBochumGermany

Personalised recommendations