Results 211 to 220 of about 8,378 (264)

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

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

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

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

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

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

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

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

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