Abstract
This paper contributes to the theory of cutting planes for mixed integer linear programs (MILPs). Minimal valid inequalities are well understood for a relaxation of an MILP in tableau form where all the nonbasic variables are continuous; they are derived using the gauge function of maximal lattice-free convex sets. In this paper we study lifting functions for the nonbasic integer variables starting from such minimal valid inequalities. We characterize precisely when the lifted coefficient is equal to the coefficient of the corresponding continuous variable in every minimal lifting (This result first appeared in the proceedings of IPCO 2010). The answer is a nonconvex region that can be obtained as a finite union of convex polyhedra. We then establish a necessary and sufficient condition for the uniqueness of the lifting function.
Similar content being viewed by others
References
Aliprantis C.D., Border K.C.: Infinite Dimensional Analysis: A Hitchhiker’s Guide. Springer, Berlin (2006)
Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.A.: Cutting planes from two rows of a simplex tableau. In: Proceedings of IPCO XII, Ithaca, New York (June 2007), Lecture Notes in Computer Science, vol. 4513, pp. 1–15
Balas E.: Intersection cuts—a new type of cutting planes for integer programming. Oper. Res. 19, 19–39 (1971)
Balas E., Jeroslow R.G.: Strengthening cuts for mixed integer programs. Eur. J. Oper. Res. 4, 224–234 (1980)
Barvinok A.: A Course in Convexity, Graduate Studies in Mathematics, vol. 54. American Mathematical Society, Providence (2002)
Basu, A., Campelo, M., Conforti, M., Cornuéjols, G., Zambelli, G.: On lifting integer variables in minimal inequalities. In: Proceeding of IPCO 2010, Lausanne, Switzerland (June 2010), Lecture Notes in Computer Science, vol. 6080, pp. 85–95
Basu A., Conforti M., Cornuéjols G., Zambelli G.: A counterexample to a conjecture of Gomory and Johnson. Math. Program. Ser. A 133, 25–38 (2012)
Basu A., Conforti M., Cornuéjols G., Zambelli G.: Maximal lattice-free convex sets in linear subspaces. Math. Oper. Res. 35(3), 704–720 (2010)
Basu A., Conforti M., Cornuéjols G., Zambelli G.: Minimal inequalities for an infinite relaxation of integer programs. SIAM J. Discret. Math. 24(1), 158–168 (2010)
Basu, A., Cornuéjols, G., Köppe, M.: Unique minimal liftings for simplicial polytopes. Math. Oper. Res. 37, 346–355 (2012). http://arxiv.org/abs/1103.4112
Borozan V., Cornuéjols G.: Minimal valid inequalities for integer constraints. Math. Oper. Res. 34(3), 538–546 (2009)
Conforti M., Cornuéjols G., Zambelli G.: Corner polyhedron and intersection cuts, March 2011. Surv. Oper. Res. Manag. Sci. 16, 105–120 (2011). doi:10.1016/j.sorms.2011.03.001
Conforti M., Cornuéjols G., Zambelli G.: A geometric perspective on lifting. Oper. Res. 59, 569–577 (2011)
Dey, S.S., Wolsey, L.A.: Lifting integer variables in minimal inequalities corresponding to lattice-free triangles. In: IPCO 2008, Bertinoro, Italy (May 2008), Lecture Notes in Computer Science, vol. 5035, pp. 463–475
Dey S.S., Wolsey L.A.: Constrained infinite group relaxations of MIPs. SIAM J. Optim. 20, 2890–2912 (2010)
Gomory R.E.: Some polyhedra related to combinatorial problems. Linear Algebra Its Appl. 2, 451–558 (1969)
Gomory R.E., Johnson E.L.: Some continuous functions related to corner polyhedra, Part I. Math. Program. 3, 23–85 (1972)
Johnson E.L.: On the group problem for mixed integer programming. Math. Program. Study 2, 137–179 (1974)
Lovász L.: Geometry of numbers and integer programming. In: Iri M., Tanabe K. (eds.) Mathematical Programming: Recent Developments and Applications. Kluwer, Dordrecht pp. 177–210, (1989)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Basu, A., Campêlo, M., Conforti, M. et al. Unique lifting of integer variables in minimal inequalities. Math. Program. 141, 561–576 (2013). https://doi.org/10.1007/s10107-012-0560-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-012-0560-9