Global Maximization of a Generalized Concave Multiplicative Function
- 164 Downloads
This article presents a branch-and-bound algorithm for globally solving the problem (P) of maximizing a generalized concave multiplicative function over a compact convex set. Since problem (P) does not seem to have been studied previously, the algorithm is apparently the first algorithm to be proposed for solving this problem. It works by globally solving a problem (P1) equivalent to problem (P). The branch-and-bound search undertaken by the algorithm uses rectangular partitioning and takes place in a space which typically has a much smaller dimension than the space to which the decision variables of problem (P) belong. Convergence of the algorithm is shown; computational considerations and benefits for users of the algorithm are given. A sample problem is also solved.
KeywordsGlobal optimization Branch-and-bound algorithms Multiplicative programming Quadratic programming Bilinear programming
Unable to display preview. Download preview PDF.
- 5.Floudas, C.A., Visweswaran, V.: Quadratic optimization. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization, pp. 217–269. Kluwer Academic, Dordrecht (1995) Google Scholar
- 7.Watanabe, H.: IC layout generation and compaction using mathematical programming. Ph.D. Thesis, University of Rochester (1984) Google Scholar
- 8.Konno, H., Yajima, Y.: Solving rank two bilinear programs by parametric simplex algorithms. Institute of Human and Social Sciences Working Paper IHSS 90–17, Tokyo Institute of Technology (1990) Google Scholar
- 14.Nemhauser, G.L., Wolsey, L.A.: Combinatorial Optimization. Wiley, New York (1998) Google Scholar
- 16.Benson, H.P.: Global maximization of a generalized concave multiplicative function. Warrington College of Business Administration Working Paper, University of Florida (2007) Google Scholar
- 17.Horst, R., Tuy, H.: Global Optimization—Deterministic Approaches. Springer, Berlin (1993) Google Scholar
- 21.LINDO SYSTEMS: Optimization modeling with LINGO. LINDO Systems, Chicago (2000) Google Scholar