Results 231 to 240 of about 84,498 (293)

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

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

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

Fractional Programming

2006
Single-ratio and multi-ratio fractional programs in applications are often generalized convex programs. We begin with a survey of applications of single-ratio fractional programs, min-max fractional programs and sum-of-ratios fractional programs. Given the limited advances for the latter class of problems, we focus on an analysis of min-max fractional ...
Frenk, J.B.G., Schaible, S.
openaire   +1 more source

Bibliography in fractional programming

Zeitschrift für Operations Research, 1982
A bibliography in fractional programming is provided which contains 551 references. It was attempted to include all publications in this area of nonlinear programming as they have appeared in more than 45 years now.
openaire   +2 more sources

On Nonlinear Fractional Programming

Management Science, 1967
The main purpose of this paper is to delineate an algorithm for fractional programming with nonlinear as well as linear terms in the numerator and denominator. The algorithm presented is based on a theorem by Jagannathan (Jagannathan, R. 1966.
openaire   +1 more source

Algorithms for generalized fractional programming

Mathematical Programming, 1991
For the problem of minimizing the maximum of a finite number of ratios of functions various algorithmic approaches are reviewed, contrasted and their convergence properties and relative computational efficiency are discussed.
Jean-Pierre Crouzeix, Jacques A. Ferland
openaire   +2 more sources

Duality in fractional programming

Unternehmensforschung Operations Research - Recherche Opérationnelle, 1968
In this paper, a dual problem to linear fractional functionals programming i. e. $$\begin{gathered} Maximise Z = \frac{{c'x}}{{d'x}} \hfill \\ subject to Ax = b \hfill \\ x \geqslant 0 \hfill \\ \end{gathered} $$ is formulated. Certain duality theorems regarding the relationship between primal and dual problems are established.
openaire   +1 more source

Symmetric dual fractional programming

Zeitschrift für Operations Research, 1985
A pair of symmetric dual fractional programming problems is formulated and appropriate duality theorems are established.
Suresh Chandra 0001, Bruce Desmond Craven, Bert Mond   +2 more
openaire   +1 more source

A Combined Algorithm for Fractional Programming

Annals of Operations Research, 2001
The problem considered is that of mazimizing the quotient of two d.c. (difference of convex) functions over a convex, compact subset of \(\mathbb{R}^{n}\); the numerator and the denominator are assumed to be nonegative and strictly positive, respectively.
openaire   +2 more sources