Abstract
We study the master equality polyhedron (MEP) which generalizes the master cyclic group polyhedron (MCGP) and the master knapsack polyhedron (MKP). We present an explicit characterization of the polar of the nontrivial facet-defining inequalities for MEP. This result generalizes similar results for the MCGP by Gomory (1969) and for the MKP by Araóz (1974). Furthermore, this characterization gives a polynomial time algorithm for separating an arbitrary point from MEP. We describe how facet-defining inequalities for the MCGP can be lifted to obtain facet-defining inequalities for MEP, and also present facet-defining inequalities for MEP that cannot be obtained in such a way. Finally, we study the mixed-integer extension of MEP and present an interpolation theorem that produces valid inequalities for general mixed integer programming problems using facets of MEP.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Araóz, J.: Polyhedral Neopolarities. PhD thesis, University of Waterloo, Department of Computer Sciences (1974)
Araóz J., Evans L., Gomory R.E., Johnson E.: Cyclic group and knapsack facets. Math. Program. B 96(2), 377–408 (2003)
Balas E., Zemel E.: Facets of the knapsack polytope from minimal covers. SIAM J. Appl. Math. 34(1), 119–148 (1978)
Christof, T., Löbel, A.: PORTA—POlyhedron Representation Transformation Algorithm (2002). Available online at http://www.zib.de/Optimization/Software/Porta
Dash S., Günlük O.: On the strength of Gomory mixed-integer cuts as group cuts. Math. Program. A 115, 387–407 (2008)
Dash S., Günlük O.: (2006) Valid inequalities based on simple mixed-integer sets. Math. Program. A 105(1), 29–53 (2006)
Dash S., Günlük O.: Valid inequalities based on the interpolation procedure. Math. Program. A 106(1), 111–136 (2006)
Fischetti M., Monaci M.: How tight is the corner relaxation. Discrete Optim. 5(2), 262–269 (2008)
Fischetti M., Saturni C.: Mixed-integer cuts from cyclic groups. Math. Program. A 109(1), 27–53 (2007)
Gomory R.: Some polyhedra related to combinatorial problems. J. Linear Algebra Appl. 2(4), 451–558 (1969)
Gomory R., Johnson E.: Some continuous functions related to corner polyhedra I. Math. Program. 3(1), 23–85 (1972)
Gomory R., Johnson E.: Some continuous functions related to corner polyhedra II. Math. Program. 3(1), 359–389 (1972)
Gomory R., Johnson E.: T-space and cutting planes. Math. Program. B 96(2), 341–375 (2003)
Gomory R., Johnson E., Evans L.: Cyclic group and knapsack facets. Math. Program. B 96(2), 321–339 (2003)
Gu Z., Nemhauser G., Savelsbergh M.: Sequence independent lifting in mixed integer programming. J. Comput. Optim. 4(1), 109–129 (2000)
Nemhauser G.L., Wolsey L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)
Uchoa, E.: Robust branch-and-cut-and-price for the CMST problem and extended capacity cuts. Presentation in the MIP 2005 Workshop, Minneapolis (2005). Available at http://www.ima.umn.edu/matter/W7.25-29.05/activities/Uchoa-Eduardo/cmst-ecc-IMA.pdf
Uchoa E., Fukasawa R., Lysgaard J., Pessoa A., Poggi de~Aragão M., Andrade D.: Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation. Math. Program. A 112(2), 443–472 (2008)
Wolsey L.: Facets and strong valid inequalities for integer programs. Oper. Res. 24(2), 367–372 (1976)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dash, S., Fukasawa, R. & Günlük, O. On a generalization of the master cyclic group polyhedron. Math. Program. 125, 1–30 (2010). https://doi.org/10.1007/s10107-008-0252-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-008-0252-7