A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set

Recently Schrijver's open problem, whether the Chvatal-Gomory closure of an irrational polytope is polyhedral was answered independently in the seminal works of Dadush et al. (2011) and Dunkel and Schulz (2010); the former even applies to general compact convex sets. We present a very short, easily accessible proof.

[1]  Sebastian Pokutta,et al.  Design and verify: a new scheme for generating cutting-planes , 2011, Math. Program..

[2]  Matteo Fischetti,et al.  {0, 1/2}-Chvátal-Gomory cuts , 1996, Math. Program..

[3]  Andrea Lodi,et al.  Strengthening Chvátal-Gomory cuts and Gomory fractional cuts , 2002, Oper. Res. Lett..

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

[5]  Ralph E. Gomory,et al.  An algorithm for integer solutions to linear programs , 1958 .

[6]  H. Weyl.  Über die Gleichverteilung von Zahlen mod. Eins , 1916 .

[7]  Sebastian Pokutta,et al.  On the Rank of Cutting-Plane Proof Systems , 2010, IPCO.

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

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

[10]  Ralph E. Gomory,et al.  Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem , 2010, 50 Years of Integer Programming.

[11]  Matteo Fischetti,et al.  Projected Chvátal–Gomory cuts for mixed integer linear programs , 2008, Math. Program..

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

[13]  Daniel Dadush,et al.  The Chvátal-Gomory Closure of a Strictly Convex Body , 2011, Math. Oper. Res..

[14]  Ralph E. Gomory,et al.  Solving linear programming problems in integers , 1960 .

[15]  Friedrich Eisenbrand,et al.  Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube* , 2003, Comb..

[16]  Vasek Chvátal,et al.  Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

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

[18]  Daniel Dadush,et al.  On the Chvátal–Gomory closure of a compact convex set , 2010, Math. Program..

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

[20]  Gérard Cornuéjols,et al.  Valid inequalities for mixed integer linear programs , 2007, Math. Program..

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

[22]  Andreas S. Schulz,et al.  The Gomory-Chvátal Closure of a Non-Rational Polytope is a Rational Polytope , 2012, OR.

[23]  Matteo Fischetti,et al.  Optimizing over the first Chvátal closure , 2005, Math. Program..