Results 271 to 280 of about 6,627 (303)
Some of the next articles are maybe not open access.

Programming with linear fractional functionals

Naval Research Logistics Quarterly, 1968
AbstractCharnes and Cooper [1] showed that a linear programming problem with a linear fractional objective function could be solved by solving at most two ordinary linear programming problems. In addition, they showed that where it is known a priori that the denominator of the objective function has a unique sign in the feasible region, only one ...
openaire   +1 more source

On the Bilevel Integer Linear Fractional Programming Problem

OPSEARCH, 2001
The bilevel programming problem is a leader follower game in which two players try to maximize their own objective function over a common feasible region. In this paper we consider the bilevel programming problem in which both the objective functions are linear fractional and the variables take non-negative integral values.
Alemayehu, Getinet, Arora, S. R.
openaire   +1 more source

A Decomposition Method for Interval Linear Fractional Programming

ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1976
AbstractThe aim of the paper is to obtain a decomposition principle for maximizing a ratio of two linear functions subject to constraints in the ‘interval programming’ form. At each step of the method, two or more linear interval programming problems are to be solved, the optimal solutions of which are written explicitely with the help of Ben‐Israel ‘s
Lata, Manju, Mittal, B. S.
openaire   +2 more sources

An Algorithm for Linear Fractional Functionals Programming Problems

ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1977
AbstractIn this paper an algorithm is given for solving linear fractional functionals programming problems. This method permits to replace in each iteration several basic variables by an equal number of non‐basic ones so as to obtain a new basic feasible solution with the new value of the objective function which is, at least, as good as the old one ...
Rani, Oma, Shivpuri, Saroj
openaire   +1 more source

Ranking in integer linear fractional programming problems

ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research, 1990
An algorithm is developed which ranks the feasible solutions of an integer fractional programming problem in decreasing order of the objective function values.
Vanita Verma, H. C. Bakhshi, M. C. Puri
openaire   +1 more source

Dual of the sum of a linear and linear fractional program

European Journal of Operational Research, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Multicriteria linear fractional programming

2010
The object of this thesis is to study the multi-criteria linear fractional programming problems (MLFP). The characterizations of efficiency, weak efficiency and proper efficiency are derived. In the bicriteria case, the set E of all efficient solutions of (MLFP) is path-connected by a finite number of line segments and the efficient frontier F(E) can ...
openaire   +1 more source

Two-Level Linear Relaxation Method for Generalized Linear Fractional Programming

Journal of the Operations Research Society of China, 2022
Hongwei Jiao, Shang You-Lin
exaly  

Home - About - Disclaimer - Privacy