A numerical study on B&B algorithms for solving sum-of-ratios problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6059 LNCS, Issue , 2010, Pages 356-362

  Gao, Lianbo ^a   Shi, Jianming ^a  

^a MURORAN INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

branch and bound approach; fractional programming; Sum of ratios problem

Indexed keywords

BRANCH AND BOUNDS; FRACTIONAL PROGRAMMING; NUMERICAL EXPERIMENTS; NUMERICAL STUDIES; SUM-OF-RATIOS PROBLEM;

ALGORITHMS;

EID: 77954571454     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13577-4_31     Document Type: Conference Paper

References (13)

1. Benson, H.P.: Using concave envelopes to globally solve the nonlinear sum of ratios problem. Journal of Global Optimization 22, 343-364 (2002)
2. Kuno, T.: A branch-and-bound algorithm for maximizing the sum of several linear ratios. Journal of Global Optimization 22, 155-174 (2002)
3. Craven, B.D.: Fractional Programming. Sigma Series in Applied Mathematics, vol. 4. Heldermann verlag, Berlin (1988)
4. Freund, R.W., Jarre, F.: Solving the sum-of-ratios problem by an interior-point method. Journal of Global Optimization 19, 83-102 (2001)
5. Hoai Phuong, N.T., Tuy, H.: A unified monotonic approach to generalized linear fractional programming. Journal of Global Optimization 26, 229-259 (2003)
6. Konno, H., Abe, N.: Minimization of the sum of three linear fractional functions. Journal of Global Optimization 15, 419-432 (1999)
7. Konno, H., Fukaishi, K.: A branch-and-bound algorithm for solving low rank linear multiplicative and fractional programming problems. Journal of Global Optimization 18, 283-299 (2000)
8. Konno, H., Yajima, Y., Matsui, T.: Parametric simplex algorithms for solving a special class of nonconvex minimization problems. Journal of Global Optimization 1, 65-81 (1991)
9. Konno, H., Yamashita, H.: Minimization of the sum and the product of several linear fractional functions. Naval Research Logistics 46, 583-596 (1999)
10. Muu, L.D., Tam, B.T., Schaible, S.: Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions. Journal of Global Optimization 6, 179-191 (1995)
11. Mastumi, T.: NP Hardness of Linear Multiplicative Programming And Related Problems. Journal of Information and Optimization Sciences 9, 113-119 (1996)
12. Schaible, S.: A note on the sum of a linear and linear-fractional function. Naval Research Logistics Quarterly 24, 691-693 (1977)
13. Schaible, S., Shi, J.: Fractional programming: the sum-of-ratios case. Optimization Methods and Software 18, 219-229 (2003)