Branching and bounds tighteningtechniques for non-convex MINLP

Optimization Methods and Software

Volumn 24, Issue 4-5, 2009, Pages 597-634

  Belotti, Pietro ^a   Lee, Jon ^b   Liberti, Leo ^c   Margot, François ^d   Wächter, Andreas ^b  

^a Lehigh University   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c ÉCOLE POLYTECHNIQUE   (France)

^d CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Bounds tightening; Branching rules; Couenne; Mixed integer non linear programming

Indexed keywords

GLOBAL OPTIMIZATION; OPEN SOURCE SOFTWARE; OPEN SYSTEMS; SOFTWARE TESTING;

BRANCHING RULES; COUENNE; INDUSTRIAL PROBLEM; MIXED-INTEGER NONLINEAR PROGRAMMING; NON-LINEAR ESTIMATION; OPEN SOURCES; REAL-WORLD; STATE OF THE ART;

INTEGER PROGRAMMING;

EID: 68949107324     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780903087124     Document Type: Article

References (92)

1. K. Abhishek, S. Leyffer, and J.T. Linderoth, Filmint: an outer-approximation-based solver for nonlinear mixed integer programs, preprint (2006), ANL/MCS-P1374-0906.
2. T. Achterberg, T. Koch, and A. Martin, Branching rules revisited, OR Lett. 33(1) (2005), pp. 42-54.
3. C.S. Adjiman and C.A. Floudas, Rigorous convex underestimators for general twice-differentiable problems, J. Glob. Optim. 9(1) (1996), pp. 23-40.
4. C.S. Adjiman, I.P. Androulakis, and C.A. Floudas, Global optimization of MINLP problems in process synthesis and design, Comput. Chem. Eng. 21 (1997), pp. S445-S450.
5. C.S. Adjiman, I.P. Androulakis, and C.A. Floudas, A global optimization method, αBB, for general twicedifferentiable constrained NLPs: II. Implementation and computational results, Comput. Chem. Eng. 22(9) (1998), pp. 1159-1179.
6. C.S. Adjiman, C.A. Schweiger, and C.A. Floudas, Mixed-integer nonlinear optimization in process synthesis, in Handbook of Combinatorial Optimization, D.-Z. Du and P.M. Pardalos, eds, Vol. 1, Kluwer Academic Publishers, Dordrecht, 1998, pp. 1-76.
7. C.S. Adjiman, I.P. Androulakis, C.D. Maranas, and C.A. Floudas, A global optimization method, αBB, for process design, Comput. Chem. Eng. 20 (1996), pp. S419-S424.
8. C.S. Adjiman, S. Dallwig, C.A. Floudas, and A. Neumaier, A global optimization method, αBB, for general twicedifferentiable constrained NLPs: I. Theoretical advances, Comput. Chem. Eng. 22(9) (1998), pp. 1137-1158.
9. I.P. Androulakis, C.D. Maranas, and C.A. Floudas, αBB: A global optimization method for general constrained nonconvex problems, J. Glob. Optim. 7(4) (1995), pp. 337-363.
10. D.L. Applegate, R.E. Bixby, V. Chvátal, and W.J. Cook, The Traveling Salesman Problem, A Computational Study, Princeton University Press, Princeton, NJ, 2006.
11. M. Barton and A. Selot, A production allocation framework for natural gas production systems, in 17th European Symposium on Computer Aided Process Engineering-ESCAPE17, V. Plesu and P.S. Agachi, eds, 2007.
12. E.M.L. Beale and J.J.H. Forrest, Global optimization using special ordered sets, Math. Program. 10(1) (1976), pp. 52-69.
13. P. Belotti, COUENNE, an open-source solver for mixed-integer non-convex problems, in preparation.
14. M. Benichou, J.M. Gauthier, P. Girodet, G. Hentges, G. Ribiere, and O. Vincent, Experiments in mixed-integer programming, Math. Program. 1 (1971), pp. 76-94.
15. L.T. Biegler, I.E. Grossmann, and A.W.Westerberg, Systematic Methods of Chemical Process Design, Prentice Hall, Upper Saddle River, NJ, 1997.
16. P. Bonami, L. Biegler, A. Conn, G. Cornuéjols, I. Grossmann, C. Laird, J. Lee, A. Lodi, F. Margot, N. Sawaya, and A.Wächter, An algorithmic framework for convex mixed integer nonlinear programs, Discrete Optim. 5 (2008), pp. 186-204.
17. P. Bonami, G. Cornuéjols, A. Lodi, and F. Margot, A feasibility pump for mixed integer nonlinear programs, Math. Program. 119(2) (2009), pp. 331-352.
18. M.R. Bussieck, A.S. Drud, and A. Meeraus, MINLPLib-a collection of test models for mixed-integer nonlinear programming, INFORMS J. Comput. 15(1) (2003), pp. 114-119. Available at http://www.gamsworld.org/minlp/minlplib/ minlpstat.htm.
19. E. Carrizosa, P. Hansen, and F. Messine, Improving interval analysis bounds by translations, J. Glob. Optim. 29(2) (2004), pp. 157-172.
20. COIN-OR project. 2000. Available at http://www.coin-or.org.
21. G. Cornuéjols and R. Tütüncü, Optimization Methods in Finance, Cambridge University Press, Cambridge, 2006.
22. E.D. Dolan and J.J. Moré, Benchmarking optimization software with performance profiles, Math. Program. 91(2) (2002), pp. 201-213.
23. E.D. Dolan, J.J. Moré, and T.S. Munson, Benchmarking optimization software with COPS 3.0, Tech. Rep. ANL/MCS-273, Mathematics and Computer Science Division, Argonne National Laboratory, 2004. Available at http://www.mcs.anl.gov/̃more/cops/cgilog.cgi?+/cops/cops3.pdf.
24. T.G.W. Epperly and E.N. Pistikopoulos, A reduced space branch and bound algorithm for global optimization, J. Glob. Optim. 11 (1997), pp. 287-311.
25. J.E. Falk and R.M. Soland, An algorithm for separable nonconvex programming problems, Manage. Sci. 15 (1969), pp. 550-569.
26. R. Fletcher and S. Leyffer, Solving mixed integer nonlinear programs by outer approximation, Math. Program. 66 (1994), pp. 327-349.
27. R. Fletcher and S. Leyffer, Numerical experience with lower bounds for MIQP branch-and-bound, SIAM J. Optim. 8(2) (1998), pp. 604-616.
28. A. Flores-Tlacuahuac and L.T. Biegler, A robust and efficient mixed-integer non-linear dynamic optimization approach for simultaneous design and control, Comput. Chem. Eng. 31 (2007), pp. 588-600.
29. C.A. Floudas, Global optimization in design and control of chemical process systems, J. Process Control 10 (2001), pp. 125-134.
30. L.R. Foulds, D. Haugland, and K. Jörnsten, A bilinear approach to the pooling problem, Optimization 24 (1992), pp. 165-180.
31. A. Fügenschuh and L. Schewe, Solving a nonlinear mixed-integer sheet metal design problem with linear approximations, Working paper.
32. GAMS Development Corp. 2001. SBB-Available at http://www.gams.com/dd/docs/solvers/sbb.pdf.
33. GamsWorld Global Optimization library. 2001. Available at http://www.gamsworld.org/global/globallib/globalstat.htm.
34. I. Grossmann, Review of nonlinear mixed-integer and disjunctive programming techniques, Optim. Eng. 3(3) (2002), pp. 227-252.
35. E. Hansen, Global Optimization Using Interval Analysis, Marcel Dekker, Inc., NewYork, 1992.
36. J. Hooker, Logic-based Methods for Optimization: Combining Optimization and Constraint Satisfaction, Wiley, NewYork, 2000.
37. R. Horst, A general-class of branch-and-bound methods in global optimization with some new approaches for concave minimization, J. Optim. Theory Appl. 51(2) (1986), pp. 271-291.
38. R. Horst and H. Tuy, Global Optimization: Deterministic Approaches, Springer Verlag, Berlin, 1996.
39. M. Jünger and D. Naddef (eds), Computational Combinatorial Optimization, in volume 2241 of Lecture Notes in Computer Science, Springer, Berlin/Heidelberg, 2001.
40. B. Kalantari and J.B. Rosen, An algorithm for global minimization of linearly constrained concave quadratic functions, Math. Oper. Res. 12(3) (1987), pp. 544-561.
41. J. Kallrath, Solving planning and design problems in the process industry using mixed integer and global optimization, Ann. Oper. Res. 140(1) (2005), pp. 339-373.
42. P. Kesavan and P.I. Barton, Generalized branch-and-cut framework for mixed-integer nonlinear optimization problems, Comput. Chem. Eng. 24 (2000), pp. 1361-1366.
43. S. Leyffer, MacMINLP: AMPL collection of MINLPs. 2000. Available at http://wwwunix.mcs.anl.gov/̃leyffer/MacMINLP.
44. S. Leyffer, User manual for MINLP-BB, Tech. Rep. University of Dundee, UK, 1999.
45. L. Liberti, Writing global optimization software, in Global Optimization: From Theory to Implementation, L. Liberti and N. Maculan, eds, Springer, Berlin, 2006, pp. 211-262.
46. L. Liberti, Reformulation techniques in mathematical programming, Thèse d'Habilitation à Diriger des Recherches.
47. L. Liberti, Reformulations in mathematical programming: definitions, in Proceedings of the 7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, R. Aringhieri, R. Cordone, and G. Righini, eds, Università degli Studi di Milano, Crema, 2008.
48. L. Liberti, Reformulations in mathematical programming: definitions and systematics, RAIRO-RO 43(1) (2009), pp. 55-86.
49. L. Liberti, S. Cafieri, and F. Tarissan, Reformulations in mathematical programming: a computational approach, in Foundations of Computational Intelligence, Vol. 3(203), in Studies in Computational Intelligence, A. Abraham, A.-E. Hassanien, P. Siarry, and A. Engelbrecht, eds, Springer, Berlin, 2009, pp. 153-234.
50. L. Liberti, C. Lavor, and N. Maculan, A branch-and-prune algorithm for the molecular distance geometry problem, Int. Trans. Oper. Res. 15 (2008), pp. 1-17.
51. L. Liberti, C. Lavor, M.A. Chaer Nascimento, and N. Maculan, Reformulation in mathematical programming: an application to quantum chemistry, Discrete Appl. Math. 157(6) (2009), pp. 1309-1318.
52. Y. Lin and L. Schrage, The global solver in the LINDO API, Optim. Methods Softw. 24 (2009), pp. 657-668.
53. M.L. Liu, N.V. Sahinidis, and J.P. Shectman, Planning of chemical process networks via global concave minimization, in Global Optimization in Engineering Design, I. Grossmann, ed., Springer, Boston, 1996, pp. 195-230.
54. G.P. McCormick, Converting general nonlinear programming problems to separable nonlinear programming problems, Tech. Paper T-267, Program in Logistics, The GeorgeWashington University, Washington DC, 1972.
55. G.P. McCormick, Computability of global solutions to factorable nonconvex programs: part I-convex underestimating problems, Math. Programm. 10 (1976), pp. 146-175.
56. F. Messine, Deterministic global optimization using interval constraint propagation techniques, RAIRO-RO 38(4) (2004), pp. 277-294.
57. H. Mittelmann, A collection of mixed integer quadratically constrained quadratic programs. 2005. Available at http://plato.asu.edu/ftp/ampl-files/ miqp-ampl.
58. H. Mittelmann, A collection of quadratically constrained quadratic programs. 2005. Available at http://plato.asu.edu/ftp/ampl-files/qp-ampl.
59. R.E. Moore, Methods and Applications of Interval Analysis, Siam, Philadelphia, 1979.
60. A.S. Moura, J. MacGregor Smith, and R.H.C. Takahashi, An ellipsoidal branch-and-cut method for solving mixedinteger quasi-convex problems, Poster presented at MIP 2007, CRM, Université de Montreal, Montreal, Canada, 2007.
61. G.L. Nemhauser and L.A.Wolsey, Integer and Combinatorial Optimization, JohnWiley & Sons, NewYork, 1988.
62. I. Nowak, H.Alperin, and S.Vigerske, LaGO-an object oriented library for solving MINLPs, in Global Optimization and Constraint Satisfaction, number 2861 in Lecture Notes in Computer Science, Springer, Berlin/Heidelberg, 2003, pp. 32-42.
63. A.R.F. O'Grady, I.D.L. Bogle, and E.S. Fraga, Interval analysis in automated design for bounded solutions, Chemicke Zvesti 55(6) (2001), pp. 376-381.
64. Open Source Initiative OSI, Common public license version 1.0. 2006. Available at http://www.opensource.org/licenses/cpl1.0.php.
65. M.W. Padberg and G. Rinaldi, A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems, SIAM Rev. 33(1) (1991), pp. 60-100.
66. A.T. Phillips and J.B. Rosen, A quadratic assignment formulation of the molecular conformation problem, Tech. Rep. CSD, University of Minnesota, 1998.
67. I. Quesada and I.E. Grossmann, Global optimization of bilinear process networks and multicomponent flows, Comput. Chem. Eng. 19(12) (1995), pp. 1219-1242.
68. H. Ratschek and J. Rokne, Interval methods, in Handbook of Global Optimization, R. Horst and P.M. Pardalos, eds, Vol. 1, Kluwer Academic Publishers, Dordrecht, 1995, pp. 751-828.
69. H.S. Ryoo and N.V. Sahinidis, Global optimization of nonconvex NLPs and MINLPs with applications in process design, Comput. Chem. Eng. 19(5) (1995), pp. 551-566.
70. H.S. Ryoo and N.V. Sahinidis, A branch-and-reduce approach to global optimization, J. Glob. Optim. 8(2) (1996), pp. 107-138.
71. H.S. Ryoo and N.V. Sahinidis, Global optimization of multiplicative programs, J. Glob. Optim. 26 (2003), pp. 387-418.
72. N.V. Sahinidis, Baron: a general purpose global optimization software package, J. Glob. Optim. 8 (1996), pp. 201-205.
73. N.V. Sahinidis, Global optimization and constraint satisfaction: the branch-and-reduce approach, in Global Optimization and Constraint Satisfaction, C. Bliek, C. Jermann, and A. Neumaier, eds, Vol. 2861 of LNCS, Springer, Heidelberg, 2003, pp. 1-16.
74. N.V. Sahinidis, I.E. Grossmann, R.E. Fornari, and M. Chathrathi, Optimization model for long range planning in the chemical industry, 13 (1989), pp. 1049-1063.
75. M.W.P. Savelsbergh, Preprocessing and probing techniques for mixed integer programming problems, ORSA J. Comput. 6(4) (1994), pp. 445-454.
76. J.P. Shectman and N.V. Sahinidis, A finite algorithm for global minimization of separable concave programs, J. Glob. Optim. 12 (1998), pp. 1-36.
77. E.M.B. Smith, On the optimal design of continuous processes, Ph.D. thesis, Imperial College of Science, Technology and Medicine, University of London, 1996.
78. E.M.B. Smith and C.C. Pantelides, Global optimisation of nonconvex MINLPs, Comput. Chem. Eng. 21 (1997), pp. S791-S796.
79. E.M.B. Smith and C.C. Pantelides, A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs, Comput. Chem. Eng. 23 (1999), pp. 457-478.
80. M. Tawarmalani and N.V. Sahinidis, Convexification and global optimization in continuous and mixed-integer nonlinear programming: theory, algorithms, software and applications, Vol. 65 of Nonconvex Optimization and Its Applications, Kluwer Academic Publishers, Dordrecht, 2002.
81. M. Tawarmalani and N.V. Sahinidis, Exact algorithms for global optimization of mixed-integer nonlinear programs, in Handbook of Global Optimization, P.M. Pardalos and H.E. Romeijn, eds, Vol. 2, Kluwer Academic Publishers, Dordrecht, 2002, pp. 65-86.
82. M. Tawarmalani and N.V. Sahinidis, Global optimization of mixed-integer nonlinear programs: a theoretical and computational study, Math. Program. 99(3) (2004), pp. 563-591.
83. M. Tawarmalani and N.V. Sahinidis, A polyhedral branch-and-cut approach to global optimization, Math. Program. B 103 (2005), pp. 225-249.
84. R. Vaidyanathan and M. El-Halwagi, Global optimization of nonconvex MINLPs by interval analysis, in Global Optimization in Engineering Design, I.E. Grossmann, ed., Kluwer Academic Publishers, Dordrecht, 1996, pp. 175-193.
85. D. Vandenbussche and G.L. Nemhauser, A branch-and-cut algorithm for nonconvex quadratic programs with box constraints, Math. Program. 102(3) (2005), pp. 559-575.
86. P.Van Hentenryck, L. Michel, and Y. Deville, Numerica, a Modeling Language for Global Optimization, MIT Press, Cambridge, MA, 1997.
87. J.P. Vielma, S. Ahmed, and G.L. Nemhauser, A lifted linear programming branch-and-bound algorithm for mixed integer conic quadratic programs, INFORMS J. Comput. 20 (2008), pp. 438-450.
88. A.Wächter and L.T. Biegler, On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming, Math. Program. 106(1) (2006), pp. 25-57.
89. Web page for the IBM/CMU MINLP project. 2004. Available at http://egon.cheme.cmu.edu/ibm/page.htm.
90. L.A.Wolsey, Integer Programming, Wiley, NewYork, 1998.
91. J.M. Zamora and I.E. Grossmann, A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms, J. Glob. Optim. 14 (1999), pp. 217-249.
92. J. Žilinskas and I.D.L. Bogle, Evaluation ranges of functions using balanced random interval arithmetic, Informatica 14(3) (2003), pp. 403-416.