首页> 外文期刊>Open Journal of Optimization >A New Approach of Solving Linear Fractional Programming Problem (LFP) by Using Computer Algorithm
【24h】

A New Approach of Solving Linear Fractional Programming Problem (LFP) by Using Computer Algorithm

机译:用计算机算法求解线性分数阶规划问题的新方法

获取原文
           

摘要

In this paper, we study a new approach for solving linear fractional programming problem (LFP) by converting it into a single Linear Programming (LP) Problem, which can be solved by using any type of linear fractional programming technique. In the objective function of an LFP, if β is negative, the available methods are failed to solve, while our proposed method is capable of solving such problems. In the present paper, we propose a new method and develop FORTRAN programs to solve the problem. The optimal LFP solution procedure is illustrated with numerical examples and also by a computer program. We also compare our method with other available methods for solving LFP problems. Our proposed method of linear fractional programming (LFP) problem is very simple and easy to understand and apply.
机译:在本文中,我们研究了一种将线性分数规划问题(LFP)转换为单个线性规划(LP)问题的新方法,可以使用任何类型的线性分数规划技术来解决该问题。在LFP的目标函数中,如果β为负,则可用的方法无法解决,而我们提出的方法能够解决此类问题。在本文中,我们提出了一种新方法并开发了FORTRAN程序来解决该问题。最佳的LFP解决方案过程将通过数值示例和计算机程序进行说明。我们还将我们的方法与其他解决LFP问题的方法进行了比较。我们提出的线性分数规划(LFP)问题的方法非常简单,易于理解和应用。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号