Generalized Convex Multiplicative Programming via Quasiconcave Minimization

Journal of Global Optimization

Volumn 10, Issue 3, 1997, Pages 229-256

  Jaumard, Brigitte ^a   Meyer, Christophe ^b   Tuy, Hoang ^c  

^a GERAD   (Canada)

^b ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

^c INSTITUTE OF MATHEMATICS   (Viet Nam)

Author keywords

Branch and bound; Conical partition; Generalized convex multiplicative programming; Global optimization

Indexed keywords

EID: 0346439239     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008203116882     Document Type: Article

References (30)

1. Atkinson, M.D., Sack, J.R., Santoro, N. and Strothotte, T. (1986), Min-Max Heaps and Generalized Priority Queues, Communications of the ACM 29(10), 996-1000.
2. Avriel, M., Diewert, W.E., Schaible, S. and Zang, I. (1988), Generalized Concavity, Plenum Press, New York.
3. TM Mixed Integer Library (Version 2.1).
4. Geoffrion, A. (1967), Solving Bicriterion Mathematical Programs, Operations Research 15, 39-54.
5. Henderson, J.M. and Quandt, R.E. (1971), Microeconomic Theory, McGraw-Hill, New York.
6. Horst, R. and Tuy, H. (1993), Global Optimization (Deterministic Approaches), second edition, Springer-Verlag, Berlin.
7. Jaumard, B., Meyer, C. and Tuy, H. (1996), Generalized Convex Multiplicative Programming via Quasiconcave Minimization, Cahier du GERAD G-95-22 (revised version), Montréal, Canada.
8. Konno, H. and Inori, M. (1989), Bond Portfolio Optimization by Bilinear Fractional Programming, Journal of the Operations Research Society of Japan 32, 143-158.
9. Konno, H. and Kuno, T. (1990), Generalized Linear Multiplicative and Fractional Programming, Annals of Operations Research 25, 147-162.
10. Konno, H. and Kuno, T. (1992), Linear Multiplicative Programming, Mathematical Programming 56, 51-64.
11. Konno, H. and Kuno, T. (1995), Multiplicative Programming Problems, in R. Horst and P.M. Pardalos eds., Handbook of Global Optimization, Kluwer, Dordrecht, 369-405.
12. Konno, H., Kuno, T. and Yajima, Y. (1994), Global Minimization of a Generalized Convex Multiplicative Function, Journal of Global Optimization 4(1), 47-62.
13. Konno, H. and Yajima, Y. (1991), Minimizing and Maximizing the Product of Linear Fractional Functions, in Recent Advances in Global Optimization, eds C. Floudas and P. Pardalos, Princeton University Press, 259-273.
14. Konno, H., Yajima, Y and Matsui, T. (1991), Parametric Simplex Algorithms for Solving a Special Class of Nonconvex Minimization Problems, Journal of Global Optimization 1, 65-82.
15. Kuno, T. and Konno, H. (1992), A Parametric Successive Underestimation Method for Convex Multiplicative Programming Problems, Journal of Global Optimization 1, 267-286.
16. Kuno, T., Konno, H. and Yamamoto, Y (1992), A Parametric Successive Underestimation Method for Convex Programming Problems with an Additional Convex Multiplicative Constraint, Journal of the Operations Research Society of Japan 35, 290-299.
17. Kuno, T., Yajima, Y. and Konno, H. (1993), An Outer Approximation Method for Minimizing the Product of Several Convex Functions on a Convex Set, Journal of Global Optimization 3, 325-335.
18. Kuno, T., Yajima, Y., Yamamoto, Y. and Konno, H. (1994), Convex Programs with an Additional Constraint on the Product of Several Convex Functions, European Journal of Operational Research 77, 314-324.
19. Maling, K., Mueller, S.H. and Heller, W.R. (1982), On Finding Most Optimal Rectangular Package Plans, Proceedings of the 19th Design Automation Conference 663-670.
20. Murtagh, B.A. and Saunders, M.A. (1993), MINOS 5.4 User's Guide, Technical report SOL 83-20R, Systems Optimization Laboratory, Department of Operations Research, Stanford University.
21. Muu, L.D. and Tam, B.T. (1992), Minimizing the Sum of a Convex Function and the Product of Two Affine Functions over a Convex Set, Optimization 24, 57-62.
22. Muu, L.D. (1993), An Algorithm for Solving Convex Programs with an Additional Convexconcave Constraint, Mathematical Programming 61, 75-87.
23. Pferschy, U. and Tuy, H. (1994), Linear Programs with an Additional Rank Two Reverse Convex Constraint, Journal of Global Optimization 4, 441-454.
24. Schaible, S. and Sodini, C. (1995), Finite Algorithm for Generalized Linear Multiplicative Programming, Journal of Optimization Theory and Applications 87(2), 441-455.
25. Thach, P.T., Burkard, R.E. and Oettli, W. (1991), Mathematical Programs with a Two Dimensional Reverse Convex Constraint, Journal of Global Optimization 1, 145-154.
26. Thoai, N.V. (1991), A Global Optimization Approach for Solving the Convex Multiplicative Programming Problem, Journal of Global Optimization 1, 341-357.
27. Thoai, N.V. (1993), Canonical D.C. Programming Techniques for Solving a Convex Program with an Additional Constraint of Multiplicative Type, Computing 50, 241-253.
28. Tuy, H., (1994), Introduction to Global Optimization, Cahier du GERAD G-94-04, Montréal, Canada.
29. Tuy, H. and Tam, B.T. (1992), An Efficient Solution Method for Rank Two Quasiconcave Minimization Problems, Optimization 24, 43-56.
30. Tuy, H., Tam, B.T. and Dan, N.D. (1994), Minimizing the Sum of a Convex Function and a Specially Structured Nonconvex Function, Optimization 28, 237-248.