Abstract
We describe a computationally effective method for generating lift-and-project cuts for convex mixed-integer nonlinear programs (MINLPs). The method relies on solving a sequence of cut-generating linear programs and in the limit generates an inequality as strong as the lift-and-project cut that can be obtained from solving a cut-generating nonlinear program. Using this procedure, we are able to approximately optimize over the rank one lift-and-project closure for a variety of convex MINLP instances. The results indicate that lift-and-project cuts have the potential to close a significant portion of the integrality gap for convex MINLPs. In addition, we find that using this procedure within a branch-and-cut solver for convex MINLPs significantly reduces the total solution time for many instances. We also demonstrate that combining lift-and-project cuts with an extended formulation that exploits separability of convex functions yields significant improvements in both relaxation bounds and the time to calculate the relaxation. Overall, these results suggest that with an effective separation routine, like the one proposed here, lift-and-project cuts may be as effective for solving convex MINLPs as they have been for solving mixed-integer linear programs.
Similar content being viewed by others
References
Abhishek, K., Leyffer, S., Linderoth, J.T.: FilMINT: an outer-approximation-based solver for nonlinear mixed integer programs. INFORMS J. Comput. 22, 555–567 (2010)
Atamtürk, A., Narayanan, V.: Conic mixed integer rounding cuts. Math. Program. 122, 1–20 (2010)
Balas, E.: Disjunctive programming. Ann. Discret. Math. 5, 3–51 (1979)
Balas, E.: A modified lift-and-project procedure. Math. Program. 79, 19–31 (1997)
Balas, E., Ceria, S., Cornuejols, G.: Mixed 0–1 programming by lift-and-project in a branch-and-cut framework. Manag. Sci. 42, 1229–1246 (1996)
Balas, E., Jeroslow, R.G.: Strengthening cuts for mixed integer programs. Eur. J. Oper. Res. 4, 224–234 (1980)
Balas, E., Perregaard, M.: A precise correspondence between lift-and-project cuts, simple disjunctive cuts. Math. Program. Ser. B 94, 221–245 (2003)
Balas, E., Saxena, A.: Optimizing over the split closure. Math. Program. 113, 219–240 (2008)
Bertsekas, D., Gallager, R.: Data Networks, 2nd edn. Prentice-Hall Inc, Upper Saddle River (1992)
Bodur, M., Dash, S., Günlük, O.: Cutting planes from extended LP formulations. Math. Program. (2016). doi:10.1007/s10107-016-1005-7
Bodur, M., Dash, S., Günlük, O., Luedtke, J.: Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse. http://www.optimization-online.org/DB_HTML/2014/03/4263.html (2014)
Bonami, P.: Lift-and-project cuts for mixed integer convex programs. In: Günlük, O., Woeginger, G. (eds.) Integer Programming and Combinatoral Optimization, Lecture Notes in Computer Science, vol. 6655, pp. 52–64. Springer, Berlin (2011). doi:10.1007/978-3-642-20807-2_5
Bonami, P.: On optimizing over lift-and-project closures. Math. Program. Comput. 4, 151–179 (2012)
Bonami, P., Minoux, M.: Using rank-1 lift-and-project closures to generate cuts for 0–1 MIPs, a computational investigation. Discret. Optim. 2, 288–307 (2005)
Bonami, P., Tramontani, A.: Advances in CPLEX for mixed integer nonlinear optimization. International Symposium on Mathematical Programming. Pittsburgh. PA, USA (2015)
Boorstyn, R., Frank, H.: Large-scale network topological optimization. IEEE Trans. Commun. 25, 29–47 (1977)
Borchers, B., Mitchell, J.E.: An improved branch and bound algorithm for mixed integer nonlinear programs. Comput. Oper. Res. 21, 359–368 (1994)
Bussieck, M.R., Drud, A.S., Meeraus, A.: MINLPLib—a collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15(1), 114–119 (2003)
Castillo, I., Westerlund, J., Emet, S., Westerlund, T.: Optimization of block layout design problems with unequal areas: a comparison of MILP and MINLP optimization methods. Comput. Chem. Eng. 30, 54–69 (2005)
Ceria, S., Soares, J.: Convex programming for disjunctive optimization. Math. Program. 86, 595–614 (1999)
Cezik, M.T., Iyengar, G.: Cuts for mixed 0–1 conic programming. Math. Program. 104, 179–202 (2005)
Conforti, M., Cornuéjols, G., Zambelli, G.: Polyhedral approaches to mixed integer linear programming. In: Jünger, M., Liebling, T., Naddef, D., Pulleyblank, W., Reinelt, G., Rinaldi, G., Wolsey, L. (eds.) 50 Years of Integer Programming 1958–2008, pp. 343–385. Springer, New York (2009)
Cornuéjols, G.: Valid inequalities for mixed integer linear programs. Math. Program. Ser. B 112, 3–44 (2008)
Dash, S., Günlük, O., Lodi, A.: MIR closures of polyhedral sets. Math. Program. 121, 33–60 (2010)
Dash, S., Günlük, O., Vielma, J.: Computational experiments with cross and crooked cross cuts. INFORMS J. Comput. 26, 780–797 (2014)
Dolan, E., Moré, J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201–213 (2002)
Drewes, S.: Mixed Integer Second Order Cone Programming. Ph.D. thesis, Technische Universität Darmstadt (2009)
Duran, M.A., Grossmann, I.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36, 307–339 (1986)
Elhedhli, S.: Service system design with immobile servers, stochastic demand, and congestion. Manuf. Serv. Oper. Manag. 8, 92–97 (2006)
Fischetti, M., Lodi, A.: Optimizing over the first Chvátal closure. Math. Program. Ser. B 110, 3–20 (2007)
Fischetti, M., Lodi, A., Tramontani, A.: On the separation of disjunctive cuts. Math. Program. 128, 205–230 (2011)
Fletcher, R., Leyffer, S.: User Manual for FilterSQP. University of Dundee Numerical Analysis Report NA-181 (1998)
Frangioni, A., Gentile, C.: Perspective cuts for a class of convex 0–1 mixed integer programs. Math. Program. 106, 225–236 (2006)
Gomory, R.E.: An Algorithm for the Mixed Integer Problem. Technical Report RM-2597, The RAND Corporation (1960)
Günlük, O., Lee, J., Weismantel, R.: MINLP strengthening for separable convex quadratic transportation-cost UFL. Technical Report RC24213 (W0703-042), IBM Research Division (2007)
Günlük, O., Linderoth, J.: Perspective relaxation of mixed integer nonlinear programs with indicator variables. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO, Lecture Notes in Computer Science, vol. 5035, pp. 1–16. Springer, New York (2008)
Harjunkoski, I., Westerlund, T., Porn, R., Skrifvars, H.: Different transformations for solving non-convex trim loss problems by MINLP. Eur. J. Oper. Res. 105, 594–603 (1998)
Hijazi, H., Bonami, P., Ouorou, A.: An outer-inner approximation for separable mixed-integer nonlinear programs. INFORMS J. Comput. 26, 31–44 (2014)
Hiriart-Urruty, J.B., Lemarechal, C.: Convex Analysis and Minimization Algorithms I: Fundamentals (Grundlehren Der Mathematischen Wissenschaften). Springer, New York (1993)
IBM: Using the CPLEX Callable Library, Version 12 (2009)
Kelley, J.: The cutting-plane method for solving convex programs. J. SIAM 8, 703–712 (1960)
Kılınç, M., Linderoth, J., Luedtke, J.: Effective Separation of Disjunctive Cuts for Convex Mixed Integer Nonlinear Programs. Technical Report 1681, Computer Sciences Department, University of Wisconsin-Madison (2010)
Kılınç, M.R.: Disjunctive Cutting Planes and Algorithms for Convex Mixed Integer Nonlinear Programming. Ph.D. thesis, University of Wisconsin-Madison (2011)
Leyffer, S.: MacMINLP: Test Problems for Mixed Integer Nonlinear Programming. http://www-unix.mcs.anl.gov/~leyffer/macminlp (2003)
Modaresi, S., Kılınç, M., Vielma, J.P.: Intersection cuts for nonlinear integer programming: convexification techniques for structured sets. Math. Program. 155, 575–611 (2016)
Modaresi, S., Kılınç, M.R., Vielma, J.P.: Split cuts and extended formulations for mixed integer conic quadratic programming. Oper. Res. Lett. 43(1), 10–15 (2015)
Nemhauser, G., Wolsey, L.: A recursive procedure for generating all cuts for 0–1 mixed integer programs. Math. Program. 46, 379–390 (1990)
Nemhauser, G.L., Savelsbergh, M.W.P., Sigismondi, G.C.: MINTO, a mixed INTeger optimizer. Oper. Res. Lett. 15, 47–58 (1994)
Quesada, I., Grossmann, I.E.: An LP/NLP based branch-and-bound algorithm for convex MINLP optimization problems. Comput. Chem. Eng. 16, 937–947 (1992)
Ravemark, D.E., Rippin, D.W.T.: Optimal design of a multi-product batch plant. Comput. Chem. Eng. 22(1–2), 177–183 (1998)
Sawaya, N.: Reformulations, Relaxations and Cutting Planes for Generalized Disjunctive Programming. Ph.D. thesis, Chemical Engineering Department, Carnegie Mellon University (2006)
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. http://egon.cheme.cmu.edu/ibm/page.htm. Accessed 19 April 2016
Stubbs, R., Mehrotra, S.: A branch-and-cut method for 0–1 mixed convex programming. Math. Program. 86, 515–532 (1999)
Tawarmalani, M., Sahinidis, N.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103(2), 225–249 (2005)
Türkay, M., Grossmann, I.E.: Logic-based MINLP algorithms for the optimal synthesis of process networks. Comput. Chem. Eng. 20(8), 959–978 (1996)
Vecchietti, A., Grossmann, I.E.: LOGMIP: a disjunctive 0–1 non-linear optimizer for process system models. Comput. Chem. Eng. 23(4–5), 555–565 (1999). doi:10.1016/S0098-1354(98)00293-2. http://www.sciencedirect.com/science/article/B6TFT-3XY28Y0-B/2/2709e69a55450cf2263efcc5368850db
Vielma, J., Dunning, I., Huchette, J., Lubin, M.: Extended Formulations in Mixed Integer Conic Quadratic Programming. Technical Report. http://arxiv.org/abs/1505.07857 (2015)
Zhu, Y., Kuno, T.: A disjunctive cutting-plane-based branch-and-cut algorithm for 0–1 mixed-integer convex nonlinear programs. Ind. Eng. Chem. Res. 45(1), 187–196 (2006). doi:10.1021/ie0402719
Acknowledgements
This work was supported in part by the U.S. National Science Foundation (CCF-0830153) and by the U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research, Applied Mathematics program under contract numbers DE-AC02-06CH11357 and DE-FG02-08ER25861. The authors would like to thank Andrew Miller for his insightful comments on this work.
Author information
Authors and Affiliations
Corresponding author
Electronic supplementary material
Below is the link to the electronic supplementary material.
Appendix
Appendix
Table 6 presents the gaps closed when using monoidal strenghthening to obtain strengthened lift-and-project cuts in the closure experiment presented in Sect. 6.3. The structure of this table is identical to that of Table 3. Table 3 in the Electronic Supplementary Material provides the results for each individual instance.
Rights and permissions
About this article
Cite this article
Kılınç, M.R., Linderoth, J. & Luedtke, J. Lift-and-project cuts for convex mixed integer nonlinear programs. Math. Prog. Comp. 9, 499–526 (2017). https://doi.org/10.1007/s12532-017-0118-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12532-017-0118-1