Results 241 to 250 of about 84,498 (293)

Linear fractional programming and duality

Central European Journal of Operations Research, 2007
This paper presents a dual of a general linear fractional functionals programming problem. Dual is shown to be a linear programming problem. Along with other duality theorems, complementary slackness theorem is also proved. A simple numerical example illustrates the result.
S. S. Chadha, Veena Chadha
openaire   +1 more source

On nondifferentiable fractional minimax programming

European Journal of Operational Research, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Iqbal Husain, Morgan A. Hanson, Z. Jabeen   +2 more
openaire   +1 more source

Global optimization of fractional programs

Journal of Global Optimization, 1991
Dinkelbach's classical parametric algorithm in fractional programming is modified. A sequence of lower and upper bounds of the optimal value of the ratio is constructed and shown to be superlinearly convergent to the optimal value. Additional results are obtained for linear and quadratic fractional programs.
Panos M. Pardalos, Andrew T. Phillips
openaire   +2 more sources

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

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

Fractional Programming

Zeitschrift für Operations Research, 1983
Schaible, Siegfried, Ibaraki, Toshihide
openaire   +3 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