A new dual problem for convex generalized fractional programs with no duality gap is presented and it is shown how this dual problem can be efficiently solved using a parametric approach. The resulting algorithm can be seen as “dual” to the Dinkelbach-type algorithm for generalized fractional programs since it approximates the optimal objective value of the dual (primal) problem from below. Convergence results for this algorithm are derived and an easy condition to achieve superlinear convergence is also established. Moreover, under some additional assumptions the algorithm also recovers at the same time an optimal solution of the primal problem. We also consider a variant of this new algorithm, based on scaling the “dual” parametric function. The numerical results, in case of quadratic-linear ratios and linear constraints, show that the performance of the new algorithm and its scaled version is superior to that of the Dinkelbach-type algorithms. From the computational results it also appears that contrary to the primal approach, the “dual” approach is less influenced by scaling.

Dinkelbach-type algorithms, Karush-Kuhn-Tucker conditions, duality, fractional programming, generalized fractional programming, quasiconvexity
dx.doi.org/10.1007/BF02592087, hdl.handle.net/1765/11635
Mathematical programming
Erasmus School of Economics

Frenk, J.B.G, Barros, A.I, Schaible, S, & Zhang, S. (1996). A new algorithm for generalized fractional programs. Mathematical programming, 72, 147–175. doi:10.1007/BF02592087