Abstract
In this paper we study the t-branch split cuts introduced by Li and Richard (Discret Optim 5:724–734, 2008). They presented a family of mixed-integer programs with n integer variables and a single continuous variable and conjectured that the convex hull of integer solutions for any n has unbounded rank with respect to (n−1)-branch split cuts. It was shown earlier by Cook et al. (Math Program 47:155–174, 1990) that this conjecture is true when n = 2, and Li and Richard proved the conjecture when n = 3. In this paper we show that this conjecture is also true for all n > 3.
This is a preview of subscription content, log in via an institution to check access.
References
Cook W.J., Kannan R., Schrijver A.: Chvátal closures for mixed integer programming problems. Math. Program. 47, 155–174 (1990)
Dash, S., Dobbs, N.B., Günlük, O., Nowicki, T.J., Swirszcz, G.: Disjunctive cuts, lattice-free sets and mixed-integer programming. Manuscript (2011)
Gomory, R.E.: An algorithm for the mixed integer problem. RM-2597, The Rand Corporation (1960)
Li Y., Richard J.P.P.: Cook, Kannan and Schrijver’s example revisited. Discret. Optim. 5, 724–734 (2008)
Rudelson M.: Distances between non-symmetric convex bodies and the MM* estimate. Positivity 4, 161–178 (2000)