Abstract
Optimization problems that involve products of convex functions in the objective function or in the constraints arise in a variety of applications. These problems are difficult global optimization problems. During the past 15 years, however, a number of practical algorithms have been proposed for globally solving these types of problems. In this article, we present and validate a branch-and-reduce algorithm for finding a global optimal solution to a convex program that contains an additional constraint on the product of several convex functions. To globally solve this problem, the algorithm instead globally solves an equivalent master problem. At any stage of the algorithm, a disconnected set consisting of a union of simplices is constructed. This set is guaranteed to contain a portion of the boundary of the feasible region of the master problem where a global optimal solution lies. The algorithm uses a new branch-and-reduce scheme to iteratively reduce the sizes of these sets until a global optimal solution is found. Several potential computational advantages of the algorithm are explained, and a numerical example is solved.
Similar content being viewed by others
References
Konno, H., Kuno, T., Suzuki, S., Thach, P.T., Yajima, Y.: Global optimization techniques for a problem in the plane. Institute of Human and Social Sciences Research Report, Tokyo Institute of Technology (1991)
Maling, K., Mueller, S.H., Heller, W.R.: On finding most optimal rectangular package plans. In: Proceedings of the 19th Design Automation Conference, pp. 663–670 (1982)
Konno, H., Inori, M.: Bond portfolio optimization by bilinear fractional programming. J. Oper. Res. Soc. Jpn. 32, 143–158 (1988)
Henderson, J.M., Quandt, R.E.: Microeconomic Theory. McGraw-Hill, New York (1971)
Konno, H., Kuno, T.: Multiplicative programming problems. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization, pp. 369–405. Kluwer Academic, Dordrecht (1995)
Kuno, T., Yamamoto, Y.: A finite algorithm for globally optimizing a class of rank-two reverse convex programs. J. Glob. Optim. 12, 247–265 (1998)
Kuno, T., Yajima, Y., Yamamoto, Y., Konno, H.: Convex programs with an additional constraint on the product of several convex functions. Eur. J. Oper. Res. 77, 314–324 (1994)
Thoai, N.V.: Canonical d.c. programming techniques for solving a convex program with an additional constraint of multiplicative type. Computing 50, 241–253 (1993)
Tuy, H., Luc, L.T.: A new approach to optimization under monotonic constraint. J. Glob. Optim. 18, 1–15 (2000)
Geoffrion, A.M.: Duality in nonlinear programming: a simplified applications oriented development. SIAM Rev. 13, 1–37 (1974)
Bank, B., Guddat, J., Klatte, D., Kummar, B., Tammer, K.: Non-linear Parametric Optimization. Akademie-Verlag, Berlin (1982)
Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization, 2nd edn. Kluwer Academic, Dordrecht (2000)
Tuy, H.: Robust solution of nonconvex global optimization problems. J. Glob. Optim. 32, 307–323 (2005)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Benson, H.P. Simplicial Branch-and-Reduce Algorithm for Convex Programs with a Multiplicative Constraint. J Optim Theory Appl 145, 213–233 (2010). https://doi.org/10.1007/s10957-009-9636-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-009-9636-y