This article presents a practicable algorithm for globally solving sum of linear ratios problem
(SLR). The algorithm works by globally solving a bilinear programming problem (EQ) that is …

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 paper, a global optimization algorithm is proposed for solving sum of generalized
polynomial ratios problem (P) which arises in various practical problems. Due to its intrinsic …

This paper suggests an iterative parametric approach for solving multiobjective linear
fractional programming (MOLFP) problems which only uses linear programming to obtain …

The quadratic sum-of-ratios fractional program problem has a broad range of applications in
practical problems. This article will present an efficient branch-and-bound algorithm for …

In this paper we present a technique to compute the maximum of a weighted sum of the
objective functions in multiple objective linear fractional programming (MOLFP). The basic …

In this paper, we present a range division and compression algorithm for effectively solving
quadratically constrained sum of quadratic ratios problem. In this algorithm, a novel linear …

Applications of generalized linear multiplicative programming problems (LMP) can be
frequently found in various areas of engineering practice and management science. In this …

A global optimization algorithm is presented for maximizing the sum of difference of convex
functions ratios problem over nonconvex feasible region. This algorithm is based on branch …

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 …