Combinatorial Bounds on Nonnegative Rank and Extended Formulations
arXiv:1111.0444
Abstract
An extended formulation of a polytope P is a polytope Q which can be projected onto P. Extended formulations of small size (i.e., number of facets) are of interest, as they allow to model corresponding optimization problems as linear programs of small sizes. The main known lower bounds on the minimum sizes of extended formulations for fixed polytope P (Yannakakis 1991) are closely related to the concept of nondeterministic communication complexity. We study the relative power and limitations of the bounds on several examples.
arXiv commentRevision, 25pp
References in corpus (7)
- On the Geometric Interpretation of the Nonnegative Rank
- Extended formulations for polygons
- Symmetry Matters for Sizes of Extended Formulations
- Some 0/1 polytopes need exponential size extended formulations
- Extended formulations, non-negative factorizations and randomized communication protocols
- Finding Descriptions of Polytopes via Extended Formulations and Liftings
- Tight Lower Bounds on the Sizes of Symmetric Extensions of Permutahedra and Similar Results
Cited by in corpus (8)
- Lower bounds on nonnegative rank via nonnegative nuclear norms
- The matching polytope does not admit fully-polynomial size relaxation schemes
- Support-based lower bounds for the positive semidefinite rank of a nonnegative matrix
- Extended formulations, non-negative factorizations and randomized communication protocols
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization
- Fooling sets and rank
- An algebraic approach to symmetric extended formulations
- Fooling-sets and rank in nonzero characteristic (extended abstract)