Generalized Chvátal-Gomory closures for integer programs with bounds on variables. (English) Zbl 1478.90059
Summary: Integer programming problems that arise in practice often involve decision variables with one or two sided bounds. In this paper, we consider a generalization of Chvátal-Gomory inequalities obtained by strengthening Chvátal-Gomory inequalities using the bounds on the variables. We prove that the closure of a rational polyhedron obtained after applying the generalized Chvátal-Gomory inequalities is also a rational polyhedron. This generalizes a result of Dunkel and Schulz on 0–1 problems to the case when some of the variables have upper or lower bounds or both while the rest of them are unbounded.
MSC:
| 90C10 | Integer programming |
| 90C11 | Mixed integer programming |
| 90C27 | Combinatorial optimization |
| 90C57 | Polyhedral combinatorics, branch-and-bound, branch-and-cut |
Keywords:
integer programming; cutting planes; Chvátal-Gomory cuts; S-free sets; Chvátal-Gomory closure; polyhedralityReferences:
| [1] | Bockmayr, A.; Eisenbrand, F., Cutting planes and the elementary closure in fixed dimension, Math. Oper. Res., 26, 304-312 (2001) · Zbl 1082.90549 · doi:10.1287/moor.26.2.304.10555 |
| [2] | Bonami, P., Lodi, A., Tramontani, A., Wiese, S.: Cutting planes from wide split disjunction, IPCO 2017. In: Eisenbrand, F., Könemann, J. (eds.) LNCS 10328, pp. 99-110 (2017) · Zbl 1418.90284 |
| [3] | Crowder, H.; Johnson, E.; Padberg, M., Solving large-scale zero-one linear programming problems, Oper. Res., 31, 803-834 (1983) · Zbl 0576.90065 · doi:10.1287/opre.31.5.803 |
| [4] | Chvátal, V., Edmonds polytopes and a hierarchy of combinatorial problems, Discret. Math., 4, 305-337 (1973) · Zbl 0253.05131 · doi:10.1016/0012-365X(73)90167-2 |
| [5] | Cook, WJ; Kannan, R.; Schrijver, A., Chvátal closures for mixed integer programming problems, Math. Program., 47, 155-174 (1990) · Zbl 0711.90057 · doi:10.1007/BF01580858 |
| [6] | Dadush, D.; Dey, SS; Vielma, JP, On the Chvátal-Gomory closure of a compact convex set, Math. Program., 145, 327-348 (2014) · Zbl 1298.90056 · doi:10.1007/s10107-013-0649-9 |
| [7] | Dash, S.; Günlük, O.; Moran, DAR, On the polyhedrality of closures of multi-branch split sets and other polyhedra with bounded max-facet-width, SIAM J. Optim., 27, 1340-1361 (2017) · Zbl 1373.90081 · doi:10.1137/16M1087783 |
| [8] | Dash, S., Günlük, O., Moran, D.A.R.: Lattice closures of polyhedra. In: Mathematical Programming · Zbl 1445.90063 |
| [9] | Del Pia, A., Gijswijt, D., Linderoth, J., Zhu, H.: Integer packing sets form a well-quasi-ordering. arXiv:1911.12841 (2019) · Zbl 1525.52008 |
| [10] | Dirichlet, G.L.: Verallgemeinerung eines Satzes aus der Lehre von den Kettenbriichen nebst einigen Anwendungen auf die Theorie der Zahlen. Bericht iiber die zur Bekanntmachung geeigneten Verhandlungen der Königlich Preussischen Akademie der Wissenschaften zu Berlin (1842) 93-95. (Reprinted in: L. Kronecker (ed.) G.L. Dirichlet’s Werke Vol. I, G. Reimer, Berlin, 1889 (reprinted: Chelsea, New York, 1969), pp. 635-638) |
| [11] | Dunkel, J., Schulz, A.S.: A refined Gomory-Chvátal closure for polytopes in the unit cube. Technical report. http://www.optimization-online.org/DB_HTML/2012/03/3404.html (2012). Accessed 7 June 2020 |
| [12] | Dunkel, J.; Schulz, AS, The Gomory-Chvátal closure of a nonrational polytope is a rational polytope, Math. Oper. Res., 38, 63-91 (2013) · Zbl 1291.90142 · doi:10.1287/moor.1120.0565 |
| [13] | Eisenbrand, F., On the membership problem for the elementary closure of a polyhedron, Combinatorica, 19, 297-300 (1999) · Zbl 0947.90071 · doi:10.1007/s004930050057 |
| [14] | Fischetti, M.; Lodi, A., On the knapsack closure of 0-1 integer linear programs, Electron. NotesDiscret. Math., 36, 799-804 (2010) · Zbl 1274.90240 · doi:10.1016/j.endm.2010.05.101 |
| [15] | Furini, F., Ljubić, I., Sinnl, M.: ILP and CP formulations for the lazy bureaucrat problem, CPAIOR 2015. In: Michel, L. (ed.) LNCS, vol. 9075, pp. 255-270 (2015) · Zbl 1464.90076 |
| [16] | Gomory, RE, Outline of an algorithm for integer solutions to linear programs, Bull. Am. Math. Soc., 64, 275-278 (1958) · Zbl 0085.35807 · doi:10.1090/S0002-9904-1958-10224-4 |
| [17] | Huchette, J.: Advanced mixed-integer programming formulations: methodology, computation, and application, Ph.D. thesis, Massachusetts Institute of Technology (2018) |
| [18] | Meyer, RR, On the existence of optimal solutions to integer and mixed integer programming problems, Math. Program., 7, 223-235 (1974) · Zbl 0292.90036 · doi:10.1007/BF01585518 |
| [19] | Pashkovich, K., Poirrier, L., Pulyassary, H.: The aggregation closure is polyhedral for packing and covering integer programs arXiv:1910.03404 (2019) |
| [20] | Pokutta, S.: Lower bounds for Chvátal-Gomory style operators. Technical report. http://www.optimization-online.org/DB_HTML/2011/09/3151.html (2011). Accessed 7 June 2020 · Zbl 1219.90106 |
| [21] | Schrijver, A., On cutting planes, Ann. Discret. Math., 9, 291-296 (1980) · Zbl 0441.90070 · doi:10.1016/S0167-5060(08)70085-2 |
| [22] | Vielma, JP, Embedding formulations and complexity for unions of polyhedra, Manag. Sci., 64, 4471-4965 (2018) · doi:10.1287/mnsc.2017.2856 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
