An extended cutting plane method for a class of non-convex MINLP problems

Computers and Chemical Engineering

Volumn 22, Issue 3, 1998, Pages 357-365

  Westerlund, Tapio ^a   Skrifvars, Hans ^a   Harjunkoski, Iiro ^a   Pörn, Ray ^a  

^a ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

Extended cutting plane method; Integer non linear programming; Mixed integer non linear programming; Optimization; Pseudo convex functions; Quasi convex functions

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; INTEGER PROGRAMMING; PAPER AND PULP INDUSTRY; PROBLEM SOLVING;

EXTENDED CUTTING PLANE METHOD; MIXED INTEGER NONLINEAR PROGRAMMING (MINLP); PSEUDO CONVEX FUNCTIONS; QUASI CONVEX FUNCTIONS;

NONLINEAR PROGRAMMING;

EID: 0031676324     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0098-1354(97)00000-8     Document Type: Article

References (18)

1. Androulakis, I. P., Maranas, C. D. and Floudas, C. A. (1995) α-BB: A Global optimization method for general constrained nonconvex problems. Journal of Global Optimization 7, 337-363.
2. Dakin, R. J. (1965) A tree search algorithm for mixed-integer programming problems. Computer Journal 8, 250-255.
3. Duran, M. A. and Grossmann, I. E. (1986) An outer-approximation algorithm for a class of mixed-integer non-linear programs. Mathematical Programming 36, 307-339.
4. Fletcher, R. and Leyffer, S. (1994) Solving mixed-integer non-linear programs by outer approximation. Mathematical Programming 66, 327-349.
5. Fletcher, R. and Leyffer, S., Numerical experience with lower bounds for MIQP Branch-and-Bound. University of Dundee, Numerical Analysis Report, NA/ 151 (1995).
6. Floudas, C. A., Nonlinear and Mixed-Integer Optimization, Fundamentals and Applications, Cambridge University Press, New York (1995).
7. Geoffrion, A. M. (1972) Generalized benders decomposition. Journal of Optimization Theory and Applications 10, 237-260.
8. Gupta, O. K. and Ravindran, A. (1985) Branch and bound experiments in convex nonlinear integer programming. Management Science 31, 1533-1546.
9. Kelley, J. E. (1960) The cutting plane method for solving convex programs. Journal of SIAM 8(4), 703-712.
10. Kirkpatrick, S., Gelatt, C. D. and Vecchi, M. P. (1983) Optimization by simulated annealing. Science 220, 671-680.
11. Kemhauser, G. L. and Wolsey, L. A., Integer and Combinatorial Optimization, Wiley, New York (1988).
12. Quesada, I. and Grossmann, I. E. (1992) An LP/NLP based branch-and-bound algorithm for convex MINLP optimization problems. Computers chem. Engng 16, 937-947.
13. Ryoo, H. S. and Sahinidis, N. V. (1995) Global optimization of nonconvex NLPs and MINLPs with applications in process design. Computers chem. Engng 19, 551-566.
14. Westerlund, T., Pettersson, F. and Grossmann, I. E. (1994) Optimization of pump configurations as a MINLP problem. Computers chem. Engng 18, 845-858.
15. Westerlund, T. and Pettersson, F. (1995) An extended cutting plane method for solving convex MINLP problems. Computers chem. Engng Sup. 19, S131-136.
16. Viswanathan, J. and Grossmann, I. E. (1990) A combined penalty function and outer-approximation method for MINLP optimization. Computers Chem. Engng 14, 769-782.
17. Visweswaran, V. and Floudas, C. A., New formulations and branching strategies for the GOP algorithm. In Global Optimization in Engineering Design (Edited by I. E. Grossmann). Kluwer Academic Publishers (1996).
18. Yuan, X., Pibouleau, L. and Domenech, S. (1989) Experiments in process synthesis via mixed-integer programming. Chem. Eng. Process. 25, 99-116.