Results 281 to 290 of about 69,882 (311)
Some of the next articles are maybe not open access.
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
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
Markov Renewal Programming by Linear Fractional Programming
SIAM Journal on Applied Mathematics, 1966Markov 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
Parametric Analysis in Linear Fractional Programming
Operations Research, 1986We 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
Programming with linear fractional functionals
Naval Research Logistics Quarterly, 1968AbstractCharnes 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
Extreme point linear fractional functional programming
Zeitschrift für Operations Research, 1974This paper deals with the optimization of the ratio of two linear functions subject to a set of linear constraints with the additional restriction that the optimal solution is to be an extreme point of another convex polyhedron. In this paper, an enumerative procedure for solving such type of problems is developed.
Puri, M. C., Swarup, K.
openaire +2 more sources
Multicriteria linear fractional programming
1981The 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
Hesitant Fuzzy Linear Fractional Programming Problem
2021In last decade hesitant fuzzy theory introduced as an extension of fuzzy theory which is a powerful tool in situations that we have hesitations in recognizing the imprecise membership degree of the elements of a set. There are not many studies on hesitant fuzzy linear fractional programming (HFLFP) problems; thus in this study we investigate this kind ...
Madineh Farnam, Majid Darehmiraki
openaire +1 more source
On Minimax General Linear Fractional Programming
2009 International Conference on Information Engineering and Computer Science, 2009In this paper a global optimization algorithm is proposed for solving minimax linear fractional programming problem (P). By utilizing equivalent problem ƒ Q ≈ and linearization technique, the relaxation linear programming (RLP) about the (Q) is established.
Qigao Feng +3 more
openaire +1 more source