FilMINT: An outer approximation-based solver for convex mixed-integer nonlinear programs

INFORMS Journal on Computing

Volumn 22, Issue 4, 2010, Pages 555-567

  Abhishek, Kumar ^a   Leyffer, Sven ^b   Linderoth, Jeff ^c  

^a Enterprise Optimization   (United States)

^b ARGONNE NATIONAL LABORATORY   (United States)

^c UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

LP NLP based branch and bound; Mixed integer nonlinear programming; Outer approximation

Indexed keywords

EID: 78649356183     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1090.0373     Document Type: Article

References (36)

1. Achterberg, T. 2007. Conflict analysis in mixed-integer programming. Discrete Optim. 4(1) 4-20.
2. Atamturk, A., M. W. P. Savelsbergh. 2005. Integer-programming software systems. Ann. Oper. Res. 140(1) 67-124.
3. Belotti, P., P. Bonami, L. T. Biegler, A. R. Conn, G. Cornuejols, I. E. Grossmann, C. D. Laird et al. 2006. CMU-IBM open source MINLP project. Retrieved August 2006, http://egon.cheme. cmu.edu/ibm/page.htm.
4. Bonami, P., J. Goncalves. 2008. Primal heuristics for mixed-integer nonlinear programs. Technical Report RC24639 (W0809-056), IBM Research Division, Yorktown Heights, NY.
5. Bonami, P., G. Cornuejols, A. Lodi, F. Margot. 2008a. A feasibility pump for mixed-integer nonlinear programs. Math. Programming 119(2) 331-352.
6. Bonami, P., L. T. Biegler, A. R. Conn, G. Cornuejols, I. E. Grossmann, C. D. Laird, J. Lee et al. 2008b. An algorithmic framework for convex mixed-integer nonlinear programs. Discrete Optim. 5(2) 186-204.
7. Bussieck, M. R., A. S. Drud, A. Meeraus. 2003. MINLPLib-A collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15(1) 114-119.
8. Castillo, I., J. Westerlund, S. Emet, T. Westerlund. 2005. Optimization of block layout design problems with unequal areas: A comparison of MILP and MINLP optimization methods. Comput. Chemical Engrg. 30(1) 54-69.
9. Dakin, R. J. 1965. A tree-search algorithm for mixed programming problems. Comput. J. 8(3) 250-255.
10. Dolan, E., J. More. 2002. Benchmarking optimization software with performance profiles. Math. Programming 91(2) 201-213.
11. Duran, M. A., I. E. Grossmann. 1986. An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Programming 36(3) 307-339.
12. Fletcher, R., S. Leyffer. 1994. Solving mixed-integer nonlinear programs by outer approximation. Math. Programming 66(3) 327-349.
13. Fletcher, R., S. Leyffer. 2002. Nonlinear programming without a penalty function. Math. Programming 91(2) 239-270.
14. Fletcher, R., S. Leyffer, P. L. Toint. 2002. On the global convergence of a Filter-SQP algorithm. SIAM J. Optim. 13(1) 44-59.
15. Forrest, J. 2004. COIN-OR branch-and-cut MIP solver. https://projects. coin-or.org/Cbc.
16. Forrest, J. J. H., J. P. H. Hirst, J. A. Tomlin. 1974. Practical solution of large mixed-integer programming problems with UMPIRE. Management Sci. 20(5) 736-773.
17. Fourer, R., D. M. Gay, B. W. Kernighan. 1993. AMPL: A Modeling Language for Mathematical Programming. Scientific Press, South San Francisco, CA.
18. Gay, D. M. 1997. Hooking your solver to AMPL. Technical Report 97-4-06, Computing Sciences Research Center, Bell Laboratories, Murray Hill, NJ.
19. Geoffrion. A. M. 1972. Generalized Benders decomposition. J. Optim. Theory Appl. 10(4) 237-260.
20. Grossmann, I. E. 2002. Review of nonlinear mixed-integer and disjunctive programming techniques. Optim. Engrg. 3(3) 227-252.
21. Gupta, O. K., A. Ravindran. 1985. Branch and bound experiments in convex nonlinear integer programming. Management Sci. 31(12) 1533-1546.
22. Harjunkoski, I., T.Westerlund, R. Porn, H. Skrifvars. 1988. Different transformations for solving non-convex trim-loss problems by MINLP. Eur. J. Oper. Res. 105(3) 594-603.
23. Jain, V., I. E. Grossmann. 1998. Cyclic scheduling of continuous parallel-process units with decaying performance. AIChE J. 44(7) 1623-1636.
24. Kelley, J. E, Jr. 1960. The cutting-plane method for solving convex programs. J. SIAM 8(4) 703-712.
25. Kocis, G. R., I. E. Grossmann. 1988. Global optimization of nonconvex mixed-integer nonlinear programming (MINLP) problems in process synthesis. Indust. Engrg. Chemistry Res. 27(8) 1407-1421.
26. Leyffer, S. 1993. Deterministic methods for mixed-integer nonlinear programming. Ph.D. thesis, University of Dundee, Dundee, Scotland, UK. Leyffer, S. 1998. User manual for MINLP-BB. University of Dundee, Dundee, Scotland, UK. http://www.mcs.anl.gov/leyffer/solvers.html.
27. Leyffer, S. 2003. MacMINLP. Retrieved August 2006, http://wiki. mcs.anl.gov/leyffer/index.php/MacMINLP.
28. Linderoth, J. T., T. K. Ralphs. 2005. Noncommercial software for mixed-integer linear programming. J. K. Karlof, ed. Integer Programming: Theory and Practice. CRC Press Operations Research Series. CRC Press, Boca Raton, FL, 253-303.
29. Linderoth, J. T., M. W. P. Savelsbergh. 1999. A computational study of search strategies in mixed-integer programming. INFORMS J. Comput. 11(2) 173-187.
30. Nemhauser, G. L., M. W. P. Savelsbergh, G. C. Sigismondi. 1994. MINTO, a Mixed-INTeger Optimizer. Oper. Res. Lett. 15(1) 47-58.
31. Quesada, I., I. E. Grossmann. 1992. An LP/NLP based branch and bound algorithm for convex MINLP optimization problems. Comput. Chemical Engrg. 16(10-11) 937-947.
32. Quist, A. J., R. van Gemeert, J. E. Hoogenboom, T. Illes, C. Roos, T. Terlaky. 1998. Application of nonlinear optimization to reactor core fuel reloading. Ann. Nuclear Energy 26(5) 423-448.
33. Savelsbergh, M. W. P. 1994. Preprocessing and probing techniques for mixed-integer programming problems. ORSA J. Comput. 6(4) 445-454.
34. Stubbs, R., S. Mehrotra. 1999. A branch-and-cut method for 0-1 mixed convex programming. Math. Programming 86(3) 515-532.
35. Wachter, A., L. T. Biegler. 2006. On the implementation of an interior-point filter line search algorithm for large-scale nonlinear programming. Math. Programming 106(1) 25-57.
36. Westerlund, T., F. Pettersson. 1995. An extended cutting plane method for solving convex MINLP problems. Comput. Chemical Engrg. 19(Supplement 1) 131-136.