| Article ID: | iaor20101721 |
| Volume: | 38 |
| Issue: | 2 |
| Start Page Number: | 109 |
| End Page Number: | 114 |
| Publication Date: | Mar 2010 |
| Journal: | Operations Research Letters |
| Authors: | Dash Sanjeeb |
| Keywords: | cutting plane algorithms |
We prove a monotone interpolation property for split cuts which, together with results from Pudlák (1997), 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.