Abstract
Split cuts form a well-known class of valid inequalities for mixed-integer programming problems (MIP). Cook et al. (1990) showed that the split closure of a rational polyhedron P is again a polyhedron. In this paper, we extend this result from a single rational polyhedron to the union of a finite number of rational polyhedra. We also show how this result can be used to prove that some generalizations of split cuts, namely cross cuts, also yield closures that are rational polyhedra.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Andersen, K., Cornuéjols, G., Li, Y.: Split closure and intersection cuts. Mathematical Programming 102(3), 457–493 (2005)
Andersen, K., Louveaux, Q., Weismantel, R.: An analysis of mixed integer linear sets based on lattice point free convex sets. Math. Oper. Res. 35(1), 233–256 (2010)
Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.A.: Inequalities from Two Rows of a Simplex Tableau. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 1–15. Springer, Heidelberg (2007)
Averkov, G.: On finitely generated closures in the theory of cutting planes. Discrete Optimization 9(1), 209–215 (2012)
Averkov, G., Wagner, C., Weismantel, R.: Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three. Mathematics of Operations Research 36(4), 721–742 (2011)
Bang, T.: A solution of the plank problem. Proc. American Mathematical Society 2(6), 990–993 (1951)
Basu, A., Hildebrand, R., Köppe, M.: The triangle closure is a polyhedron (2011) (manuscript)
Cook, W.J., Kannan, R., Schrijver, A.: Chvátal closures for mixed integer programming problems. Math. Program. 47, 155–174 (1990)
Dadush, D., Dey, S.S., Vielma, J.P.: The split closure of a strictly convex body. Oper. Res. Lett. 39(2), 121–126 (2011)
Dash, S., Dey, S., Günlük, O.: Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra. Math. Program. 135, 221–254 (2012)
Dash, S., Günlük, O., Lodi, A.: MIR closures of polyhedral sets. Math. Program. 121(1), 33–60 (2010)
Dey, S.S.: Personal Communication (2010)
Klee, V.L.: Extremal structure of convex sets. Archiv der Mathematik 8, 234–240 (1957)
Li, Y., Richard, J.P.P.: Cook, Kannan and Schrijver’s example revisited. Discrete Optimization 5, 724–734 (2008)
Rockafeller, G.T.: Convex analysis. Princeton University Press, New Jersey (1970)
Schrijver, A.: Theory of linear and integer programming. John Wiley and Sons, New York (1986)
Vielma, J.P.: A constructive characterization of the split closure of a mixed integer linear program. Oper. Res. Lett. 35(1), 29–35 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dash, S., Günlük, O., Ramirez, D.A.M. (2013). On Some Generalizations of the Split Closure. In: Goemans, M., Correa, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 2013. Lecture Notes in Computer Science, vol 7801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36694-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-36694-9_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36693-2
Online ISBN: 978-3-642-36694-9
eBook Packages: Computer ScienceComputer Science (R0)