Global solution of optimization problems with signomial parts

Discrete Optimization

Volumn 5, Issue 1, 2008, Pages 108-120

  Pörn, Ray ^a   Björk, Kaj Mikael ^b   Westerlund, Tapio ^b  

^a Swedish Polytechnic   (Finland)

^b ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

Convexification; Global optimization; Mixed integer nonlinear programming; Signomials; Variable transformations

Indexed keywords

COMPUTATIONAL GEOMETRY; FINITE DIFFERENCE METHOD; INTEGER PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING;

CONVEXIFICATION; MIXED INTEGER NONLINEAR PROGRAMMING; SIGNOMIALS; VARIABLE TRANSFORMATIONS;

GLOBAL OPTIMIZATION;

EID: 38749087605     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2007.11.005     Document Type: Article

References (35)

1. Pörn R., Harjunkoski I., and Westerlund T. Convexification of different classes of nonconvex MINLP problems. Computers and Chemical Engineering 23 (1999) 439-448
2. Harjunkoski I., Westerlund T., Pörn R., and Skrifvars H. Different transformations for solving nonconvex Trim-Loss problems by MINLP. European Journal of Operational Research 105 (1998) 594-603
3. I. Harjunkoski, Application of MINLP methods to a scheduling problem in the paper-converting industry, Ph.D. Thesis in Process Synthesis, Åbo Akademi University, 1997. ISBN 952-12-0091-X
4. Passy U., and Wilde D.J. Generalized polynomial optimization. SIAM Journal of Applied Mathematics 15 (1967) 1344
5. Blau G.E., and Wilde D.J. A Lagrangian algorithm for equality constrained generalized polynomial optimization. AIChE 17 (1971) 235
6. Duffin R.J., and Peterson E.L. Reversed geometric programming treated by harmonic means. Indiana University Mathematics Journal 22 (1972) 531
7. Rijckaert M.J., and Martens X.M. A bibliographical note on geometric programming. JOTA 2 (1978) 325
8. Dembo R.S. Current state of the art of algorithms and computer software for geometric programming. JOTA 26 (1978) 149
9. J.E. Falk, Global solutions of signomial programs, Report, The George Washington University, Program in Logistics, 1973
10. Maranas C.D., and Floudas C.A. Global optimization in generalized geometric programming. Computers and Chemical Engineering 21 (1997) 351-369
11. Minkowski H. Geometrie der zahlen (1896), Teubner, Leipzig
12. Avriel M., Diewert W.E., Shaible S., and Zang I. Generalized Concavity (1988), Plenum Press
13. Maranas C.D., and Floudas C.A. Finding all solutions of nonlinearly constrained systems of equations. Journal of Global Optimization 7 (1995) 143-182
14. Winston W. Operations Research-Applications and Algorithms. 3rd edition (1994), Duxbury Press
15. Floudas C.A. Nonlinear and Mixed-Integer Optimization-Fundamentals and Applications (1995), Oxford University Press
16. Williams H.P. Experiments in the formulation of integer programming problems. Mathematical Programming Study 2 (1974) 180-197
17. Nemhauser G.L., and Wolsey L.A. Integer and Combinatorial Optimization (1988), John Wiley and Sons
18. Padberg M. Approximating separable nonlinear functions via mixed zero-one programs. Operations Research Letters (2000) 1-5
19. Cplex. http://www.ilog.com/products/cplex/, 2006
20. XPRESS. http://www.dashoptimization.com/home/products/products_optimizer.html, 2006
21. Lp-solve. http://www.cs.sunysb.edu/~algorith/implement/ lpsolve/implement.shtml, 2006
22. Beale E.M.L. Branch-and-bound methods for mathematical programming systems. Annals of Discrete Mathematics 5 (1979) 201-219
23. Williams H.P. Model Solving in Mathematical Programming (1993), John Wiley & Sons Ltd., Chichester
24. Al-Khayyal F.A., and Falk J.E. Jointly constrained biconvex programming. Mathematics of Operations Research 8 (1983) 273-286
25. T. Westerlund, Global optimization, in: L. Liberti, N. Maculan (Eds.), Theory to Implementation, Kluwer Academic Press, pp. 45-74 (Chapter 3 )
26. Westerlund T., and Petterson F. An extended cutting plane method for solving convex MINLP problems. Computers and Chemical Engineering 19 Suppl. (1995) 131-136
27. Quesada I., and Grossamnn I. A global optimization algorithm for linear fractional and bilinear programs. Journal of Global Optimization 6 (1995) 39-76
28. Ryoo H.S., and Sahinidis N.V. Global optimization of nonconvex NLPs and MINLPs with applications in process design. Computers and Chemical Engineering 19 (1995) 551-566
29. Adjiman C.S., Androulakis I.P., and Floudas C.A. A global optimization method, aBB, for general twice-differentiable constrained NLPs-II. Implementation and computational results. Computers and Chemical Engineering 22 (1998) 1159-1179
30. Smith E.M.B., and Pantelides C.C. A symbolic reformulation/spatial branch and bound algorithm for the global solution of nonconvex MINLPs. Computers and Chemical Engineering 23 (1999) 457-478
31. Quesada I., and Grossmann I. Global optimization algorithm for heat exchanger networks. Industrial Engineering and Chemical Resort 32 (1993) 487-499
32. R. Pörn, Mixed integer nonlinear programming: Convexification techniques and algorithm development, Ph.D. Thesis in Applied Mathematics, Åbo Akademi University, ISBN 952-12-0681-X, 2000
33. Kocis G.R., and Grossmann I. Global optimization of nonconvex mixed-integer nonlinear programming (MINLP) problems in process synthesis. Industrial Engineering Chemical Resort 27 (1988) 1407
34. Haverly C.A. Studies of the behavior of recursion for the pooling problem. ACM SIGMAP Bulletin 25 (1978) 19-28
35. Roberts A.W., and Varberg D.E. Convex Functions (1973), Academic Press