Abstract
Global optimization problems involving the minimization of a product of convex functions on a convex set are addressed in this paper. Elements of convex analysis are used to obtain a suitable representation of the convex multiplicative problem in the outcome space, where its global solution is reduced to the solution of a sequence of quasiconcave minimizations on polytopes. Computational experiments illustrate the performance of the global optimization algorithm proposed.
Similar content being viewed by others
References
Benson, H.P.: An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming. J. Global Optim. 15, 315–342 (1999)
Benson, H.P., Boger, G.M.: Multiplicative programming problems: analysis and efficient point search heuristic. J. Optim. Theory Appl. 94, 487–510 (1997)
Benson, H.P., Boger, G.M.: Outcome-space cutting-plane algorithm for linear multiplicative programming. J. Optim. Theory Appl. 104, 301–322 (2000)
Cambini, R., Sodini, C.: A finite algorithm for a class of nonlinear multiplicative programs. J. Global Optim. 26, 279–296 (2001)
Chen, P.C., Hansen, P., Jaumard, B.: On-line and off-line vertex enumeration by adjacency lists. Opers. Res. Lett. 10, 403–409 (1991)
Ferreira, P.A.V., Machado, M.E.S.: Solving multiple objective problems in the objective space. J. Optim. Theory Appl. 89, 659–680 (1996)
Floudas, C.A., Visweswaram, V.: A primal-relaxed dual global optimization approach. J. Optim. Theory Appl. 78, 187–225 (1993)
Geoffrion, A.M.: Solving bicriterion mathematical programs. Oper. Res. 15, 39–54 (1967)
Geoffrion, A.M.: Generalized benders decomposition. J. Optim. Theory Appl. 10, 237–260 (1972)
Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization. Kluwer Academic Publishers, Netherlands (1995)
Jaumard, B., Meyer, C., Tuy, H.: Generalized convex multiplicative programming via quasiconcave minimization. J. Global Optim. 10, 229–256 (1997)
Konno, H., Kuno, T.: Linear multiplicative programming. Math. Program. 56, 51–84 (1992)
Konno, H., Kuno, T.: Multiplicative programming problems. In: Horst, R., Pardalos, P.M. (eds.), Handbook of Global Optimization, pp. 369–405. Kluwer Academic Publishers, Netherlands (1995)
Konno, H., Kuno, T., Yajima, Y.: Global minimization of a generalized convex multiplicative function. J. Global Optim. 4, 47–62 (1994)
Katoh, N., Ibaraki, T.: A parametric characterization and an ε-approximation scheme for the minimization of a quasiconcave program. Discrete Appl. Math. 17, 39–66 (1987)
Kuno, T.: A finite branch-and-bound algorithm for linear multiplicative programming. Comput. Optim. Appl. 20, 119–135 (2001)
Kuno, T., Yajima, Y., Konno, H.: An outer approximation method for minimizing the product of several convex functions on a convex set. J. Global Optim. 3, 325–335 (1993)
Lasdon, L.S.: Optimization Theory for Large Systems. MacMillan Publishing Co., New York (1970)
Liu, X.J., Umegaki, T., Yamamoto, Y.: Heuristic methods for linear multiplicative programming. J. Global Optim. 15, 433–447 (1999)
MATLAB, User’s Guide, The MathWorks Inc., http://www.mathworks.com/
Rockafellar, R.T.: Convex Analysis. Princeton University Press, New Jersey (1970)
Ryoo, H.S., Sahinidis, N.V.: Analysis of bounds for multilinear functions. J Global Optim. 19, 403–424 (2001)
Ryoo, H.S., Sahinidis, N.V.: Global optimization of multiplicative problems. J. Global Optim. 26, 387–418 (2003)
Scott, C.H., Jefferson, T.R.: On duality for a class of quasiconcave multiplicative problems. J. Optim. Theory Appl. 117, 575–583 (2003)
Thoai, N.V.: A global optimization approach for solving the convex multiplicative programming problem. J. Optim. Theory Appl. 1, 341–357 (1991)
Thoai, N.V.: Convergence and application of a decomposition method using duality bounds for nonconvex global optimization. J. Optim. Theory Appl. 133, 165–193 (2002)
Yu, P.-L.: Multiple-Criteria Decision Making. Plenum Press, New York (1985)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Oliveira, R.M., Ferreira, P.A.V. A convex analysis approach for convex multiplicative programming. J Glob Optim 41, 579–592 (2008). https://doi.org/10.1007/s10898-007-9267-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-007-9267-5