This paper presents a general, self-contained treatment of convexity or intersection cuts. It describes two equivalent ways of generating a cut—via a convex set or a concave function—and a partial-order notion of cut strength. We then characterize the structure of the sets and functions that generate cuts that are strongest with respect to the partial order. Next, we specialize this analytical framework to the case of mixed-integer linear programming (MIP). For this case, we formulate two kinds of the deepest cut generation problem, via sets or via functions, and subsequently consider some special cases which are amenable to efficient computation. We conclude with computational tests of one of these procedures on a large set of MIPLIB problems.
Keywordsinteger programming cutting planes convexity cuts
Unable to display preview. Download preview PDF.
- Balas, E. (1971). “Intersection Cuts—A New Type of Cutting Planes for Integer Programming.” Operations Research 19, 19–39.Google Scholar
- Balas, E., V.J. Bowman, F. Glover, and D. Sommer. (1971). “An Intersection Cut From the Dual of the Unit Hypercube.” Operations Research 19, 40–44.Google Scholar
- Balas, E., S. Ceria, and G. Cornuéjols. (1996). “Mixed 0–1 Programming by Lift-And-Project in a Branch-And-Cut Framework.” Management Science 42(9), 1229–1246.Google Scholar
- Bixby, R.E., S. Ceria, C.M. McZeal, and M.W.P. Savelsberg. (1998). “An Updated Mixed Integer Programming Library: MIPLIB 3.0.” Technical Report 98-3, Department of Computational and Applied Mathematics, Rice University.Google Scholar
- COmputational INfrastructure for Operations Research, 2004. http://www.coin-or.org/.
- Berg, M., M. Kreveld, M. Overmars, and O. Schwarzkopf. (2000). “Computational Geometry: Algorithms and Applications.” Springer-Verlag, Berlin, second, revised edition.Google Scholar
- Glover, F. (1973). “Convexity Cuts and Cut Search.” Operations Research 21, 123–134.Google Scholar
- Jeroslow, R.G. (1977). “Cutting-Plane Theory: Disjunctive Methods.” In Studies in integer programming (Proc. Workshop, Bonn, 1975), Annals of Discrete Mathematics, North-Holland, Amsterdam, vol. 1, pp. 293–330.Google Scholar
- Lougee-Heimer, R. (2003). The Common Optimization Interface for Operations Research: Promoting Open-Source Software in the Operations Research Community. IBM Journal of Research and Development 47(1), 57–66. http:////www.research.ibm.com/journal/rd47-1.html.
- Nediak, M. and J. Eckstein. (2001). “Pivot, Cut, and Dive: A Heuristic for 0–1 Mixed Integer Programming.” RUTCOR Research Report 53-2001. Rutgers University, Piscataway, NJ.Google Scholar
- Raghavachari, M. (1969). “On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints.” Operations Research 17, 680–684.Google Scholar
- Rockafellar, R.T. (1970). Convex analysis. Princeton University Press, Princeton, N.J.Google Scholar
- Tuy, H. (1964). “Concave Programming Under Linear Constraints.” Soviet Mathematics pp. 1437–1440.Google Scholar