A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem

Journal of Computational and Applied Mathematics

Volumn 223, Issue 1, 2009, Pages 145-158

  Shen, Pei Ping ^a   Duan, Yun Peng ^a   Pei, Yong Gang ^a  

^a HENAN NORMAL UNIVERSITY   (China)

Author keywords

Branch and bound; Duality bound; Fractional programming; Global optimization; Sum of ratios

Indexed keywords

ALGEBRA; ALGORITHMS; BOOLEAN FUNCTIONS; CONTROL THEORY; GLOBAL OPTIMIZATION; LINEAR PROGRAMMING; TOPOLOGY;

BOUND ALGORITHMS; BRANCH AND BOUND; BRANCH AND BOUND SCHEMES; DUALITY BOUND; FEASIBLE REGIONS; FRACTIONAL PROGRAMMING; GLOBAL CONVERGENCES; LAGRANGE DUALITIES; LINEAR PROGRAMS; LOWER BOUNDS; NONCONVEX; NUMERICAL EXPERIMENTS; SUM OF RATIOS;

PROBLEM SOLVING;

EID: 54249093908     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2008.01.003     Document Type: Article

References (16)

1. Lo A.W., and MacKinlay A.C. Maximizing predictability in the stock and bond markets. Macroeconomic Dynamics 1 (1997) 102-134
2. D.Z. Chen, O. Daescu, Y. Dai, N. Katoh, X. Wu, J. Xu, Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications, in: Proceedings of the 11th Annual SIAM-ACM Symposium on Discrete Algorithms, SODA, San Francisco, 2000, pp. 707-716
3. Konno H., and Yamashita H. Minimizing sums and products of linear fractional functions over a polytope. Naval Research Logistics 46 (1999) 583-596
4. Benson H.P. Fractional programming with convex quadratic forms and functions. European Journal of Operational Research 173 (2006) 351-369
5. Benson H.P. Global optimization algorithm for the nonlinear sum of ratios problem. Journal of Optimization Theory and Applications 112 (2002) 1-29
6. Benson H.P. Maximizing the ratio of two convex functions over a convex set. Naval Research Logistics 53 (2006) 309-317
7. Benson H.P. Using concave envelopes to globally solve the nonlinear sum of ratios problem. Journal of Global Optimization 22 (2002) 343-364
8. Tuy H. Convex Analysis and Global Optimization (1998), Kluwer, Dordrecht, Netherlands
9. Stancu-Minasian I.M. Fractional Programming: Theory, Methods and Applications (1997), Kluwer, Dordrecht
10. Gotoh J.Y., and Konno H. Maximization of the ratio of two convex quadratic functions over a polytope. Computational Optimization and Applications 20 (2001) 43-60
11. Shen P.P., and Wang C.F. Global optimization for sum of linear ratios problem with coefficients. Applied Mathematics and Computation 176 (2006) 219-229
12. Horst R., and Tuy H. Global Optimization: Deterministic Approaches (1996), Springer, Berlin
13. Horst R., Pardalos P.M., and Thoai N.V. Introduction to Global Optimization (1995), Kluwer, Dordrecht, Netherlands
14. Freund R.W., and Jarre F. Solving the sum-of-ratios problem by an interior-point method. Journal of Global Optimization 19 (2001) 83-102
15. Yamamoto R., and Konno H. An efficient algorithm for solving convex-convex quadratic fractional programs. Journal of Optimization Theory and Applications 133 (2007) 241-255
16. Kuno T. A branch-and-bound algorithm for maximizing the sum of several linear ratios. Journal of Global Optimization 22 (2002) 155-174