On the complexity of cutting-plane proofs using split cuts

We prove a monotone interpolation property for split cuts which, together with results from Pudlak (1997) [20], implies that cutting-plane proofs which use split cuts (or, equivalently, mixed-integer rounding cuts or Gomory mixed-integer cuts) have exponential length in the worst case.

[1]  P. Pudlák.  Sets and Proofs: On the Complexity of the Propositional Calculus , 1999 .

[2]  Stephen A. Cook,et al.  An Exponential Lower Bound for the Size of Monotone Real Circuits , 1999, J. Comput. Syst. Sci..

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

[4]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[5]  Yongpei Guan,et al.  Sequential Pairing of Mixed Integer Inequalities , 2005, IPCO.

[6]  Sanjeeb Dash,et al.  Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs , 2005, Math. Oper. Res..

[7]  Jan Kra,et al.  Lower Bounds to the Size of Constant-depth Propositional Proofs , 1994 .

[8]  Edward A. Hirsch,et al.  Several notes on the power of Gomory-Chvátal cuts , 2003, Ann. Pure Appl. Log..

[9]  Noga Alon,et al.  The monotone circuit complexity of boolean functions , 1987, Comb..

[10]  Jan Krajícek,et al.  Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic , 1997, Journal of Symbolic Logic.

[11]  Ravi B. Boppana,et al.  The Complexity of Finite Functions , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

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

[13]  Sanjeeb Dash,et al.  Valid inequalities based on simple mixed-integer sets , 2004, Math. Program..

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

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

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

[17]  William J. Cook,et al.  On the complexity of cutting-plane proofs , 1987, Discret. Appl. Math..

[18]  Andrea Lodi,et al.  On the MIR Closure of Polyhedra , 2007, IPCO.

[19]  William J. Cook,et al.  On the Matrix-Cut Rank of Polyhedra , 2001, Math. Oper. Res..

[20]  Pavel Pudlák,et al.  Lower bounds for resolution and cutting plane proofs and monotone computations , 1997, Journal of Symbolic Logic.

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

[22]  Ran Raz,et al.  Lower bounds for cutting planes proofs with small coefficients , 1995, Symposium on the Theory of Computing.

[23]  Czech Republickrajicek.  Interpolation Theorems, Lower Bounds for Proof Systems, and Independence Results for Bounded Arithmetic , 2007 .

[24]  Laurence A. Wolsey,et al.  Aggregation and Mixed Integer Rounding to Solve MIPs , 2001, Oper. Res..

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

[26]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity , 1994 .

[27]  R. Gomory.  AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .

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

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

[30]  A. Razborov.  Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic , 1995 .