On a generalization of the Chvátal–Gomory closure

Many practical integer programming problems involve variables with one or two-sided bounds. Dunkel and Schulz (2012) considered a strengthened version of Chvatal-Gomory (CG) inequalities that use 0–1 bounds on variables, and showed that the set of points in a rational polytope that satisfy all these strengthened inequalities is a polytope. Recently, we generalized this result by considering strengthened CG inequalities that use all variable bounds. In this paper, we generalize further by considering not just variable bounds, but general linear constraints on variables. We show that all points in a rational polyhedron that satisfy such strengthened CG inequalities form a rational polyhedron.

[1]  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.

[2]  Laurence A. Wolsey,et al.  Constrained Infinite Group Relaxations of MIPs , 2010, SIAM J. Optim..

[3]  Laurence A. Wolsey,et al.  Inequalities from Two Rows of a Simplex Tableau , 2007, IPCO.

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

[5]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

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

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

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

[9]  Robert R. Meyer,et al.  On the existence of optimal solutions to integer and mixed-integer programming problems , 1974, Math. Program..

[10]  Sanjeeb Dash,et al.  On the polyhedrality of cross and quadrilateral closures , 2016, Math. Program..

[11]  Felipe Serrano,et al.  Intersection Cuts for Factorable MINLP , 2018, IPCO.

[12]  Gérard Cornuéjols,et al.  Lifting Gomory cuts with bounded variables , 2013, Oper. Res. Lett..

[13]  Egon Balas,et al.  Intersection Cuts - A New Type of Cutting Planes for Integer Programming , 1971, Oper. Res..

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

[15]  Matteo Fischetti,et al.  On the knapsack closure of 0-1 Integer Linear Programs , 2010, Electron. Notes Discret. Math..

[16]  Sebastian Pokutta,et al.  A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set , 2012, Oper. Res. Lett..

[17]  Sanjeeb Dash,et al.  On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width , 2017, SIAM J. Optim..

[18]  S. Pokutta.  LOWER BOUNDS FOR CHVÁTAL-GOMORY STYLE OPERATORS , 2011 .

[19]  Kent Andersen,et al.  An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets , 2009, Math. Oper. Res..

[20]  G. Nemhauser,et al.  Integer Programming , 2020 .

[21]  Gennadiy Averkov.  On finitely generated closures in the theory of cutting planes , 2012, Discret. Optim..

[22]  Alberto Del Pia,et al.  Chvátal Rank in Binary Polynomial Optimization , 2021, INFORMS Journal on Optimization.

[23]  Ellis L. Johnson,et al.  Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..

[24]  Andreas S. Schulz,et al.  A Refined Gomory-Chvátal Closure for Polytopes in the Unit Cube ∗ , 2012 .

[25]  Bert Gerards,et al.  Matrices with the edmonds—Johnson property , 1986, Comb..

[26]  Mehmet Tolga Çezik,et al.  Cuts for mixed 0-1 conic programming , 2005, Math. Program..

[27]  Gérard Cornuéjols,et al.  Minimal Valid Inequalities for Integer Constraints , 2009, Math. Oper. Res..

[28]  Kent Andersen,et al.  Split closure and intersection cuts , 2002, Math. Program..

[29]  Jeff Linderoth,et al.  Integer packing sets form a well-quasi-ordering , 2019, Oper. Res. Lett..

[30]  Gérard Cornuéjols,et al.  Cut-Generating Functions and S-Free Sets , 2015, Math. Oper. Res..

[31]  Andrea Lodi,et al.  Cutting Planes from Wide Split Disjunctions , 2017, IPCO.

[32]  L. Kronecker,et al.  Verallgemeinerung eines Satzes aus der Lehre von den Kettenbrüchen nebst einigen Anwendungen auf die Theorie der Zahlen , 2012 .

[33]  Andrea Lodi,et al.  MIR closures of polyhedral sets , 2009, Math. Program..

[34]  Matthias Köppe,et al.  The triangle closure is a polyhedron , 2011, Math. Program..

[35]  Juan Pablo Vielma,et al.  Intersection cuts for nonlinear integer programming: convexification techniques for structured sets , 2013, Mathematical Programming.

[36]  Kent Andersen,et al.  Intersection Cuts for Mixed Integer Conic Quadratic Sets , 2013, IPCO.

[37]  Gonzalo Munoz,et al.  Maximal Quadratic-Free Sets , 2020, IPCO.

[38]  Andreas S. Schulz,et al.  The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope , 2013, Math. Oper. Res..

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

[40]  James R. Luedtke,et al.  Intersection Disjunctions for Reverse Convex Sets , 2019, Math. Oper. Res..

[41]  Juan Pablo Vielma,et al.  The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron , 2010, IPCO.

[42]  Daniel Bienstock,et al.  Outer-product-free sets for polynomial optimization and oracle-based cuts , 2016, Math. Program..

[43]  Yanjun Li,et al.  Cook, Kannan and Schrijver's example revisited , 2008, Discret. Optim..

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

[45]  Matteo Fischetti,et al.  A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs , 2017, Oper. Res..

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

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

[48]  Kanstantsin Pashkovich,et al.  The aggregation closure is polyhedral for packing and covering integer programs , 2021, Mathematical Programming.

[49]  Sanjeeb Dash,et al.  Generalized Chvátal-Gomory closures for integer programs with bounds on variables , 2020, Math. Program..