Convex polytope

A convex polytope is a special case of a <a href="/facts/Polytope/a76nXrL0">polytope</a>, having the additional property that it is also a <a href="/facts/Convex_set/vdAuJRJl">convex set</a> contained in the 
 
 
 
 n
 
 
 {\displaystyle n}
 
-dimensional Euclidean space 
 
 
 
 
 
 R
 
 
 n
 
 
 
 
 {\displaystyle \mathbb {R} ^{n}}
 
. Most texts use the term "polytope" for a <a href="/facts/Bounded_set/yCldjtoy">bounded</a> convex polytope, and the word "polyhedron" for the more general, possibly unbounded object. Others (including this article) allow polytopes to be unbounded. The terms "bounded/unbounded convex polytope" will be used below whenever the boundedness is critical to the discussed issue. Yet other texts identify a convex polytope with its boundary.
Convex polytopes play an important role both in various branches of <a href="/facts/Mathematics/pxTouaz4">mathematics</a> and in applied areas, most notably in <a href="/facts/Linear_programming/GduXFQxT">linear programming</a>.
In the influential textbooks of Grünbaum and Ziegler on the subject, as well as in many other texts in <a href="/facts/Discrete_geometry/Ixnl3GBc">discrete geometry</a>, convex polytopes are often simply called "polytopes". Grünbaum points out that this is solely to avoid the endless repetition of the word "convex", and that the discussion should throughout be understood as applying only to the convex variety (p. 51).
A polytope is called full-dimensional if it is an 
 
 
 
 n
 
 
 {\displaystyle n}
 
-dimensional object in 
 
 
 
 
 
 R
 
 
 n
 
 
 
 
 {\displaystyle \mathbb {R} ^{n}}
 
.

Convex polytope open-in-new

Convex polytope