Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming (Q2248762)

This paper proves that for every integer \(n\) there exists a positive integer \(t\) such that every facet-defining inequality of the convex hull of a mixed integer polyhedral set with \(n\) integer variables is a \(t\)-branch split cut. This result is used to derive a finite cutting-plane algorithm to solve mixed integer programs. The authors also show that the minimum value of \(t\) for which the result holds grows exponentially with \(n\).