The matching polytope has exponential extension complexity

A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a polynomial. After two decades of standstill, recent years have brought amazing progress in showing lower bounds for the so called extension complexity, which for a polytope P denotes the smallest number of inequalities necessary to describe a higher dimensional polytope Q that can be linearly projected on P. However, the central question in this field remained wide open: can the perfect matching polytope be written as an LP with polynomially many constraints? We answer this question negatively. In fact, the extension complexity of the perfect matching polytope in a complete n-node graph is 2Ω(n). By a known reduction this also improves the lower bound on the extension complexity for the TSP polytope from 2Ω(√n) to 2Ω(n).

[1]  Thomas Rothvoß,et al.  Some 0/1 polytopes need exponential size extended formulations , 2011, Math. Program..

[2]  Sebastian Pokutta,et al.  On the existence of 0/1 polytopes with high semidefinite extension complexity , 2013, Math. Program..

[3]  Jack Edmonds,et al.  Matroids and the greedy algorithm , 1971, Math. Program..

[4]  Mark Braverman,et al.  An information complexity approach to extended formulations , 2013, STOC '13.

[5]  Samuel Fiorini,et al.  Combinatorial bounds on nonnegative rank and extended formulations , 2011, Discret. Math..

[6]  Hans Raj Tiwary,et al.  Extended Formulations for Polygons , 2011, Discret. Comput. Geom..

[7]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[8]  Bert Gerards.  Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus , 1991, Oper. Res. Lett..

[9]  Francisco Barahona,et al.  On cuts and matchings in planar graphs , 1993, Math. Program..

[10]  Hans Raj Tiwary,et al.  Extended formulations, nonnegative factorizations, and randomized communication protocols , 2011, Mathematical Programming.

[11]  Dirk Oliver Theis,et al.  Symmetry Matters for Sizes of Extended Formulations , 2012, SIAM J. Discret. Math..

[12]  Eli Upfal,et al.  Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .

[13]  Alexander A. Razborov,et al.  On the Distributional Complexity of Disjointness , 1990, Theor. Comput. Sci..

[14]  Sebastian Pokutta,et al.  A note on the extension complexity of the knapsack polytope , 2013, Oper. Res. Lett..

[15]  Alexander A. Razborov,et al.  On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..

[16]  Hans Raj Tiwary,et al.  On the extension complexity of combinatorial polytopes , 2013, Math. Program..

[17]  E. Balas.  Disjunctive programming and a hierarchy of relaxations for discrete optimization problems , 1985 .

[18]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[19]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[20]  M. R. Rao,et al.  Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..

[21]  Friedrich Eisenbrand,et al.  A compact linear program for testing optimality of perfect matchings , 2003, Oper. Res. Lett..

[22]  Prasad Raghavendra,et al.  Lower Bounds on the Size of Semidefinite Programming Relaxations , 2014, STOC.

[23]  Mihalis Yannakakis,et al.  Expressing combinatorial optimization problems by linear programs , 1991, STOC '88.

[24]  Prasad Raghavendra,et al.  Approximate Constraint Satisfaction Requires Large LP Relaxations , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[25]  Samuel Fiorini,et al.  Approximation Limits of Linear Programs (Beyond Hierarchies) , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[26]  R. Kipp Martin,et al.  Using separation algorithms to generate mixed integer model reformulations , 1991, Oper. Res. Lett..

[27]  Hans Raj Tiwary,et al.  Exponential Lower Bounds for Polytopes in Combinatorial Optimization , 2011, J. ACM.

[28]  Michel X. Goemans,et al.  Smallest compact formulation for the permutahedron , 2015, Math. Program..

[29]  Sebastian Pokutta,et al.  The matching polytope does not admit fully-polynomial size relaxation schemes , 2015, SODA.

[30]  Sebastian Pokutta,et al.  Common Information and Unique Disjointness , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.