Results 251 to 260 of about 6,627 (303)

Algorithmic Equivalence in Linear Fractional Programming

Management Science, 1968
This paper demonstrates the equivalence of several published algorithms for solving the so-called linear fractional programming problem.
Harvey M. Wagner, John S. C. Yuan
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

A note on ‘bilevel linear fractional programming problem’

European Journal of Operational Research, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Herminia I Calvete, Carmen Gale
exaly   +2 more sources

A new linearization technique for minimax linear fractional programming

International Journal of Computer Mathematics, 2014
This paper presents a deterministic global optimization algorithm for solving minimax linear fractional programming (MLFP). In this algorithm, a new linearization technique is proposed, which uses more information of the objective function of the (MLFP) than other techniques.
Hongwei Jiao, Sanyang Liu
exaly   +2 more sources

A Linearization to the Multi-objective Linear Plus Linear Fractional Program

Operations Research Forum, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mojtaba Borza, Azmin Sham Rambely, Seyed Ahmad Edalatpanah   +2 more
openaire   +1 more source

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

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

The bilevel linear/linear fractional programming problem

European Journal of Operational Research, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Herminia I. Calvete, Carmen Galé
openaire   +1 more source

Partial linearization for generalized fractional programming

Zeitschrift für Operations Research, 1988
The authors consider the following generalized fractional program: \[ (P)\quad_{x\in X}\{_{1\leq i\leq p}\{\frac{f_ i(x)}{g_ i(x)}\}\}, \] where \(X\subset R^ n\) is nonempty, \(f_ i\), \(g_ i\) are real continuous functions on an open set \(\Omega \subset R^ n\) including the closure of X, and \(g_ i\) are positive on \(\Omega\).
Youssef Benadada, Jacques A. Ferland
openaire   +1 more source

Connectedness in Multiple Linear Fractional Programming

Management Science, 1983
The geometric properties of the sets of efficient and weakly efficient solutions of multiple linear fractional programming problems are investigated. Weakly efficient solutions are path-connected by finitely many linear line segments when the constrained region is compact.
E. U. Choo, D. R. Atkins
openaire   +1 more source

Taylor series approach to fuzzy multiobjective linear fractional programming

Information Sciences, 2008
This paper presents the use of a Taylor series for fuzzy multiobjective linear fractional programming problems (FMOLFP). The Taylor series is a series expansion that a representation of a function.
Toksari, Mehmet Duran
exaly   +2 more sources