Solving fractional problems with dynamic multistart improving hit-and-run

Annals of Operations Research

Volumn 156, Issue 1, 2007, Pages 25-44

  Dür, Mirjam ^a   Khompatraporn, Charoenchai ^b   Zabinsky, Zelda B ^c  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b KING MONGKUT'S UNIVERSITY OF TECHNOLOGY THONBURI   (Thailand)

^c UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Fractional programming; Global optimization; Improving hit and run; Lipschitz properties; Multistart; Pure adaptive search; Stochastic algorithms

Indexed keywords

EID: 34548671919     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-007-0232-y     Document Type: Article

References (20)

1. Benson, H. P. (2002a). Using concave envelopes to globally solve the nonlinear sum of ratios problem. Journal of Global Optimization, 22, 343-367.
2. Benson, H. P. (2002b). Global optimization algorithm for the nonlinear sum of ratios problem. Journal of Optimization Theory and Applications, 112, 1-29.
3. Cambini, A., Martein, L., & Schaible, S. (1989). On maximizing a sum of ratios. Journal of Information and Optimization Science, 10, 65-79.
4. Chadha, S. S. (2002). Fractional programming with absolute-value functions. European Journal of Operational Research, 141, 233-238.
5. Charnes, A., & Cooper, W. W. (1962). Programming with linear fractional functionals. Naval Research Logistics Quarterly, 9, 181-186.
6. Dür, M., Horst, R., & Thoai, N. V. (2001). Solving sum-of-ratios fractional programs using efficient points. Optimization, 49, 447-466.
7. Falk, J. F., & Palocsay, S. W. (1992). Optimizing the sum of linear fractional functions. In C. Floudas & P. M. Pardalos (Eds.), Recent advances in global optimization (pp. 221-258). Princeton: Princeton University Press.
8. Freund, R. W., & Jarre, F. (2001). Solving the sum-of-ratios problem by an interior point method. Journal of Global Optimization, 19, 83-102.
9. Horst, R., Pardalos, P. M., & Thoai, N. V. (2002). Introduction to global optimization (2nd ed.). Dordrecht: Kluwer Academic.
10. Khompatraporn, C. (2004). Analysis and development of stopping criteria for stochastic global optimization algorithms. Ph.D. Dissertation, University of Washington, Seattle, WA.
11. Konno, H., & Abe, N. (1999). Minimization of the sum of three linear fractional functions. Journal of Global Optimization, 15, 419-432.
12. Konno, H., & Kuno, T. (1995). Multiplicative programming problems. In R. Horst & P. M. Pardalos (Eds.), Handbook of global optimization (pp. 369-406). Dordrecht: Kluwer Academic.
13. Kuno, T. (2002). A branch-and-bound algorithm for maximizing the sum of several linear ratios. Journal of Global Optimization, 22, 155-174.
14. Phuong, N. T. H., & Tuy, H. (2003). A unified monotonic approach to generalized linear fractional programming. Journal of Global Optimization, 26, 229-259.
15. Schaible, S. (1995). Fractional programming. In R. Horst & P. M. Pardalos (Eds.), Handbook of global optimization (pp. 495-608). Dordrecht: Kluwer Academic.
16. Schaible, S., & Shi, J. (2003). Fractional programming: the sum-of-ratios case. Optimization Methods and Software, 18, 219-229.
17. Smith, R. L. (1984). Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions. Operations Research, 32, 1296-1308.
18. Zabinsky, Z. B. (2003). Stochastic adaptive search for global optimization. Dordrecht: Kluwer Academic.
19. Zabinsky, Z. B., & Smith, R. L. (1992). Pure adaptive search in global optimization. Mathematical Programming, 53, 232-338.
20. Zabinsky, Z. B., Smith, R. L., McDonald, J. F., Romeijn, H. E., & Kaufman, D. E. (1993). Improving hit-and-run for global optimization. Journal of Global Optimization, 3, 171-192.