Fractional programming - Open Access .click

Optimization Methods and Software, 2003
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 other multi-ratio problems analyzed before. It really should be viewed in the context of global optimization.
Jianming Shi, Siegfried Schaible
exaly +2 more sources

On Fractional Programming

OPSEARCH, 1999
Programming problem with linear constraints and the objective function as the sum of the functions of the form $${f_1}\left( x \right) + \frac{1}{{{g_1}\left( x \right)}}$$ where f1(x) and g1(x) are linear, is reduced to a fractional programming problem.
Sinha, S. M., Tuteja, G. C.
openaire +1 more source

Fractional Programming with Homogeneous Functions

Operations Research, 1974
This paper extends the well known results for linear fractional programming to the class of programming problems involving the ratio of nonlinear functionals subject to nonlinear constraints, where the constraints are homogeneous of degree one and the functionals are homogeneous of degree one to within a constant. Two rather general auxiliary problems
Stephen P. Bradley, Sherwood C. Frey Jr.
openaire +2 more sources

A Class of Fractional Programming Problems

Operations Research, 1971
The paper deals with problems of maximizing a sum of linear or concave-convex fractional functions on closed and bounded polyhedral sets. It shows that, under certain assumptions, problems of this type can be transformed into equivalent ones of maximizing multiparameter linear or concave functions subject to additional feasibility constraints.
Y. Almogy, O. Levin
openaire +1 more source

nonlinear programming
linear programming
duality

mathematics
linear fractional programming
triangular fuzzy number

operations research
goal programming
quantitative methods