Convexification of different classes of non-convex MINLP problems

Computers and Chemical Engineering

Volumn 23, Issue 3, 1999, Pages 439-448

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

^a ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

Binomials; Convexification; Discrete and integer variables; Mixed integer non linear programming; Optimization; Posynomials

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; INTEGER PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; PAPERMAKING; POLYNOMIALS;

BINOMIALS; CONVEXIFICATION; DISCRETE AND INTEGER VARIABLES; EXTENDED CUTTING PLANE; MIXED INTEGER NON LINEAR PROGRAMMING; POSYNOMIALS;

NONLINEAR PROGRAMMING;

ARTICLE; CHEMICAL ENGINEERING; COMPUTER PROGRAM; NONLINEAR SYSTEM; SYSTEM ANALYSIS;

EID: 0033611733     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0098-1354(98)00305-6     Document Type: Article

References (19)

1. Adjiman C. S., Androulakis I. P., Maranas C. D., & Floudas, C. A. (1996). A global optimization method, αBB, for process design. Comput. Chem. Engng, 20, S419-S424.
2. Adjiman, C. S. (1997). Global optimization of MINLP problems in process synthesis and design. Comput. Chem. Engng, 21, S445-S450.
3. Cardoso, M. F., Salcedo, R. L., & Feyo de Azevedo S. (1996). The simplex-simulated annealing approach to continuous non-linear optimization. Comput. Chem. Engng, 20, 1065-1080.
4. Duran, M. A., & Grossmann I. E. (1986). An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Programming, 36, 307-339.
5. Floudas, C. A. (1995). Nonlinear and Mixed-Integer Optimization - Fundamentals and Applications. Oxford: Oxford University Press.
6. Geoffrion, A. M. (1972). Generalized Benders decomposition. J. Optim. Theory Appl., 10, 237-260.
7. Harjunkoski, I., Westerlund, T., Isaksson, J., & Skrifvars, H. (1996). Different formulations for solving trim loss problems in a paper converting mill with ILP. Comput. Chem. Engng, 20, S121-S126.
8. Harjunkoski, I., Westerlund, T., Pörn, R., & Skrifvars, H. (1998). Different transformations for solving non-convex trim loss problems by MINLP. Eur. J. Oper. Res., 105, 594-603.
9. Roberts, A. W., & Varberg, D. E. (1973). Convex Functions. New York: Academic Press.
10. Ryoo, H. S., & Sahinidis, N. V. (1995). Global optimization of non-convex NLPs and MINLPs with applications in process design. Comput. Chem. Engng, 19, 551-566.
11. Salcedo, R. L., Goncalves, M. J., & Feyo de Azevedo, S. (1990). An improved random-search algorithm for non-linear optimization. Comput. Chem. Engng, 14, 1111-1126.
12. Skrifvars, H., Harjunkoski, I., Westerlund, T., Kravanja, Z., & Pörn, R. (1996). Comparison of different MINLP methods applied on some chemical engineering problems. Comput. Chem. Engng, 20, S333-S338.
13. Skrifvars, H. (1998). Mittlp A program package for solving MINLP problems. Report from the Process Design Lab. 98-158-A, ISBN 952-12-0205-X.
14. Smith, E. M. B., & Pantelides, C. C. (1997). Global optimization of nonconvex MINLPs'. Comput. Chem. Engng, 21, S791-S796.
15. Westerlund, T., & Pettersson, F. (1995). An extended cutting plane method for solving convex MINLP problems. Comput. Chem. Engng, 19, S131-S136.
16. Westerlund, T., Skrifvars, H., Harjunkoski, I., & Pörn, R. (1998a). An extended cutting plane method for a class of non-convex MINLP problems. Comput. Chem. Engng, 22, 357-365.
17. Westerlund, T., Isaksson, J., & Harjunkoski, I. (1998b). Solving a production optimization problem in a paper converting mill with MILP. Comput. Chem. Engng, 22, 563-570.
18. Westerlund, T., & Lundqvist, K. (1998). Alpha-ECP, version 1.01. User's guide for an interactive MINLP-solver based on the extended cutting plane method. Report from the Process Design Lab, 98-157-A, ISBN 951-12-0130-4.
19. Yuan, X., Pibouleanu, L., & Domenech, S. (1989). Experiments in process synthesis via mixed-integer programming. Chem. Engng Proc., 25, 99-116.