Binary extended formulations of polyhedral mixed-integer sets

We analyze different ways of constructing binary extended formulations of polyhedral mixed-integer sets with bounded integer variables and compare their relative strength with respect to split cuts. We show that among all binary extended formulations where each bounded integer variable is represented by a distinct collection of binary variables, what we call “unimodular” extended formulations are the strongest. We also compare the strength of some binary extended formulations from the literature. Finally, we study the behavior of branch-and-bound on such extended formulations and show that branching on the new binary variables leads to significantly smaller enumeration trees in some cases.

[1]  Sanjeeb Dash,et al.  Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse , 2017, INFORMS J. Comput..

[2]  Rico Zenklusen,et al.  Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations , 2017, SODA.

[3]  Warren P. Adams,et al.  A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems , 1998 .

[4]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems , 1994, Discret. Appl. Math..

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

[6]  Sanjeeb Dash,et al.  Cutting planes from extended LP formulations , 2017, Math. Program..

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

[8]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[9]  Sanjay Mehrotra,et al.  On the Value of Binary Expansions for General Mixed-Integer Linear Programs , 2002, Oper. Res..

[10]  Alper Atamtürk,et al.  On the facets of the mixed–integer knapsack polyhedron , 2003, Math. Program..

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

[12]  François Margot,et al.  Cut Generation through Binarization , 2014, IPCO.

[13]  Sanjay Mehrotra,et al.  A disjunctive cutting plane procedure for general mixed-integer linear programs , 2001, Math. Program..

[14]  F. Glover.  IMPROVED LINEAR INTEGER PROGRAMMING FORMULATIONS OF NONLINEAR INTEGER PROBLEMS , 1975 .

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

[16]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[17]  Santanu S. Dey,et al.  Split Rank of Triangle and Quadrilateral Inequalities , 2009, Math. Oper. Res..

[18]  Jean-Sébastien Roy.  "Binarize and Project" to Generate Cuts for General Mixed-integer Programs , 2007, Algorithmic Oper. Res..

[19]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[20]  Antonio Sassano,et al.  A characterization of knapsacks with the max-flow- - min-cut property , 1992, Oper. Res. Lett..

[21]  Myun-Seok Cheon,et al.  Solving Mixed Integer Bilinear Problems Using MILP Formulations , 2013, SIAM J. Optim..

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

[23]  Mathieu Van Vyve,et al.  Fixed-charge transportation problems on trees , 2015, Oper. Res. Lett..

[24]  Gérard Cornuéjols,et al.  Integer programming , 2014, Math. Program..

[25]  Alberto Del Pia,et al.  On convergence in mixed integer programming , 2012, Math. Program..