A generalized fractional programming problem is specified as a nonlinear program where a
nonlinear function defined as the maximum over several ratios of functions is to be …

An introduction to ratio optimization problems is provided which covers various applications
as well as major theoretical and algorithmic developments. In addition to an extensive …

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 …

In this paper we explore the relations between the standard dual problem of a convex
generalized fractional programming problem and the “partial” dual problem proposed by …

This bibliography of fractional programming is a continuation of three previous
bibliographies by the author (Pure Appl. Math. Sci.(India), Vol. XIII, No. 1-2, 35-69, March …

The purpose of this paper is to introduce and analyze the convergence of a new interval-
type algorithm for generalized fractional programming; This new algorithm has the …

The Newton's method for finding the root of the equation Θ (t)= 0 can be easily generalized
to the case where Θ is monotone, convex, but not differentiable. Then, the convergence is …

Motivation: La méthode de Newton pour trouver le zéro de l'équation g (x)= 0 peut être
facilement généralisée au cas où g est monotone, convexe, mais pas forcément …