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.

[1]  Daniel Bienstock,et al.  Approximate formulations for 0-1 knapsack sets , 2008, Oper. Res. Lett..

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

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

[4]  W. R. Pulleyblank,et al.  Polyhedral Combinatorics , 1989, ISMP.

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

[6]  Egon Balas,et al.  programming: Properties of the convex hull of feasible points * , 1998 .

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

[8]  V. Chvátal.  On certain polytopes associated with graphs , 1975 .

[9]  Kanstantsin Pashkovich.  Tight Lower Bounds on the Sizes of Symmetric Extensions of Permutahedra and Similar Results , 2014, Math. Oper. Res..

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

[11]  Kanstantsin Pashkovich.  Symmetry in Extended Formulations of the Permutahedron , 2009 .

[12]  G. Gallo,et al.  Extreme points and adjacency relationship in the flow polytope , 1978 .

[13]  M. R. Rao,et al.  The travelling salesman problem and a class of polyhedra of diameter two , 1974, Math. Program..

[14]  Thomas Rothvoß,et al.  The matching polytope has exponential extension complexity , 2013, STOC.

[15]  Francisco Santos,et al.  A counterexample to the Hirsch conjecture , 2010, ArXiv.

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

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

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

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