Generalized Chvátal-Gomory closures for integer programs with bounds on variables

Integer programming problems that arise in practice often involve decision variables with one or two sided bounds. In this paper, we consider a generalization of Chvátal-Gomory inequalities obtained by strengthening Chvátal-Gomory inequalities using the bounds on the variables. We prove that the closure of a rational polyhedron obtained after applying the generalized Chvátal-Gomory inequalities is also a rational polyhedron. This generalizes a result of Dunkel and Schulz on 0–1 problems to the case when some of the variables have upper or lower bounds or both while the rest of them are unbounded.

[1]  Serhan Ziya,et al.  Patient Triage and Prioritization Under Austere Conditions , 2018, Manag. Sci..

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

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

[4]  Ivana Ljubic,et al.  ILP and CP Formulations for the Lazy Bureaucrat Problem , 2015, CPAIOR.

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

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

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

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

[9]  Alexander Schrijver,et al.  On Cutting Planes , 1980 .

[10]  Sanjeeb Dash,et al.  Lattice closures of polyhedra , 2020, Math. Program..

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

[12]  Friedrich Eisenbrand,et al.  Cutting Planes and the Elementary Closure in Fixed Dimension , 2001, Math. Oper. Res..

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

[14]  Friedrich Eisenbrand,et al.  NOTE – On the Membership Problem for the Elementary Closure of a Polyhedron , 1999, Comb..

[15]  Juan Pablo Vielma.  Embedding Formulations and Complexity for Unions of Polyhedra , 2018, Manag. Sci..

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

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

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

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

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

[21]  P. Alam.  ‘O’ , 2021, Composites Engineering: An A–Z Guide.

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

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

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

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

[26]  Joseph Andrew Huchette,et al.  Advanced mixed-integer programming formulations : methodology, computation, and application , 2018 .

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

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