Results 261 to 270 of about 437,555 (335)
Some of the next articles are maybe not open access.
An iterative algorithm to solve a linear fractional programming problem
Computers & industrial engineering, 2020This paper presents a novel iterative algorithm, based on the e , δ -definition of continuity, for a linear fractional programming (LFP) problem. Since the objective function is continuous at every point of the feasible region, we construct an iterative ...
B. Ozkok
semanticscholar +1 more source
, 2020
In this paper, an algorithm is presented to solve fuzzy multi-objective linear fractional programming (FMOLFP) problems through an approach based on superiority and inferiority measures method (SIMM). In the model for the proposed approach, each of fuzzy
Gaiqiang Yang +3 more
semanticscholar +1 more source
In this paper, an algorithm is presented to solve fuzzy multi-objective linear fractional programming (FMOLFP) problems through an approach based on superiority and inferiority measures method (SIMM). In the model for the proposed approach, each of fuzzy
Gaiqiang Yang +3 more
semanticscholar +1 more source
Bicriteria linear fractional programming
Journal of Optimization Theory and Applications, 1982As 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, 1983The 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
Extension of Tikhonov regularization method using linear fractional programming
Journal of Computational and Applied Mathematics, 2020This paper presents an extended form of the Tikhonov regularization method. This method is obtained by adding some parameters to the Tikhonov regularization method.
Somaieh Mohammady, M. Eslahchi
semanticscholar +1 more source
Linear Fractional and Bicriteria Linear Fractional Programs
1990In 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
Equivalence in linear fractional programming
Optimization, 1992In 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
Algorithmic Equivalence in Linear Fractional Programming
Management Science, 1968This 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
Journal of Cleaner Production, 2019
In this study, a framework of a bi-level multi-objective linear fractional programming (BMLFP) approach is developed for the optimization of water consumption structure based on water shortage risk.
Youzhi Wang +4 more
semanticscholar +1 more source
In this study, a framework of a bi-level multi-objective linear fractional programming (BMLFP) approach is developed for the optimization of water consumption structure based on water shortage risk.
Youzhi Wang +4 more
semanticscholar +1 more source
Linear fractional programming and duality
Central European Journal of Operations Research, 2007This 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

