Mixed-integer nonlinear programming: Some modeling and solution issues

IBM Journal of Research and Development

Volumn 51, Issue 3-4, 2007, Pages 489-497

  Lee, Jon ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; NONLINEAR PROGRAMMING; OPTIMIZATION;

MIXED-INTEGER LINEAR PROGRAMMING; MIXED-INTEGER NONLINEAR PROGRAMMING;

INTEGER PROGRAMMING;

EID: 34547482835     PISSN: 00188646     EISSN: 00188646     Source Type: Journal    
DOI: 10.1147/rd.513.0489     Document Type: Article

References (31)

1. ILOG-Cplex 9.0 User's Manual, 2003; see http://www.ilog.com/.
2. P. Gill, W. Murray, and M. A. Saunders, "SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization," SIAM Rev. 47, No. 1, 99-131 (2005).
3. A. Waechter and L. T. Biegler, "On the Implementation of an Interior-Point Filter Line-Search Algorithm for Large-Scale Nonlinear Programming," Math. Program. 106, No. 1, 25-57 (2006).
4. R. Fourer, D. Gay, and B. Kernighan, AMPL: A Modeling Language for Mathematical Programming, Brooks/Cole, Stamford, CT, 2003.
5. A. Brooke, D. Kendrick, A. Meeraus, and R. Raman, GAMS: A User's Guide; see http://www.gams.com/docs/document.htm.
6. E. M. L. Beale and J. J. H. Forrest, "Global Optimization Using Special Ordered Sets," Math. Program. 10, 52-69 (1976).
7. J. Lee and D. Wilson, "Polyhedral Methods for Piecewise-Linear Functions I: The Lambda Method," Discrete Appl. Math. 108, No. 3, 269-285 (2001).
8. A. Martin, M. Möller, and S. Moritz, "Approximation of Non-Linear Functions in Mixed Integer Programming," presented at the workshop on Integer Programming and Continuous Optimization, Chemnitz, Germany, November 7-9, 2004.
9. J. Lee, "In Situ Column Generation for a Cutting-Stock Problem," Computers & Oper. Res. 34, No. 8, 2345-2358 (2007); see www.sciencedirect.com.
10. P. Bonami, A. Waechter, L. T. Biegler, A. R. Conn, G. Cornuéjols, I. E. Grossmann, C. D. Laird, et al., "An Algorithmic Framework for Convex Mixed Integer Nonlinear Programs," Research Report RC-23771, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 2005.
11. P. Bonami and J. Lee, BONMIN Users' Manual; see http:// projects.coin-or.org/Bonmin.
12. C. Bragalli, C. D'Ambrosio, J. Lee, A. Lodi, and P. Toth, "An MINLP Solution Method for a Water Network Problem," Algorithms-ESA 2006, Y. Azar and T. Erlebach, Editors, Proceedings of the 14th Annual European Symposium, Zurich, Switzerland, Springer, New York, 2006, pp. 696-707.
13. G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization, John Wiley & Sons, Hackensack, NJ, 1988.
14. M. W. P. Savelsbergh, "Preprocessing and Probing for Mixed Integer Programming Problems," O RSA J. Computing 6, No. 4, 445-454 (1994).
15. R. Anbil, R. Tanga, and E. L. Johnson, "A Global Approach to Crew-Pairing Optimization," IBM Syst. J. 31, No. 1, 71-78 (1992).
16. Q. Chen, M. Ferris, and J. T. Linderoth, "FATCOP 2.0: Advanced Features in an Opportunistic Mixed Integer Programming Solver," Ann. Oper. Res. 103, 17-32 (2001).
17. J. T. Linderoth and M. W. P. Savelsbergh, "A Computational Study of Branch and Bound Search Strategies for Mixed Integer Programming," INFORMS J. Computing 11, No. 2, 173-187 (1999).
18. L. Bertacco, M. Fischetti, and A. Lodi, "A Feasibility Pump Heuristic for General Mixed-Integer Problems," Discrete Optimization 4, 63-76 (2007).
19. P. E. Gill, W. Murray, and M. H. Wright, Practical Optimization, Academic Press, New York, 1981.
20. J. Lee, A First Course in Combinatorial Optimization, Cambridge University Press, New York, 2004.
21. O. K. Gupta and V. Ravindran, "Branch and Bound Experiments in Convex Nonlinear Integer Programming," Manage. Sci. 31, No. 12, 1533-1546 (1985).
22. M. Duran and I. E. Grossmann, "An Outer-Approximation Algorithm for a Class of Mixed-Integer Nonlinear Programs," Math. Program.i] 36, No. 3, 307-339 (1986).
23. I. Quesada and I. E. Grossmann, "An LP/NLP Based Branch and Bound Algorithm for Convex MINLP Optimization Problems," Computers & Chem. Eng. 16, No. 10/11, 937-947 (1992).
24. L. Liberti and N. Maculan, Global Optimization: From Theory to Implementation, Chapter: "Nonconvex Optimization and Its Applications," Springer, New York, 2006.
25. C. Audet, P. Hansen, and G. Savard, Essays and Surveys in Global Optimization, GERAD 25th Anniversary Series, Springer, New York, 2005.
26. M. Tawarmalani and N. V. Sahinidis, Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming, Kluwer Academic Publishing, Dordrecht, The Netherlands, 2002.
27. C. A. Floudas, Deterministic Global Optimization, Kluwer Academic Publishing, Dordrecht, The Netherlands, 2000.
28. J. Lee and W. D. Morris, Jr., "Geometric Comparison of Combinatorial Polytopes," Discrete Appl. Math. 55, No. 2, 163-182 (1994).
29. M. Fischetti and A. Lodi, "Local Branching," Math. Program. 98, 23-47 (2003).
30. P. Bonami, G. Cornuéjols, A. Lodi, and F. Margot, "A Feasibility Pump for Mixed Integer Nonlinear Programs," Research Report RC-23862, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 2006.
31. J. A. De Loera, D. Haws, R. Hemmecke, P. Huggins, and R. Yoshida, "A Computational Study of Integer Programming Algorithms Based on Barvinok's Rational Functions," Discrete Optimization 2, No. 2, 135-144 (2005).