Abstract
This paper addresses the problem of generating cuts for mixed integer nonlinear programs where the objective is linear and the relations between the decision variables are described by convex functions defining a convex feasible region. We propose a new method for strengthening the continuous relaxations of such problems using cutting planes. Our method can be seen as a practical implementation of the lift-and-project technique in the nonlinear case. To derive each cut we use a combination of a nonlinear programming subproblem and a linear outer approximation. One of the main features of the approach is that the subproblems solved to generate cuts are typically not more complicated than the original continuous relaxation. In particular they do not require the introduction of additional variables or nonlinearities. We propose several strategies for using the technique and present preliminary computational evidence of its practical interest. In particular, the cuts allow us to improve over the state of the art branch-and-bound of the solver Bonmin, solving more problems in faster computing times on average.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abhishek, K., Leyffer, S., Linderoth, J.: FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs. INFORMS Journal on Computing 22, 555–567 (2010)
Atamtürk, A., Narayanan, V.: Conic mixed integer rounding cuts. Mathematical Programming 122, 1–20 (2010)
Balas, E.: Disjunctive programming: Properties of the convex hull of feasible points. Discrete Applied Mathematics 89, 3–44 (1988); (originaly MSRR # 348, Carnegie Mellon University, July 1974)
Balas, E., Bonami, P.: Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants. Mathematical Programming Computations 1, 165–199 (2009)
Balas, E., Ceria, S., Cornuéjols, G.: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Programming 58, 295–324 (1993)
Balas, E., Ceria, S., Cornuéjols, G., Natraj, N.: Gomory cuts revisited. Operations Research Letters 19, 1–9 (1996)
Balas, E., Jeroslow, R.G.: Strengthening cuts for mixed integer programs. European J. Oper. Res. 4(4), 224–234 (1980)
Balas, E., Perregaard, M.: Lift and project for mixed 0-1 programming: Recent progress. Discrete Applied Mathematics 123(1-3), 129–154 (2002)
Balas, E., Perregaard, M.: A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0-1 programming. Math. Program 94(2-3, Ser. B), 221–245 (2003); The Aussois 2000 Workshop in Combinatorial Optimization
Balas, E., Zemel, E.: Facets of the knapsack polytope from minimal covers. SIAM Journal on Applied Mathematics 34, 119–148 (1978)
Bonami, P.: On optimizing over lift-and-project closures. Research Report HAL, CNRS (October 2010), http://hal.archives-ouvertes.fr/hal-00529816/en/
Bonami, P., Biegler, L.T., Conn, A.R., Cornuéjols, G., Grossmann, I.E., Laird, C.D., Lee, J., Lodi, A., Margot, F., Sawaya, N., Wächter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optimization 5(2), 186–204 (2008)
Bonami, P., Forrest, J.J.H., Laird, C., Lee, J., Margot, F., Wächter, A.: Bonmin: Basic Open-source Nonlinear Mixed INteger programming (July 2006), http://www.coin-or.org/Bonmin
Bonami, P., Kılınç, M., Linderoth, J.: Algorithms and Software for Convex Mixed Integer Nonlinear Programs. Technical report, Technical Report #1664, Computer Sciences Department, University of Wisconsin-Madison (2009)
Bonami, P., Minoux, M.: Using rank-1 lift-and-project closures to generate cuts for 0–1 MIPs, a computational investigation. Discrete Optimization 2(4), 288–307 (2005)
Bussieck, M.R., Drud, A.S., Meeraus, A.: MINLPLib – A collection of test models for mixed-integer nonlinear programming. INFORMS Journal on Computing 15(1) (2003)
Ceria, S., Soares, J.: Convex programming for disjunctive optimization. Mathematical Programming 86, 595–614 (1999)
Cezik, M.T., Iyengar, G.: Cuts for mixed 0-1 conic programming. Mathematical Programming 104, 179–202 (2005)
Fischetti, M., Lodi, A., Tramontani, A.: On the separation of disjunctive cuts. Mathematical Programming (2009), doi: 10.1007/s10107-009-0300-y (in press)
Fischetti, M., Salvagnin, D.: An in-out approach to disjunctive optimization. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 136–140. Springer, Heidelberg (2010)
Fletcher, R., Leyffer, S.: User manual for filterSQP, University of Dundee Numerical Analysis Report NA-181 (1998)
Gomory, R.E.: An algorithm for integer solution solutions to linear programming. In: Graves, R.L., Wolfe, P. (eds.) Recent Advances in Mathematical Programming, pp. 269–302. McGraw-Hill, New York (1963)
Kılınç, M., Linderoth, J., Luedtke, J.: Effective separation of disjunctive cuts for convex mixed integer nonlinear programs. Technical Report Computer Sciences Department, University of Wisconsin-Madison (2010)
Leyffer, S.: MacMINLP: Test problems for mixed integer nonlinear programming (2003), http://www.mcs.anl.gov/~leyffer/macminlp
Linderoth, J., Kılınç, M.: Personnal communication (2010)
Lougee-Heimer, R.: The common optimization interface for operations research. IBM Journal of Research and Development 47, 57–66 (2003), http://www.coin-or.org
Marchand, H., Wolsey, L.A.: Aggregation and mixed integer rounding to solve MIPs. Operations Research 49(3), 363–371 (2001)
Margot, F.: Testing cut generators for mixed integer linear programming. Mathematical Programming Computation 1, 69–95 (2009)
Perregaard, M.: Generative Disjunctive Cuts for Mixed Integer Programs. PhD thesis, Carnegie Mellon University (2003)
Sawaya, N., Laird, C.D., Biegler, L.T., Bonami, P., Conn, A.R., Cornuéjols, G., Grossmann, I.E., Lee, J., Lodi, A., Margot, F., Wächter, A.: CMU-IBM open source MINLP project test set (2006), http://egon.cheme.cmu.edu/ibm/page.htm
Stubbs, R., Mehrotra, S.: A branch-and-cut method for 0-1 mixed convex programming. Mathematical Programming 86, 515–532 (1999)
Wächter, A., Laird, C.D., Kawajir, Y.: Introduction to IPOPT: A tutorial for downloading, installing, and using IPOPT (2010), http://www.coin-or.org/Ipopt/documentation/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bonami, P. (2011). Lift-and-Project Cuts for Mixed Integer Convex Programs. In: Günlük, O., Woeginger, G.J. (eds) Integer Programming and Combinatoral Optimization. IPCO 2011. Lecture Notes in Computer Science, vol 6655. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20807-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-20807-2_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20806-5
Online ISBN: 978-3-642-20807-2
eBook Packages: Computer ScienceComputer Science (R0)