Split cuts and extended formulations for Mixed Integer Conic Quadratic Programming

We study split cuts and extended formulations for Mixed Integer Conic Quadratic Programming (MICQP) and their relation to Conic Mixed Integer Rounding (CMIR) cuts. We show that CMIR is a linear split cut for the polyhedral portion of an extended formulation of a quadratic set and it can be weaker than the nonlinear split cut of the same quadratic set. However, we also show that families of CMIRs can be significantly stronger than the associated family of nonlinear split cuts.

[1]  Daniel Dadush,et al.  The split closure of a strictly convex body , 2011, Oper. Res. Lett..

[2]  Daniel Bienstock,et al.  Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets , 2014, SIAM J. Optim..

[3]  Ted K. Ralphs,et al.  Integer and Combinatorial Optimization , 2013 .

[4]  Sanjay Mehrotra,et al.  A branch-and-cut method for 0-1 mixed convex programming , 1999, Math. Program..

[5]  Fatma Kilinç-Karzan,et al.  On Minimal Valid Inequalities for Mixed Integer Conic Programs , 2014, Math. Oper. Res..

[6]  R. Gomory.  Some polyhedra related to combinatorial problems , 1969 .

[7]  Pietro Belotti,et al.  On families of quadratic surfaces having fixed intersections with two hyperplanes , 2013, Discret. Appl. Math..

[8]  Gérard Cornuéjols,et al.  On the Rank of Mixed 0, 1 Polyhedra , 2001, IPCO.

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

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

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

[12]  Julio C. Góez,et al.  A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization , 2015 .

[13]  W. Marsden.  I and J , 2012 .

[14]  Juan Pablo Vielma,et al.  A Strong Dual for Conic Mixed-Integer Programs , 2012, SIAM J. Optim..

[15]  Alberto Caprara,et al.  An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming , 2010, IPCO.

[16]  James R. Luedtke,et al.  Effective separation of disjunctive cuts for convex mixed integer nonlinear programs , 2010 .

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

[18]  Shafi Goldwasser,et al.  Complexity of lattice problems - a cryptographic perspective , 2002, The Kluwer international series in engineering and computer science.

[19]  Pierre Bonami,et al.  Lift-and-Project Cuts for Mixed Integer Convex Programs , 2011, IPCO.

[20]  Alper Atamtürk,et al.  Conic mixed-integer rounding cuts , 2009, Math. Program..

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

[22]  S. Ulbrich,et al.  MIXED INTEGER SECOND ORDER CONE PROGRAMMING , 2008 .

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

[24]  Shafi Goldwasser,et al.  Complexity of lattice problems , 2002 .

[25]  Daniel Bienstock,et al.  Strong formulations for convex functions over nonconvex sets , 2012 .

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

[27]  Alberto Caprara,et al.  An effective branch-and-bound algorithm for convex quadratic integer programming , 2010, Math. Program..

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

[29]  Juan Pablo Vielma.  A constructive characterization of the split closure of a mixed integer linear program , 2007, Oper. Res. Lett..