论文信息 - Revisiting Dinkelbach-type algorithms for generalized fractional programs

Revisiting Dinkelbach-type algorithms for generalized fractional programs

In this paper we introduce a new Dinkelbach-type algorithm where the new iterate is determined using the information given by previous iterates and not only by the last one. The new algorithm is compared numerically with previous algorithms for generalized fractional programs.

[1] Jacques A. Ferland,et al. Duality in generalized linear fractional programming , 1983, Math. Program..

[2] Jacques A. Ferland,et al. Convergence of interval-type algorithms for generalized fractional programming , 1989, Math. Program..

[3] M. J. D. Powell,et al. The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation , 1972 .

[4] Jacques A. Ferland,et al. Rate of convergence of a generalization of Newton's method , 1993 .

[5] Jean-Pierre Crouzeix,et al. Convergence of a Dinkelbach-type algorithm in generalized fractional programming , 1987, Z. Oper. Research.

[6] Martin Gugat. Prox-Regularization Methods for Generalized Fractional Programming , 1998 .

[7] Jean-Yves Potvin,et al. Generalized fractional programming: Algorithms and numerical experimentation , 1985 .

[8] Abraham Charnes,et al. Programming with linear fractional functionals , 1962 .

[9] S. Schaible,et al. An algorithm for generalized fractional programs , 1985 .

[10] Jacques A. Ferland,et al. A note on an algorithm for generalized fractional programs , 1986 .

[11] Jacob Flachs,et al. Generalized Cheney-Loeb-Dinkelbach-Type Algorithms , 1985, Math. Oper. Res..

[12] Werner Dinkelbach. On Nonlinear Fractional Programming , 1967 .