Skip to main content
Log in

Global Maximization of a Generalized Concave Multiplicative Function

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Konno, H., Kuno, T., Yajima, Y.: Global minimization of a generalized convex multiplicative function. J. Glob. Optim. 4, 47–62 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  2. Cambini, R., Sodini, C.: Decomposition methods for solving nonconvex quadratic programs via branch and bound. J. Glob. Optim. 33, 313–336 (2006)

    Article  MathSciNet  Google Scholar 

  3. Tuy, H.: Convex Analysis and Global Optimization. Kluwer Academic, Dordrecht (1998)

    MATH  Google Scholar 

  4. Pardalos, P.M., Rosen, J.B.: Constrained Global Optimization: Algorithms and Applications. Springer, Berlin (1987)

    MATH  Google Scholar 

  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 

  6. Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization. Kluwer Academic, Dordrecht (1995)

    MATH  Google Scholar 

  7. Watanabe, H.: IC layout generation and compaction using mathematical programming. Ph.D. Thesis, University of Rochester (1984)

  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 

  9. Konno, H., Thach, P.T., Tuy, H.: Optimization on Low Rank Nonconvex Structures. Kluwer Academic, Dordrecht (1997)

    MATH  Google Scholar 

  10. Mangasarian, O.L.: Equilibrium points of bimatrix games. SIAM J. 12, 778–780 (1964)

    MATH  MathSciNet  Google Scholar 

  11. Freize, A.M.: A bilinear programming formulation of the 3-dimensional assignment problem. Math. Program. 7, 376–379 (1979)

    Article  Google Scholar 

  12. Falk, J.E.: A linear max-min problem. Math. Program. 5, 169–188 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  13. Raghavachari, M.: On connections between zero-one integer programming and concave programming under linear constraints. Oper. Res. 17, 680–684 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  14. Nemhauser, G.L., Wolsey, L.A.: Combinatorial Optimization. Wiley, New York (1998)

    Google Scholar 

  15. Avriel, M., Diewart, W.E., Schaible, S., Zang, I.: Generalized Concavity. Plenum, New York (1988)

    MATH  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)

  17. Horst, R., Tuy, H.: Global Optimization—Deterministic Approaches. Springer, Berlin (1993)

    Google Scholar 

  18. Al-Khayyal, F.A., Falk, J.E.: Jointly constrained biconvex programming. Math. Oper. Res. 8, 273–286 (1983)

    MATH  MathSciNet  Google Scholar 

  19. Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming—Theory and Algorithms. Wiley, New York (1993)

    MATH  Google Scholar 

  20. Benson, H.P.: Deterministic algorithms for constrained concave minimization: a unified critical survey. Nav. Res. Logist. 43, 765–795 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  21. LINDO SYSTEMS: Optimization modeling with LINGO. LINDO Systems, Chicago (2000)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to H. P. Benson.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Benson, H.P. Global Maximization of a Generalized Concave Multiplicative Function. J Optim Theory Appl 137, 105–120 (2008). https://doi.org/10.1007/s10957-007-9323-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-007-9323-9

Keywords

Navigation