Abstract
Split cuts form a well-known class of valid inequalities for mixed-integer programming problems. Cook et al. (Math Program 47:155–174, 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 then use this result to prove that cross cuts yield closures that are rational polyhedra. Cross cuts are a generalization of split cuts introduced by Dash et al. (Math Program 135:221–254, 2012). Finally, we show that the quadrilateral closure of the two-row continuous group relaxation is a polyhedron, answering an open question in Basu et al. (Math Program 126:281–314, 2011).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Andersen, K., Cornuéjols, G., Li, Y.: Split closure and intersection cuts. Math. Program. 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.: Inequalities from two rows of a simplex tableau. In: IPCO proceedings, Lecture Notes in Computer Science, vol. 4513, pp. 1–15 (2007)
Averkov, G.: On finitely generated closures in the theory of cutting planes. Discrete Optim. 9(1), 209–215 (2012)
Averkov, G., Wagner, C., Weismantel, R.: Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three. Math. Oper. Res. 36(4), 721–742 (2011)
Balas, E.: Intersection cuts—a new type of cutting planes for integer programming. Oper. Res. 19, 19–39 (1971)
Bang, T.: A solution of the plank problem. Proc. Am. Math. Soc. 2(6), 990–993 (1951)
Basu, A., Bonami, P., Cornuéjols, G., Margot, F.: On the relative strength of split, triangle and quadrilateral cuts. Math. Program. 126, 281–314 (2011)
Basu, A., Hildebrand, R., Köppe, M.: The triangle closure is a polyhedron. Math. Program. 145, 19–58 (2014)
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, 121–126 (2011)
Dadush, D., Dey, S.S., Vielma, J.P.: On the Chvátal–Gomory closure of a compact convex set. Math. Program. 145, 327–348 (2014)
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)
Del Pia, A., Weismantel, R.: On convergence in mixed integer programming. Math. Program. 135, 397–412 (2012)
Dey, S.S., Wolsey, L.A.: Two row mixed integer cuts via lifting. Math. Program. 124, 143–174 (2010)
Dey, S.S.: Personal Communication (2010)
Dunkel, J., Schulz, A.S.: The Gomory–Chvátal closure of a non-rational polytope is a rational polytope. Math. Oper. Res. 38, 63–91 (2013)
Li, Y., Richard, J.P.P.: Cook, Kannan and Schrijver’s example revisited. Discrete Optim. 5, 724–734 (2008)
Schrijver, A.: On cutting planes. Ann. Discrete Math. 9, 291–296 (1980)
Vielma, J.P.: A constructive characterization of the split closure of a mixed integer linear program. Oper. Res. Lett. 35(1), 29–35 (2007)
Guenin, B., Awate, Y., Cornuéjols, G., Tuncel, L.: On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs. Math. Program. 150(2), 459–489 (2015)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dash, S., Günlük, O. & Morán R., D.A. On the polyhedrality of cross and quadrilateral closures. Math. Program. 160, 245–270 (2016). https://doi.org/10.1007/s10107-016-0982-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-016-0982-x