In convex geometry and polyhedral combinatorics, the extension complexity of a convex polytope P {\displaystyle P} is the smallest number of facets among convex polytopes Q {\displaystyle Q} that have P {\displaystyle P} as a projection. In this context, Q {\displaystyle Q} is called an extended formulation of P {\displaystyle P} ; it may have much higher dimension than P {\displaystyle P} .
In convex geometry and polyhedral combinatorics, the extension complexity of a convex polytope P {\displaystyle P} is the smallest number of facets among convex polytopes Q {\displaystyle Q} that have P {\displaystyle P} as a projection. In this context, Q {\displaystyle Q} is called an extended formulation of P {\displaystyle P} ; it may have much higher dimension than P {\displaystyle P} .
Source: Wikipedia "Extension complexity" · CC BY-SA 4.0
Share this article: X · Bluesky