On optimizing over lift-and-project closures

The strengthened lift-and-project closure of a mixed integer linear program is the polyhedron obtained by intersecting all strengthened lift-and-project cuts obtained from its initial formulation, or equivalently all mixed integer Gomory cuts read from all tableaux corresponding to feasible and infeasible bases of the LP relaxation. In this paper, we present an algorithm for approximately optimizing over the strengthened lift-and-project closure. The originality of our method is that it relies on a cut generation linear programming problem which is obtained from the original LP relaxation by only modifying the bounds on the variables and constraints. This separation LP can also be seen as dual to the cut generation LP used in disjunctive programming procedures with a particular normalization. We study properties of this separation LP, and discuss how to use it to approximately optimize over the strengthened lift-and-project closure. Finally, we present computational experiments and comparisons with recent related works.

[1]  Kent Andersen,et al.  Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts , 2005, Manag. Sci..

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

[3]  Laurence A. Wolsey,et al.  Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings , 2007, CPAIOR.

[4]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[5]  Gérard Cornuéjols,et al.  Practical strategies for generating rank-1 split cuts in mixed-integer linear programming , 2011, Math. Program. Comput..

[6]  Jean-Charles Régin,et al.  Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems , 2004, Lecture Notes in Computer Science.

[7]  Thorsten Koch,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Miplib 2003 , 2022 .

[8]  Laurence A. Wolsey,et al.  A recursive procedure to generate all cuts for 0–1 mixed integer programs , 1990, Math. Program..

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

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

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

[12]  Matteo Fischetti,et al.  On the separation of disjunctive cuts , 2011, Math. Program..

[13]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[14]  Robert E. Bixby,et al.  Mixed-Integer Programming: A Progress Report , 2004, The Sharpest Cut.

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

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

[17]  Egon Balas,et al.  A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming , 2003, Math. Program..

[18]  Hanif D. Sherali,et al.  Disjunctive Programming , 2009, Encyclopedia of Optimization.

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

[20]  Sanjeeb Dash,et al.  A heuristic to generate rank-1 GMI cuts , 2010, Math. Program. Comput..

[21]  Matteo Fischetti,et al.  A relax-and-cut framework for Gomory mixed-integer cuts , 2011, Math. Program. Comput..

[22]  E. Balas.  Disjunctive programming and a hierarchy of relaxations for discrete optimization problems , 1985 .

[23]  Alberto Caprara,et al.  On the separation of split cuts and related inequalities , 2003, Math. Program..

[24]  Laurence A. Wolsey,et al.  Solving Mixed Integer Programming Problems Using Automatic Reformulation , 1987, Oper. Res..

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

[26]  Gérard Cornuéjols,et al.  Elementary closures for integer programs , 2001, Oper. Res. Lett..

[27]  R. Lougee-Heimer,et al.  The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community , 2003 .

[28]  M. Minoux,et al.  Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation , 2005, Discret. Optim..

[29]  Matteo Fischetti,et al.  An In-Out Approach to Disjunctive Optimization , 2010, CPAIOR.

[30]  Matteo Fischetti,et al.  A Relax-and-Cut Framework for Gomory's Mixed-Integer Cuts , 2010, CPAIOR.

[31]  E. Balas,et al.  Facets of the Knapsack Polytope From Minimal Covers , 1978 .

[32]  Egon Balas,et al.  Lift-and-project for Mixed 0-1 programming: recent progress , 2002, Discret. Appl. Math..

[33]  Egon Balas,et al.  Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants , 2009, Math. Program. Comput..

[34]  Egon Balas,et al.  Optimizing over the split closure , 2008, Math. Program..

[35]  Egon Balas,et al.  Gomory cuts revisited , 1996, Oper. Res. Lett..

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

[37]  E. Balas,et al.  Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework , 1996 .

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

[39]  E. Balas,et al.  Strengthening cuts for mixed integer programs , 1980 .

[40]  Robin Lougee,et al.  The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community , 2003, IBM J. Res. Dev..

[41]  Laurence A. Wolsey,et al.  Valid Linear Inequalities for Fixed Charge Problems , 1985, Oper. Res..

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