Some 0/1 polytopes need exponential size extended formulations
arXiv:1105.0036
Abstract
We prove that there are 0/1 polytopes P that do not admit a compact LP formulation. More precisely we show that for every n there is a sets X \subseteq {0,1}^n such that conv(X) must have extension complexity at least 2^{n/2 * (1-o(1))}. In other words, every polyhedron Q that can be linearly projected on conv(X) must have exponentially many facets. In fact, the same result also applies if conv(X) is restricted to be a matroid polytope. Conditioning on NP not contained in P_{/poly}, our result rules out the existence of any compact formulation for the TSP polytope, even if the formulation may contain arbitrary real numbers.
References in corpus (1)
Cited by in corpus (10)
- Extended formulations for polygons
- On the extension complexity of combinatorial polytopes
- On the existence of 0/1 polytopes with high semidefinite extension complexity
- The matching polytope does not admit fully-polynomial size relaxation schemes
- Extended formulations, non-negative factorizations and randomized communication protocols
- Combinatorial Bounds on Nonnegative Rank and Extended Formulations
- Average case polyhedral complexity of the maximum stable set problem
- Generalised probabilistic theories and conic extensions of polytopes
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization
- Dagstuhl Report 13082: Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices