Linear-fractional optimization • linear-fractional program • generalized linear-fractional program • examples 8–1

In a recent paper[" CHARNES AND COOPER solved a programming problem with linear fractional functionals by resolving it into two linear programming problems. For example, suppose it is required to: maximize R(X) = (c'X+o))/(d'X+f3), subject to AX=b, XO, where (i) X, c, …

Methods of Solving Linear Fractional Programming Problem - an interval approach Yamini Murugan and Nirmala Thamaraiselvan* Abstract—This article demonstrates techniques to solve the linear fractional programming (LFP) problem using an interval approach. This approach addresses uncertainties as intervals and employs interval arithmetic for ...

In this paper, we develop a time scales approach to formulate and solve linear fractional programming problems. This time scales approach unifies the discrete and continuous linear fractional programming models and extends them to other cases “in between”.

In mathematical optimization, linear-fractional programming (LFP) is a generalization of linear programming (LP). Whereas the objective function in a linear program is a linear function, the objective function in a linear-fractional program is a ratio of two linear functions.

LINEAR-FRACTIONAL PROBLEM In 1960, Hungarian mathematician Bela Martos formulated and considered a so-called hyperbolic programming problem, which in the English language special literature is referred as a linear-fractional programming problem. In a typical case the common problem of LFP may be formulated as follows:

INTRODUCTION TO LFP. 1 What is a Linear-Fractional Problem ? 4. THE SIMPLEX METHOD. 5. DUALITY THEORY. 6. SENSITIVITY ANALYSIS. 7. INTERCONNECTION BETWEEN LFP AND LP. 9. SPECIAL LFP PROBLEMS. 10. ADVANCED METHODS AND ALGORITHMS IN LFP. 11. ADVANCED TOPICS IN LFP. 12. COMPUTATIONAL ASPECTS. 13. …

In this paper, an algorithm is developed for solving linear fractional programming problems using graphical method. First, the problem will be converted into single linear programming problem and then it can be solved. The solutions which will be obtained by using this algorithm may be bounded, unbounded or have no solution.

and a duality approach to solve a linear fractional programming problem. Here our aim is to find the integer solution of fractional programming problems (i.e. objective function is the ratio of numerator and denominator of linear functions). For it, we use simplex method and branch and bound method. These methods are very easy to understand and ...

linear fractional programming (LFP) problem is the problem of optimization, i.e., maximization or minimization of a fraction of two linear functions subject to linear constraints. Because of its wide range of applications in real life, LFP is of considerable research and interest.