We review some recent developments in single-ratio and generalized fractional
programming. In the latter case we focus on the maximization of the smallest of several …

One of the most difficult fractional programs encountered so far is the sum-of-ratios problem.
Contrary to earlier expectations it is much more removed from convex programming than …

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

In this article, the problem of joint relay assignment and energy‐efficiency maximization (J‐
RA‐EE‐MAX) in energy‐harvesting downlink (DL) and uplink (UL) clustered nonorthogonal …

This paper is concerned with a problem of maximizing the sum of several ratios of functions.
We extend an algorithm, which has been designed to solve the sum-of-linear-ratios problem …

The following problem is considered in this paper: max_ x ∈ d {Σ^ m_ j= 1 g_j (x)| h_j (x)\},\,
where\, g_j (x) ≧ 0\, and\, h_j (x)> 0, j= 1, ..., m, are dc (difference of convex) functions over a …

In this paper we establish some approximation versions of the classical Dinkelbach
algorithm for nonlinear fractional optimization problems in Banach spaces. We start by …

This monograph is aimed at presenting a smooth and unified transition from the general
fractional programming (or program) to the semi-infinite fractional programming (or …

In this paper, we extend the Dinkelbach-type algorithm of Crouzeix, Ferland, and Schaible to
solve minmax fractional programs with infinitely many ratios. Parallel to the case with finitely …

The paper deals with fractional optimization problems where the objective function (ratio of
two functions) is defined on a Cartesian product of two real normed spaces X and Y. Within …