Abstract
Recently Andersen et al. [1], Borozan and Cornuéjols [6] and Cornuéjols and Margot [9] have characterized the extreme valid inequalities of a mixed integer set consisting of two equations with two free integer variables and non-negative continuous variables. These inequalities are either split cuts or intersection cuts derived using maximal lattice-free convex sets. In order to use these inequalities to obtain cuts from two rows of a general simplex tableau, one approach is to extend the system to include all possible non-negative integer variables (giving the two row mixed-integer infinite-group problem), and to develop lifting functions giving the coefficients of the integer variables in the corresponding inequalities. In this paper, we study the characteristics of these lifting functions. We show that there exists a unique lifting function that yields extreme inequalities when starting from a maximal lattice-free triangle with multiple integer points in the relative interior of one of its sides, or a maximal lattice-free triangle with integral vertices and one integer point in the relative interior of each side. In the other cases (maximal lattice-free triangles with one integer point in the relative interior of each side and non-integral vertices, and maximal lattice-free quadrilaterals), non-unique lifting functions may yield distinct extreme inequalities. For the latter family of triangles, we present sufficient conditions to yield an extreme inequality for the two row mixed-integer infinite-group problem.
Similar content being viewed by others
References
Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.A.: Cutting planes from two rows of a simplex tableau. In: Fischetti, M., Williamson, D.P. (eds.) Proceedings 12th Conference on Integer Programming and Combinatorial Optimization, pp. 1–15. Springer (2007)
Aráoz J., Evans L., Gomory R.E., Johnson E.L.: Cyclic group and knapsack facets. Math. Prog. 96, 377–408 (2003)
Balas E.: Disjunctive programming. Ann. Discrete Math. 5, 3–51 (1979)
Balas E.: Intersection cuts—a new type of cutting planes for integer programming. Oper. Res. 19, 19–39 (1971)
Balas E., Jeroslow R.: Strengthening cuts for mixed integer programs. Eur. J. Oper. Res. 4, 224–234 (1980)
Borozan, V., Cornuéjols, G.: Minimal valid inequalities for integer constraints. http://integer.tepper.cmu.edu (2007)
Cook W.J., Kannan R., Schrijver A.: Chvátal closures for mixed integer programming problems. Math. Prog. 47, 155–174 (1990)
Cornuéjols G., Li Y.: Elementary closures for integer programs. Oper. Res. Lett. 28, 1–8 (2001)
Cornuéjols, G., Margot, F.: On the facets of mixed integer programs with two integer variables and two constraints. To appear in Math. Prog. (2008)
Cornuéjols G., Li Y., Vandenbussche D.: K-cuts: a variation of Gomory mixed integer cuts from the LP tableau. INFORMS J. Comput. 15, 385–396 (2003)
Dash S., Günlük O.: Valid inequalities based on simple mixed-integer sets. Math. Prog. 105, 29–53 (2006)
Dash, S., Günlük, O.: On the strength of Gomory mixed-integer cuts as group cuts. Technical Report RC23967, IBM Research report (2006b)
Dey, S.S., Richard, J.-P.P.: Sequential-merge facets for two-dimensional group problems. In: Fischetti, M., Williamson, D.P. (eds.) Proceedings 12th Conference on Integer Programming and Combinatorial Optimization, pp. 30–42. Springer (2007)
Dey S.S., Richard J.-P.P.: Facets of two-dimensional infinite group problems. Math. Oper. Res. 33, 140–166 (2008)
Dey, S.S., Wolsey, L.A.: Lifting integer variables in minimal inequalities corresponding to lattice-free triangles. In: Lodi, A., Panconesci, A., Rinaldi, G. (eds.) Proceedings 13th Conference on Integer Programming and Combinatorial Optimization, pp. 463–475. Springer (2007)
Dey, S.S., Wolsey, L.A.: Two row mixed integer cuts via lifting. Technical Report 30, CORE DP, Université catholique de Louvain, Louvain-la-Neuve, Belgium (2008)
Fischetti M., Saturni C.: Mixed integer cuts from cyclic groups. Math. Prog. 109, 27–53 (2007)
Gomory R.E.: Some polyhedra related to combinatorial problems. Linear Algebra Appl. 2, 451–558 (1969)
Gomory, R.E.: An algorithm for the mixed-integer problem. Technical Report RM-2597, Rand Report (1960)
Gomory R.E., Johnson E.L.: Some continuous functions related to corner polyhedra, part I. Math. Prog. 3, 23–85 (1972)
Gomory R.E., Johnson E.L.: Some continuous functions related to corner polyhedra, part II. Math. Prog. 3, 359–389 (1972)
Gomory R.E., Johnson E.L.: T-space and cutting planes. Math. Prog. 96, 341–375 (2003)
Gomory R.E., Johnson E.L., Evans L.: Corner polyhedra and their connection with cutting planes. Math. Prog. 96, 321–339 (2003)
Johnson E.L.: On the group problem for mixed integer programming. Math. Prog. Study 2, 137–179 (1974)
Johnson E.L.: Characterization of facets for multiple right-hand choice linear programs. Math. Prog. Study 14, 112–142 (1981)
Lovász L.: Geometry of numbers and integer programming. In: Iri, M., Tanabe, K. (eds) Mathematical Programming: Recent Developments and Applications, Kluwer, Dordrecht (1989)
Miller L.A., Li Y., Richard J.-P.P.: New facets for finite and infinite group problems from approximate lifting. Naval Res. Logis. 55, 172–191 (2008)
Nemhauser G.L., Wolsey L.A.: A recursive procedure to generate all cuts for 0–1 mixed integer programs. Math. Prog. 46, 379–390 (1990)
Nemhauser G.L., Wolsey L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)
Richard, J.-P.P., Li, Y., Miller, L.A.: Valid inequalities for MIPs and group polyhedra from approximate liftings. Math. Prog. 118, 253–277 (2009)
Rockafeller G.T.: Convex Analysis. Princeton University Press, New Jersey, NJ (1970)
Author information
Authors and Affiliations
Corresponding author
Additional information
This text presents research results of the Belgian Program on Interuniversity Poles of Attraction initiated by the Belgian State, Prime Minister’s Office, Science Policy Programming. The scientific responsibility is assumed by the authors.
Rights and permissions
About this article
Cite this article
Dey, S.S., Wolsey, L.A. Two row mixed-integer cuts via lifting. Math. Program. 124, 143–174 (2010). https://doi.org/10.1007/s10107-010-0362-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-010-0362-x