Mixed integer nonlinear programming tools: A practical overview

4OR

Volumn 9, Issue 4, 2011, Pages 329-349

  D'Ambrosio, Claudia ^a   Lodi, Andrea ^b  

^a ÉCOLE POLYTECHNIQUE   (France)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Algorithms; Mixed integer nonlinear programming; Software

Indexed keywords

EID: 82555196696     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-011-0181-9     Document Type: Review

References (58)

1. Abhishek K (2008) Topics in mixed integer nonlinear programming. PhD thesis, Lehigh University.
2. Abhishek K, Leyffer S, Linderoth JT (2010) FilMINT: an outer-approximation-based solver for nonlinear mixed integer programs. INFORMS J Comput 22: 555-567.
3. Achterberg T (2007) Constraint integer programming. PhD thesis, Technische Universität Berlin.
4. Adjiman CS, Androulakis IP, Floudas CA (1997) Global optimization of MINLP problems in process synthesis and design. Comput Chem Eng 21: 445-450.
5. Adjiman CS, Androulakis IP, Floudas CA (2000) Global optimization of mixed-integer nonlinear problems. AIChE J 46: 1769-1797.
6. Androulakis IP, Maranas CD, Floudas CA (1995) αBB: a global optimization method for general constrained nonconvex problems. J Glob Optim 7: 337-363.
7. Beale EML, Tomlin JA (1970) Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables. In: Lawrence J (eds) OR 69. Proceedings of the fifth international conference on operational research. Tavistock Publications, pp. 447-454.
8. Belotti P, Lee J, Liberti L, Margot F, Wächter A (2009) Branching and bounds tightening techniques for non-convex MINLP. Optim Methods Softw 24: 597-634.
9. Benders J (1962) Partitioning procedures for solving mixed-variables programming problems. Numer Math 4: 267-299.
10. Bonami P, Gonçalves JPM (2008) Primal heuristics for mixed integer nonlinear programs. Technical report, IBM Research Report RC24639.
11. Bonami P, Forrest J, Lee J, Wächter A (2007) Rapid development of an MINLP solver with COIN-OR. Optima 75: 1-5.
12. Bonami P, Biegler LT, Conn AR, Cornuéjols G, Grossmann IE, Laird CD, Lee J, Lodi A, Margot F, Sawaya N, Wächter A (2008) An algorithmic framework for convex mixed integer nonlinear programs. Discret Optim 5: 186-204.
13. Bonami P, Cornuéjols G, Lodi A, Margot F (2009) A feasibility pump for mixed integer nonlinear programs. Math Program 119: 331-352.
14. Bongartz I, Conn AR, Gould N, Toint PL (1995) CUTE: constrained and unconstrained testing environment. ACM Trans Math Softw 21: 123-160.
15. Brooke A, Kendrick D, Meeraus A (1992) GAMS: a user's guide.
16. Bussieck MR, Drud A (2001) SBB: a new solver for mixed integer nonlinear programming. In: Recent advances in nonlinear mixed integer optimization, INFORMS Fall, Invited talk.
17. Bussieck MR, Vigerske S (2011) MINLP solver software. In: Cochran JJ (eds) Wiley encyclopedia of operations research and management science. Wiley, New York.
18. Conn AR, Scheinberg K, Vicente LN (2008) Introduction to derivative free optimization. MPS/SIAM book series on optimization. SIAM, Philadelphia.
19. Dakin RJ (1965) A tree-search algorithm for mixed integer programming problems. Comp J 8(3): 250-255.
20. D'Ambrosio C (2010) Application-oriented mixed integer non-linear programming. 4OR Q J Oper Res 8: 319-322.
21. D'Ambrosio C, Frangioni A, Liberti L, Lodi A (2010) A storm of feasibility pumps for nonconvex MINLP. Technical Report OR/10/13, Università di Bologna. To appear in mathematical programming.
22. Duran M, Grossmann IE (1986) An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math Program 36: 307-339.
23. Fourer R, Gay DM, Kernighan BW (2003) AMPL: a modeling language for mathematical programming. 2nd edn. Duxbury Press, Pacific Grove.
24. Geoffrion AM (1972) Generalized Benders decomposition. J Optim Theory Appl 10: 237-260.
25. Grossmann IE (2002) Review of nonlinear mixed-integer and disjunctive programming techniques. Optim Eng 3: 227-252.
26. Gupta OK, Ravindran V (1985) Branch and bound experiments in convex nonlinear integer programming. Manag Sci 31: 1533-1546.
27. Jeroslow R (1973) There cannot be any algorithm for integer programming with quadratic constraints. Oper Res 21: 221-224.
28. Kelley JE Jr (1960) The cutting-plane method for solving convex programs. J SIAM 8: 703-712.
29. Kesavan P, Barto PI (2000) Generalized branch-and-cut framework for mixed-integer nonlinear optimization problems. Comput Chem Eng 24: 1361-1366.
30. Kocis GR, Grossmann IE (1989) Computational experience with DICOPT solving MINLP problems in process systems engineering. Comput Chem Eng 13: 307-315.
31. Land AH, Doig AG (1960) An automatic method of solving discrete programming problems. Econometrica 28(3): 497-520.
32. Leyffer S (1999) User manual for MINLP_BB. Technical report. University of Dundee.
33. Leyffer S (2001) Integrating SQP and branch-and-bound for mixed integer nonlinear programming. Comput Optim Appl 18: 295-309.
34. Leyffer S, Mahajan A (2011) Software for nonlinearly constrained optimization. Wiley, New York.
35. Liberti L (2004a) Reformulation and convex relaxation techniques for global optimization. PhD thesis, Imperial College London, UK.
36. Liberti L (2004b) Reformulation and convex relaxation techniques for global optimization. 4OR Q J Oper Res 2: 255-258.
37. Liberti L (2006) Writing global optimization software. In: Liberti L, Maculan N (eds) Global optimization: from theory to implementation. Springer, Berlin, pp 211-262.
38. Liberti L, Cafieri S, Tarissan F (2009a) Reformulations in mathematical programming: a computational approach. In: Abraham A, Hassanien AE, Siarry P (eds) Foundations on computational intelligence, studies in computational intelligence, vol 203. Springer, New York, pp 153-234.
39. Liberti L, Nannicini G, Mladenovic N (2009b) A good recipe for solving MINLPs. In: Maniezzo V, Stützle T, Voss S (eds) Matheuristics: hybridizing metaheuristics and mathematical programming, volume 10 of annals of information systems. Springer, Berlin, pp 231-244.
40. Linderoth JT, Lodi A (2011) MILP software. In: Cochran JJ (eds) Wiley encyclopedia of operations research and management science, vol 5. Wiley, New York, pp 3239-3248.
41. Lodi A (2009) Mixed integer programming computation. In: Jünger M, Liebling TM, Naddef D, Nemhauser GL, Pulleyblank WR, Reinelt G, Rinaldi G, Wolsey LA (eds) 50 years of integer programming 1958-2008: from the early years to the state-of-the-art. Springer, Berlin, pp 619-645.
42. Mangasarian OL (1965) Pseudo-convex functions. J Soc Ind Appl Math 3: 281-290.
43. McCormick GP (1976) Computability of global solutions to factorable nonconvex programs: Part I-convex underestimating problems. Math Program 10: 147-175.
44. Nannicini G, Belotti P (2011) Rounding based heuristics for nonconvex MINLPs. Technical report, Tepper School of Business. Carnegie Mellon University.
45. Nemhauser GL, Savelsbergh MWP, Sigismondi GS (1994) MINTO, a mixed INTeger optimizer. Oper Res Lett 15: 47-585.
46. Nocedal J, Wright SJ (2006) Numerical optimization. Springer Series in operations research.
47. Nowak I (2005) Relaxation and decomposition methods for mixed integer nonlinear programming, International series of numerical mathematics. Birkhäuser Verlag, Basel.
48. Nowak I, Vigerske S (2008) LaGO-a (heuristic) branch and cut algorithm for nonconvex MINLPs. Central Eur J Oper Res 16: 127-138.
49. Quesada I, Grossmann IE (1992) An LP/NLP based branch and bound algorithm for convex MINLP optimization problems. Comput Chem Eng 16: 937-947.
50. Ryoo H, Sahinidis NV (1996) A branch-and-reduce approach to global optimization. J Glob Optim 8: 107-138.
51. Sahinidis NV (1996) BARON: a general purpose global optimization software package. J Glob Optim 8: 201-205.
52. Schweiger CA, Floudas CA (1998a) MINOPT: a modeling language and algorithmic framework for linear, mixed-integer, nonlinear, dynamic, and mixed-integer nonlinear optimization. Princeton University, Princeton.
53. Schweiger CA, Floudas CA (1998b) MINOPT: a software package for mixed-integer nonlinear optimization, 3rd edn.
54. Smith EMB, Pantelides CC (1999) A symbolic reformulation/spatial branch and bound algorithm for the global optimization of nonconvex MINLPs. Comput Chem Eng 23: 457-478.
55. Tawarmalani M, Sahinidis NV (2004) Global optimization of mixed-integer nonlinear programs: A theoretical and computational study. Math Program 99: 563-591.
56. Westerlund T, Pettersson F (1995) A cutting plane method for solving convex MINLP problems. Comput Chem Eng 19: S131-S136.
57. Westerlund T, Pörn R (2002) Solving pseudo-convex mixed integer problems by cutting plane techniques. Optim Eng 3: 253-280.
58. Westerlund T, Skrifvars H, Harjunkoski I, Pörn R (1998) An extended cutting plane method for solving a class of non-convex MINLP problems. Comput Chem Eng 22: 357-365.