zbMATH — the first resource for mathematics

Global solution of optimization problems with signomial parts. (English) Zbl 1134.90041
Summary: A new approach for the global solution of nonconvex MINLP (Mixed Integer NonLinear Programming) problems that contain signomial (generalized geometric) expressions is proposed and illustrated. By applying different variable transformation techniques and a discretization scheme a lower bounding convex MINLP problem can be derived. The convexified MINLP problem can be solved with standard methods. The key element in this approach is that all transformations are applied termwise. In this way all convex parts of the problem are left unaffected by the transformations. The method is illustrated by four example problems.

90C30 Nonlinear programming
90C11 Mixed integer programming
Full Text: DOI
[1] Pörn, R.; Harjunkoski, I.; Westerlund, T., Convexification of different classes of nonconvex MINLP problems, Computers and chemical engineering, 23, 439-448, (1999)
[2] Harjunkoski, I.; Westerlund, T.; Pörn, R.; Skrifvars, H., Different transformations for solving nonconvex trim-loss problems by MINLP, European journal of operational research, 105, 594-603, (1998) · Zbl 0955.90095
[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.; Wilde, D.J., Generalized polynomial optimization, SIAM journal of applied mathematics, 15, 1344, (1967) · Zbl 0171.18002
[5] Blau, G.E.; Wilde, D.J, A Lagrangian algorithm for equality constrained generalized polynomial optimization, Aiche, 17, 235, (1971)
[6] Duffin, R.J.; Peterson, E.L., Reversed geometric programming treated by harmonic means, Indiana university mathematics journal, 22, 531, (1972) · Zbl 0246.90044
[7] Rijckaert, M.J.; Martens, X.M., A bibliographical note on geometric programming, Jota, 2, 325, (1978) · Zbl 0369.90111
[8] Dembo, R.S., Current state of the art of algorithms and computer software for geometric programming, Jota, 26, 149, (1978) · Zbl 0369.90121
[9] J.E. Falk, Global solutions of signomial programs, Report, The George Washington University, Program in Logistics, 1973
[10] Maranas, C.D.; Floudas, C.A., Global optimization in generalized geometric programming, Computers and chemical engineering, 21, 351-369, (1997)
[11] Minkowski, H., Geometrie der zahlen, (1896), Teubner Leipzig · JFM 27.0127.09
[12] Avriel, M.; Diewert, W.E.; Shaible, S.; Zang, I., Generalized concavity, (1988), Plenum Press
[13] Maranas, C.D.; Floudas, C.A., Finding all solutions of nonlinearly constrained systems of equations, Journal of global optimization, 7, 143-182, (1995) · Zbl 0841.90115
[14] Winston, W., Operations research—applications and algorithms, (1994), Duxbury Press · Zbl 0867.90079
[15] Floudas, C.A., Nonlinear and mixed-integer optimization—fundamentals and applications, (1995), Oxford University Press · Zbl 0886.90106
[16] Williams, H.P., Experiments in the formulation of integer programming problems, Mathematical programming study, 2, 180-197, (1974)
[17] Nemhauser, G.L.; Wolsey, L.A., Integer and combinatorial optimization, (1988), John Wiley and Sons · Zbl 0652.90067
[18] Padberg, M., Approximating separable nonlinear functions via mixed zero-one programs, Operations research letters, 1-5, (2000) · Zbl 0960.90065
[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, 201-219, (1979) · Zbl 0405.90049
[23] Williams, H.P., Model solving in mathematical programming, (1993), John Wiley & Sons Ltd. Chichester · Zbl 0788.90053
[24] Al-Khayyal, F.A.; Falk, J.E., Jointly constrained biconvex programming, Mathematics of operations research, 8, 273-286, (1983) · Zbl 0521.90087
[25] T. Westerlund, Global optimization, in: L. Liberti, N. Maculan (Eds.), Theory to Implementation, Kluwer Academic Press, pp. 45-74 (Chapter 3 ) · Zbl 1100.90037
[26] Westerlund, T.; Petterson, F., An extended cutting plane method for solving convex MINLP problems, Computers and chemical engineering, 19, Suppl., 131-136, (1995)
[27] Quesada, I.; Grossamnn, I., A global optimization algorithm for linear fractional and bilinear programs, Journal of global optimization, 6, 39-76, (1995) · Zbl 0835.90074
[28] Ryoo, H.S.; Sahinidis, N.V., Global optimization of nonconvex NLPs and MINLPs with applications in process design, Computers and chemical engineering, 19, 551-566, (1995)
[29] Adjiman, C.S.; Androulakis, I.P.; Floudas, C.A., A global optimization method, abb, for general twice-differentiable constrained NLPs-II. implementation and computational results, Computers and chemical engineering, 22, 1159-1179, (1998)
[30] Smith, E.M.B.; Pantelides, C.C., A symbolic reformulation/spatial branch and bound algorithm for the global solution of nonconvex minlps, Computers and chemical engineering, 23, 457-478, (1999)
[31] Quesada, I.; Grossmann, I., Global optimization algorithm for heat exchanger networks, Industrial engineering and chemical resort, 32, 487-499, (1993)
[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.; Grossmann, I., Global optimization of nonconvex mixed-integer nonlinear programming (MINLP) problems in process synthesis, Industrial engineering chemical resort, 27, 1407, (1988)
[34] Haverly, C.A., Studies of the behavior of recursion for the pooling problem, ACM SIGMAP bulletin, 25, 19-28, (1978)
[35] Roberts, A.W.; Varberg, D.E., Convex functions, (1973), Academic Press · Zbl 0271.26009
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.