An Outcome Space Branch and Bound-Outer Approximation Algorithm for Convex Multiplicative Programming

Journal of Global Optimization

Volumn 15, Issue 4, 1999, Pages 315-342

  Benson, Harold P ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Branch and bound; Convex multiplicative programming; Global optimization; Multiplicative programming; Nonconvex programming; Outer approximation

Indexed keywords

EID: 0000003266     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008316429329     Document Type: Article

References (30)

1. Aneja, Y.P., Aggarwal, V. and Nair, K.P.K. (1984), On a Class of Quadratic Programs, European Journal of Operational Research 18: 62-70.
2. Benson, H.P. and Boger, G.M. (1997), Multiplicative Programming Problems: Analysis and Efficient Point Search Heuristic, Journal of Optimization Theory and Applications 94, 487-510.
3. Falk, J.E. and Palocsay, S.W. (1994), Image Space Analysis of Generalized Fractional Programs, Journal of Global Optimization 4: 63-88.
4. Geoffrion, A.M. (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., Pardalos, P.M. and Thoai, N.V. (1995), Introduction to Global Optimization, Kluwer, Dordrecht, The Netherlands.
7. Horst, R. and Tuy, H. (1993), Global Optimization: Deterministic Approaches, 2nd Edition, Springer, Berlin.
8. Jaumard, B., Meyer, C. and Tuy, H. (1997), Generalized Convex Multiplicative Programming via Quasiconcave Minimization, Journal of Global Optimization 10: 229-256.
9. Konno, H. and Inori, M. (1988), Bond Portfolio Optimization by Bilinear Fractional Programming, Journal of the Operations Research Society of Japan 32: 143-158.
10. Konno, H. and Kuno, T. (1990), Generalized Linear Multiplicative and Fractional Programming, Annals of Operations Research 25: 147-161.
11. Konno, H. and Kuno, T. (1992), Linear Multiplicative Programming, Mathematical Programming 56: 51-64.
12. Konno, H. and Kuno, T. (1995), Multiplicative Programming Problems, In: Handbook of Global Optimization, R. Horst and P.M. Pardalos, Eds., Kluwer, Dordrecht, The Netherlands, pp. 369-405.
13. Konno, H., Kuno, T. and Yajima, Y. (1992), Parametric Simplex Algorithms for a Class of NP-Complete Problems Whose Average Number of Steps is Polynomial, Computational Optimization and Applications 1, 227-239.
14. Konno, H., Kuno, T. and Yajima, Y. (1994), Global Minimization of a Generalized Convex Multiplicative Function, Journal of Global Optimization 4: 47-62.
15. 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-81.
16. Kuno, T. (1996), A Practical Algorithm for Minimizing a Rank-Two Saddle Function on a Polytope, Journal of the Operations Research Society of Japan 39: 63-76.
17. Kuno, T. and Konno, H. (1991), A Parametric Successive Underestimation Method for Convex Multiplicative Programming Problems, Journal of Global Optimization 1: 267-285.
18. 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.
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, pp. 663-670.
20. Mangasarian, O.L. (1969), Nonlinear Programming, McGraw-Hill, New York.
21. Martos, B. (1965), The Direct Power of Adjacent Vertex Programming Methods, Management Science 12: 241-252.
22. Matsui, T. (1996), NP-Hardness of Linear Multiplicative Programming and Related Problems, Journal of Global Optimization 9: 113-119.
23. McCormick, G.P. (1976), Computability of Global Solutions to Factorable Nonconvex Programs: Part I - Convex Underestimating Problems, Mathematical Programming 10: 147-175.
24. 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.
25. Pardalos, P.M. (1990), Polynomial Time Algorithms for Some Classes of Constrained Nonconvex Quadratic Problems, Optimization 21, 843-853.
26. Ryoo, H.S. and Sahinidis, N.V. (1996), A Branch-and-Reduce Approach to Global Optimization, Journal of Global Optimization 8: 107-138.
27. Schaible, S. and Sodini, C. (1995), Finite Algorithm for Generalized Linear Multiplicative Programming, Journal of Optimization Theory and Applications 87: 441-455.
28. Thoai, N.V. (1991), A Global Optimization Approach for Solving the Convex Multiplicative Programming Problem, Journal of Global Optimization 1: 341-357.
29. Tuy, H. (1991), Polyhedral Annexation, Dualization, and Dimension Reduction Technique in Global Optimization, Journal of Global Optimization 1: 229-244.
30. Tuy, H. and Tam, B.T. (1992), An Efficient Solution Method for Rank-Two Quasiconcave Minimization Problems, Optimization 24: 43-56.