Results 241 to 250 of about 69,311 (291)

Bicriteria linear fractional programming

Journal of Optimization Theory and Applications, 1982
As a step toward the investigation of the multicriteria linear fractional program, this paper provides a thorough analysis of the bicriteria case. It is shown that the set of efficient points is a finite union of linearly constrained sets and the efficient frontier is the image of a finite number of connected line segments of efficient points. A simple
Choo, E. U., Atkins, D. R.
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

Linear Fractional and Bicriteria Linear Fractional Programs

1990
In this paper we will restate the sequential methods suggested by the Authors [8] for solving a linear fractional problem for any feasible region using the concept of optimal level solutions.
CAMBINI A., MARTEIN, LAURA
openaire   +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

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   +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.
Calvete, Herminia I., Galé, Carmen
openaire   +1 more source

Equivalence in linear fractional programming

Optimization, 1992
In this paper two algorithms are suggested for solving a linear fractional problem whatever the feasible region is. Such algorithms can be interpreted as a modified version of Martos and Charnes-Cooper algorithms. Successively, it will be shown that the two methods are algorithmically equivalent in the sense that they generate the same finite sequence ...
MARTEIN, LAURA, CAMBINI, ALBERTO
openaire   +2 more sources

Two-Level Linear Relaxation Method for Generalized Linear Fractional Programming

Journal of the Operations Research Society of China, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong-Wei Jiao, You-Lin Shang
openaire   +1 more source

Markov Renewal Programming by Linear Fractional Programming

SIAM Journal on Applied Mathematics, 1966
Markov renewal programming is treated by linear fractional programming. Particular attention is given to the resolution of tied policies that minimize expected cost per unit time. The multichain case is handled by a decomposition approach.
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