Using concave envelopes to globally solve the nonlinear sum of ratios problem

Journal of Global Optimization

Volumn 22, Issue 1-4, 2002, Pages 343-364

  Benson, Harold P ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Concave envelope; Fractional functions; Global optimization; Sum of ratios problem

Indexed keywords

GLOBAL OPTIMIZATION;

BRANCH AND BOUND SEARCH; BRANCH-AND-BOUND ALGORITHMS; COMPUTATIONAL ADVANTAGES; COMPUTATIONAL RESULTS; CONCAVE ENVELOPE; CONVERGENCE RESULTS; FEASIBLE REGIONS; SUM-OF-RATIOS PROBLEM;

BRANCH AND BOUND METHOD;

EID: 84938594373     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1023/a:1013869015288     Document Type: Article

References (30)

1. Almogy, Y. and Levin, O. (1970), Parametric analysis of a multi-stage stochastic shipping problem, Operational Research’69, Tavistok Publications, London
2. Benson, H.P. (1996), Deterministic algorithms for constrained concave minimization: a unified critical survey, Naval Research Logistics43: 765–795
3. Benson, H.P. (2001), On the construction and utilization of convex and concave envelopes of bilinear and fractional functions, Working Paper, Department of Decision and Information Sciences, University of Florida, Gainesville, FL
4. Benson, H.P. (1999), An outcome space branch and bound outer-approximation algorithm for convex multiplicative programming, Journal of Global Optimization15: 315–342
5. Benson, H.P. (1990), Separable concave minimization via partial outer approximation and branch and bound, Operations Reserch Letters9: 389–394
6. Cambini, A., Martein, L. and Schaible, S. (1989), On maximizing a sum of ratios, Journal of Information and Optimization Sciences10: 65–79
7. Colantoni, C.S., Manes, R.P. and Whinston, A. (1969), Programming, profit rates and pricing decisions, The Accounting Review44: 467–481
8. Dur, M., Horst, R. and Thoai, N.V. (2001), Solving sum-of-ratios fractional programs using efficient points, Optimization, to appear
9. Falk, J.E. and Palocsay, S.W. (1994), Image space analysis of generalized fractional programs, Journal of Global Optimization4: 63–88
10. Fourer, R., Gay, D.M. and Kernighan, B.W. (1993), AMPL, a Modeling Language for Mathematical Programming, Boyd and Fraser Publishing Company, Danvers, MA
11. Freund, R. and Jarre, F. (2001), Solving the sum-of-ratios problem by an interior point method, Journal of Global Optimization19: 83–102
12. Gallo, G. and Ulkucu, A. (1977), Bilinear programming: an exact algorithm, Mathematical Programming12: 173–194
13. Horst, R. and Pardalos, P.M. (eds) (1995), Handbook of Global Optimization, Kluwer Academic Publishers, Dordrecht, The Netherlands
14. Horst, R. and Tuy, H. (1993), Global Optimization: Deterministic Approaches, Springer Verlag, Berlin
15. Kalantari, B. and Rosen, J.B. (1987), An algorithm for global minimization of linearly constrained concave quadratic functions, Mathematics of Operations Research12: 544–561
16. Konno, H. and Abe, N. (1999), Minimization of the sum of three linear fractional functions, Journal of Global Optimization15: 419–432
17. Konno, H. and Fukaishi, K. (2000), A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems, Journal of Global Optimization18: 283–299
18. Konno, H. and Inori, M. (1989), Bond portfolio optimization by bilinear fractional programming, Journal of the Operations Research Society of Japan32: 143–158
19. Konno, H., Kuno, T. and Yajima, Y. (1994), Global minimization of a generalized convex multiplicative function, Journal of Global Optimization4: 47–62
20. Konno, H. and Watanabe, H. (1996), Bond portfolio optimization problems and their application to index tracking: a partial optimization approach, Journal of the Operations Research Society of Japan39: 295–306
21. Konno, H., Yajima, Y. and Matsui, T. (1991), Parametric simplex algorithms for solving a special class of nonconvex minimization problems, Journal of Global Optimization1: 65–81
22. Konno, H. and Yamashita, H. (1999), Minimizing sums and products of linear fractional functions over a polytope, Naval Research Logistics46: 583–596
23. Kuno, T. (2000), A branch-and-bound algorithm for maximizing the sum of several linear ratios, University of Tsukuba, Research Report ISE-TR-00-175, Tsukuba, Japan
24. Murtagh, B.A. and Saunders, M.A. (1998), MINOS 5.5 User’s Guide, Stanford University, Technical Report SOL 83-20R, Stanford, CA
25. Quesada, I. and Grossman, I. (1995), A global optimization algorithm for linear fractional and bilinear programs, Journal of Global Optimization6: 39–76
26. Rosen, J.B. and Pardalos, P.M. (1986), Global minimization of large-scale constrained concave quadratic problems by separable programming, Mathematical Programming34: 163–174
27. Schaible, S. (1995), Fractional programming, in: R. Horst and P.M. Pardalos (eds), Handbook of Global Optimization, Kluwer Academic Publishers, Dordrecht, The Netherlands, 495–608
28. Schaible, S. (1994), Fractional programming with sums of ratios, University of Pisa, Report No. 83, Pisa, Italy
29. Schaible, S. (1977), A note on the sum of a linear and linear-fractional function, Naval Research Logistics Quarterly24: 691–693
30. Tuy, H. (1998), Convex Analysis and Global Optimization, Kluwer Academic Publishers, Dordrecht, The Netherlands.