Results 221 to 230 of about 8,378 (264)

Fractional programming : a recent survey

Journal of Statistics and Management Systems, 2002
Summary: Recent developments in fractional programming are reviewed. We consider single-ratio as well as multi-ratio fractional programs. In the latter case we focus on the maximization of the smallest of several ratios, the maximization of a sum of ratios and multi-objective fractional programs.
openaire   +2 more sources

Duality in nonlinear fractional programming

Zeitschrift für Operations Research, 1973
The purpose of the present paper is to introduce, on the lines similar to that ofWolfe [1961], a dual program to a nonlinear fractional program in which the objective function, being the ratio of a convex function to a strictly positive linear function, is a special type of pseudo-convex function and the constraint set is a convex set constrained by ...
openaire   +2 more sources

Linear Programming with a Fractional Objective Function

Operations Research, 1973
This paper presents an algorithm, based on the simplex routine, that provides a way to solve a problem in which the objective function is not linear, but rather is represented by a ratio of two linear functions. This algorithm has a computational advantage over two previous ones because it requires neither variable transformations nor the introduction
Gabriel R. Bitran, A. G. Novaes
openaire   +1 more source

A note on fractional interval programming

Zeitschrift für Operations Research, 1975
A linear fractional program of the form max (cx+r)/(dx+s) subject toa≤Ax≤b (FIP) is considered, whereA is am ×n matrix with rank(A)=m. By replacing (FIP) by a parametric linear program, in the first part of this paper the existence of an optimal solution of (FIP) is discussed.
openaire   +2 more sources

On the posynomial fractional programming problems

European Journal of Operational Research, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Fractional Programming

Zeitschrift für Operations Research, 1983
Schaible, Siegfried, Ibaraki, Toshihide
openaire   +3 more sources

Fractional programming without differentiability

Mathematical Programming, 1976
The notion of quasi-differentiability is examined and related to fractional programming. Necessary and sufficient conditions are given and various other properties of quasi-differentiable functions are discussed. Differentiability is not assumed.
openaire   +1 more source

On the Supremum in Quadratic Fractional Programming

2001
We consider the maximization of a ratio f of an arbitrary quadratic function and an affine function over a closed and unbounded set. The behavior of unbounded feasible sequences is studied in order to derive a) conditions under which f attains a finite supremum and b) conditions which guarantee that its supremum is finite.
CAMBINI, ALBERTO, CAROSI, LAURA, MARTEIN, LAURA   +2 more
openaire   +1 more source

Parametric approaches to fractional programs

Mathematical Programming, 1983
The fractional program P is defined by maxf(x)/g(x) subject tox∈X. A class of methods for solving P is based on the auxiliary problem Q(λ) with a parameter λ: maxf(x)−λg(x) subject tox∈X. Starting with two classical methods in this class, the Newton method and the binary search method, a number of variations are introduced and compared.
openaire   +2 more sources

Duality for nonlinear fractional programs

Zeitschrift für Operations Research, 1973
This paper develops duality results for nonlinear fractional programming problems. This is accomplished by using some known results connecting the solutions of a nonlinear fractional program with those of a suitably defined parametric convex program.
openaire   +2 more sources