Results 211 to 220 of about 5,342 (265)

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

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

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

Solving linear fractional bilevel programs

Operations Research Letters, 2004
The authors give a geometrical characterization of the optimal solution to the linear fractional bilevel programming (LFBP) problem in terms of what is called a boundary feasible extreme point. It is assumed that the second level optimal solution sets are singletons. The results extend the characterization proved by \textit{Y. H. Liu} and \textit{S. M.
Herminia I. Calvete, Carmen Galé
openaire   +2 more sources

Parametric Analysis in Linear Fractional Programming

Operations Research, 1986
We consider the parametric analysis for a linear fractional programming problem with a scalar parameter in the right-hand side of the restrictions. A method we develop determines the optimal value of the objective function as well as the optimal solution of the parametric problem.
openaire   +2 more sources

Multiple Objective Linear Fractional Programming

Management Science, 1981
This paper presents a simplex-based solution procedure for the multiple objective linear fractional programming problem. By (1) departing slightly from the traditional notion of efficiency and (2) augmenting the feasible region as in goal programming, the solution procedure solves for all weakly efficient vertices of the augmented feasible region. The
Jonathan S. H. Kornbluth, Ralph E. Steuer   +1 more
openaire   +1 more source