Simple Extensions of Polytopes
We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P. We devise a combinatorial method to establish lower bounds on the simple extension complexity and show for several polytopes that they have large simple extension complexities. These examples include both the spanning tree and the perfect matching polytopes of complete graphs, uncapacitated flow polytopes for non-trivially decomposable directed acyclic graphs, and random 0/1-polytopes with vertex numbers within a certain range. On our way to obtain the result on perfect matching polytopes we improve on a result of Padberg and Rao’s on the adjacency structures of those polytopes.
KeywordsSpan Tree Complete Graph Directed Acyclic Graph Extended Formulation Simple Extension
Unable to display preview. Download preview PDF.
- 2.Dantzig, G.B.: Linear Programming and Extensions. Princeton landmarks in mathematics and physics. Princeton University Press (1963)Google Scholar
- 3.Fiorini, S., Kaibel, V., Pashkovich, K., Theis, D.O.: Combinatorial bounds on nonnegative rank and extended formulations. arXiv:1111.0444 (2011) (to appear in: Discrete Math.)Google Scholar
- 4.Fiorini, S., Massar, S., Pokutta, S., Tiwary, H.R., de Wolf, R.: Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. In: Karloff, H.J., Pitassi, T. (eds.) STOC, pp. 95–106. ACM (2012)Google Scholar
- 5.Gallo, G., Sodini, C.: Extreme points and adjacency relationship in the flow polytope. Calcolo 15, 277–288 (1978), 10.1007/BF02575918Google Scholar
- 6.Gillmann, R.: 0/1-Polytopes Typical and Extremal Properties. PhD thesis, Technische Universität, Berlin (2007)Google Scholar
- 7.Goemans, M.: Smallest compact formulation for the permutahedron (2009), http://www-math.mit.edu/~goemans/publ.html
- 10.Padberg, M.W., Rao, M.R.: The travelling salesman problem and a class of polyhedra of diameter two. Math. Program. 7, 32–45 (1974), 10.1007/BF01585502Google Scholar
- 11.Pashkovich, K.: Symmetry in extended formulations of the permutahedron (2009)Google Scholar
- 13.Rothvoß, T.: Some 0/1 polytopes need exponential size extended formulations. Math. Program, 1–14 (2012)Google Scholar
- 14.Rothvoß, T.: The matching polytope has exponential extension complexity. arXiv:1311.2369 (November 2013)Google Scholar
- 17.Ziegler, G.M.: Lectures on Polytopes (Graduate Texts in Mathematics). Springer (2001)Google Scholar