A New Approach for Solving Linear Fractional Programming Problems with Duality Concept  

作　　者：Farhana Ahmed Simi Md. Shahjalal Talukder 

机构地区：[1]Department of Mathematics, Dhaka University, Dhaka, Bangladesh [2]Department of Natural Sciences, Daffodil International University, Dhaka, Bangladesh

出　　处：《Open Journal of Optimization》2017年第1期1-10,共10页最优化（英文）

摘　　要：Most of the current methods for solving linear fractional programming (LFP) problems depend on the simplex type method. In this paper, we present a new approach for solving linear fractional programming problem in which the objective function is a linear fractional function, while constraint functions are in the form of linear inequalities. This approach does not depend on the simplex type method. Here first we transform this LFP problem into linear programming (LP) problem and hence solve this problem algebraically using the concept of duality. Two simple examples to illustrate our algorithm are given. And also we compare this approach with other available methods for solving LFP problems.Most of the current methods for solving linear fractional programming (LFP) problems depend on the simplex type method. In this paper, we present a new approach for solving linear fractional programming problem in which the objective function is a linear fractional function, while constraint functions are in the form of linear inequalities. This approach does not depend on the simplex type method. Here first we transform this LFP problem into linear programming (LP) problem and hence solve this problem algebraically using the concept of duality. Two simple examples to illustrate our algorithm are given. And also we compare this approach with other available methods for solving LFP problems.

关 键 词：LINEAR FRACTIONAL PROGRAMMING LINEAR PROGRAMMING DUALITY 

分 类 号：O1[理学—数学]