Solving the sum-of-ratios problem by a stochastic search algorithm

Journal of Global Optimization

Volumn 42, Issue 1, 2008, Pages 91-109

  Wu, Wei Ying ^a   Sheu, Ruey Lin ^b   Birbil, Ş Ilker ^c  

^a MICHIGAN STATE UNIVERSITY   (United States)

^b NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

^c SABANCI UNIVERSITY   (Turkey)

Author keywords

Branch and bound method; Dinkelbach type method; Min max problems; Stochastic search method; Sum of ratios problems

Indexed keywords

BOOLEAN FUNCTIONS; ELECTROMAGNETISM; LEARNING ALGORITHMS; NUCLEAR PROPULSION; STOCHASTIC PROGRAMMING;

BRANCH AND BOUND METHOD (BB); BUSINESS MEDIA; ELECTROMAGNETIC FORCE (EMF); FRACTIONAL PROGRAMMING; IMAGE SPACE; NEW APPROACHES; NP COMPLETE PROBLEMS; NUMERICAL EXPERIMENTS; STOCHASTIC SEARCH ALGORITHMS; SUM OF RATIOS PROBLEM;

BRANCH AND BOUND METHOD;

EID: 48549098437     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-008-9285-y     Document Type: Article

References (24)

1. Almogy Y., Levin O.: A class of fractional programming problems. Oper. Res. 19, 57-67 (1971)
2. Avriel, M., Diewert, W.E., Schaible, S., Zang, I.: Generalized Concavity. Plenum Press (1988)
3. Barros A.I., Frenk J.B.G., Schaible S., Zhang S.: A new algorithm for generalized fractional programs. Math. Program. 72, 147-175 (1996)
4. Benson H.P.: Global optimization of nonlinear sums of ratios. J. Math. Anal. Appl. 263, 301-315 (2001)
5. Benson H.P.: Global optimization algorithm for the nonlinear sum of ratios problem. J. Optim. Theor. Appl. 112, 1-29 (2002)
6. Benson H.P.: Using concave envelopes to globally solve the nonlinear sum of ratios problems. J. Glob. Optim. 22, 343-364 (2002)
7. Benson H.P.: On the global optimization of sums of linear fractional functions over a convex set. J. Optim. Theor. Appl. 121, 19-39 (2004)
8. Birbil Ş.İ., Fang S.C.: An electromagnetism-like mechanism for global optimization. J. Glob. Optim. 25, 263-282 (2003)
9. Birbil Ş.İ., Fang S.C., Sheu R.L.: On the convergence of a population-based global optimization algorithm. J. Glob. Optim. 30, 301-318 (2004)
10. Cambini A., Martein L., Schaible S.: On maximizing a sum of ratios. J. Inform. Optim. Sci. 10, 65-79 (1989)
11. Frenk J.B.G., Schaible S.: Fractional programming. In: Floudas, C.A., Pardalos, P.M. (eds) Encyclopedia of Optimization, vol. II, pp. 162-172. Kluwer Publishers, Dordrecht (1989)
12. Freund R.W., Jarre F.: Solving the sum-of-ratios problem by an interior-point method. J. Glob. Optim. 19, 83-102 (2001)
13. Ibaraki T.: Parametric approaches to fractional programs. Math. Program. 26, 345-362 (1983)
14. Ingber L.: Simulated annealing: practice versus theory. Math. Comput. Modell. 18, 29-57 (1993)
15. Konno H., Abe N.: Minimization of the sum of three linear fractional functions. J. Glob. Optim. 15, 419-432 (1999)
16. Konno H., Fukaishi K.: A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems. J. Glob. Optim. 18, 283-299 (2000)
17. Konno H., Inori M.: Bond portfolio optimization by bilinear fractional programming. J. Oper. Res. Soc. Jpn. 32, 143-158 (1989)
18. Kuno T.: A branch-and-bound algorithm for maximizing the sum of several linear ratios. J. Glob. Optim. 22, 155-174 (2002)
19. Kuno T., Yajima Y., Konno H.: An outer approximation method for minimizing the product of several convex functions on a convex set. J. Glob. Optim. 3, 325-335 (1993)
20. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag xvi+340 (1994)
21. Phuong N.T.H., Tuy H.: A unified monotonic approach to generalized linear fractional programming. J. Glob. Optim. 26, 229-259 (2003)
22. Rinnooy-Kan A.H.G., Timmer G.T.: Stochastic global optimization methods. II. Multilevel methods. Math. Program. 39, 57-78 (1987)
23. Schaible S.: Recent results in fractional programming. Oper. Res. Verfahren 23, 271-272 (1977)
24. Wood G.R.: Multidimensional bisection applied to global optimisation. Comput. Math. Appl. 21, 161-172 (1991)