Reverse Chvátal-Gomory Rank

We introduce the reverse Chvatal--Gomory rank $r^*(P)$ of an integral polyhedron $P$, defined as the supremum of the Chvatal--Gomory ranks of all rational polyhedra whose integer hull is $P$. A well-known example in dimension two shows that there exist integral polytopes $P$ with $r^*(P)=+\infty$. We provide a geometric characterization of polyhedra with this property in every dimension, and investigate upper bounds on $r^*(P)$ when this value is finite.

[1]  Laura Sanità,et al.  0/1 Polytopes with Quadratic Chvátal Rank , 2017, Oper. Res..

[2]  Claus-Peter Schnorr,et al.  Geometry of Numbers and Integer Programming (Summary) , 1988, STACS.

[3]  Alexander Barvinok,et al.  A course in convexity , 2002, Graduate studies in mathematics.

[4]  William J. Cook,et al.  On cutting-plane proofs in combinatorial optimization , 1989 .

[5]  Alberto Del Pia On the Rank of Disjunctive Cuts , 2012, Math. Oper. Res..

[6]  Marco Di Summa,et al.  On the Convergence of the Affine Hull of the Chvátal-Gomory Closures , 2012, SIAM J. Discret. Math..

[7]  Gérard Cornuéjols,et al.  Intersection Cuts with Infinite Split Rank , 2012, Math. Oper. Res..

[8]  Gérard Cornuéjols,et al.  Maximal Lattice-Free Convex Sets in Linear Subspaces , 2010, Math. Oper. Res..

[9]  William J. Cook,et al.  Chvátal closures for mixed integer programming problems , 1990, Math. Program..

[10]  William J. Cook,et al.  On the complexity of cutting-plane proofs , 1987, Discret. Appl. Math..

[11]  Friedrich Eisenbrand,et al.  Parametric Integer Programming in Fixed Dimension , 2008, Math. Oper. Res..

[12]  Sebastian Pokutta,et al.  Lower bounds for the Chvátal-Gomory rank in the 0/1 cube , 2011, Oper. Res. Lett..

[13]  Marco Di Summa,et al.  Reverse split rank , 2014, IPCO.

[14]  Jeffrey C. Lagarias,et al.  Bounds for Lattice Polytopes Containing a Fixed Number of Interior Points in a Sublattice , 1991, Canadian Journal of Mathematics.

[15]  Günter M. Ziegler,et al.  Projecting Lattice Polytopes Without Interior Lattice Points , 2011, Math. Oper. Res..

[16]  G. C. Shephard,et al.  Convex Polytopes , 1969, The Mathematical Gazette.

[17]  Friedrich Eisenbrand,et al.  On the Chvátal Rank of Polytopes in the 0/1 Cube , 1999, Discret. Appl. Math..

[18]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[19]  C. Burdet,et al.  On cutting planes , 1973 .

[20]  M. W. Shields An Introduction to Automata Theory , 1988 .

[21]  Friedrich Eisenbrand,et al.  Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube , 1999, IPCO.

[22]  Marc E. Pfetsch,et al.  Some Algorithmic Problems in Polytope Theory , 2003, Algebra, Geometry, and Software Systems.