Convex polytope

Summary

A convex polytope is the convex hull of finitely many points of $\R^n$. Equivalently, it is a bounded set cut out by finitely many linear inequalities. Convex polygons, convex polyhedra such as the cube and the regular tetrahedron, and their analogues in higher dimensions are convex polytopes. They are the basic objects of polyhedral combinatorics and of linear programming, where the feasible region of a bounded problem is a convex polytope.