Overview on mixed integer nonlinear programming problems

AIP Conference Proceedings

Volumn 1168, Issue , 2009, Pages 1374-1377

  Fernandes, Florbela P ^a,b   Costa, M Fernanda P ^b   Fernandas, Edite M G P ^b  

^a INSTITUTO POLITÉCNICO DE BRAGANÇA   (Portugal)

^b UNIVERSITY OF MINHO   (Portugal)

Author keywords

Branch and bound; Mixed integer nonlinear programs; Outer approximation

Indexed keywords

EID: 70450174966     PISSN: 0094243X     EISSN: 15517616     Source Type: Conference Proceeding    
DOI: 10.1063/1.3241342     Document Type: Conference Paper

References (19)

1. Abhishek, K., Leyffer, S. and Linderoth, J. (2006). FilMINT: An Outer-Approximation-Based Solver for Nonlinear Mixed Integer Programs. Technical Report ANL/MCS-P1374-0906, Mathematics and Computer Science Division, Argonne National Laboratory.
2. Biegler, L. and Grossmann, I. (2004). Retrospective on optimization. Computers and Chemical Engineering 28: 1169-1192.
3. Bonami, P., Biegler, L., Conn, A., Cornuejols, G., Grossmann, I., Laird, C, Lee, J., Lodi, A., Margot, R, Sawaya, N., Wachter, A., (2005). An algorihmic framework for convex mixed integer nonlinear programs. Technical Report RC23771, IBM Research Report.
4. Byrd, R. H., Nocedal, J. and Waltz, R. A. (2006). KNITRO: An Integrated Package for NonUnear Optimization in Large-Scale Nonlinear Optimization, G. di Pillo and M. Roma, eds, 35-59 , Springer-Verlag.
5. Fasano, G., Morales, I. L., Nocedal. I. (2009) On the geometry phase in model-based algorithms for derivative-free optimization. Optimization Methods and Software 24: 145-154.
6. Duran, M. and Grossmann, I. (1986). An outer approximation algorithm for a class of mixed-integer nonlinear programs. Mathematical Programming 36: 307-339.
7. Fletcher, F and Leyffer, S. (1994). Solving mixed-integer nonlinear programs by outer approximation. Mathematical Programming 66: 327-349.
8. Gams Development Corp. (2003). Gams - The Solver Manuals. GAMS Development Corp., Washington, DC.
9. Geoffrion, A. M. (1972). Generalized Benders decomposition. Journal of Optimization Theory and Applications 10:4 237-260.
10. Grossmann, I. (2002). Review of Nonlinear Mixed-Integer and Disjunctive Programming Techniques. Optimization and Engineering 3: 227-252.
11. Leyffer, S. (1993). Deterministic Methods for Mixed Integer Nonlinear Programming. PhD Thesis, University of Dundee, United Kingdom.
12. Leyffer, S. (1999). User Manual for MINLP BB, University of Dundee
13. Leyffer, S. (2001). Integrating SQP and branch and bound for mixed integer nonlinear programming. Computational Optimization and Applications 18: 295-309.
14. Leyffer, S., Sartenaer, A., Wanufelle, E. (2008). Branch-and-Reflne for Mixed Integer Nonconvex Global Optimization. Preprint ANL/MCS-P1547-0908, Mathematics and Computer Science Division, Argonne National Laboratory.
15. Leyffer, S., Linderoth, L, Luedtke, I., Miller, A., Munson, T (2009). Applications and Algorithms for Mixed Integer Nonlinear Programming. Preprint ANL/MCS-Pl630-0509, Mathematics and Computer Science Division, Argonne National Laboratory.
16. Nowak, I., Vigerske, S. (2008). LaGO: a (heuristic) branch and cut algorithm for nonconvex MINLPs. Central European Journal of Operations Research 16: 127-138.
17. Powell, M. I. C. (2004). Least Frobenius norm updating of quadratic models that satisfy interpolation conditions. Mathematical Programming 100: 183-215.
18. Quesada, I., Grossmann, I. E. (1992). An LP/NLP based branch and bound algorithm for convex MINLP optimization problems. Computers and Chemical Engineering 16:2 937-947.
19. Westerlund, T, Pettersson, F (1995). An Extended cutting plane method for solving convex MINE problems.Computers and Chemical Engineering 19: 131-136.