linear fractional programming

基本解释

Based on the convex simplex method for nonlinear programming, a sensitivity analysis of linear fractional programming is presented.
基于解非线性规划的凸单纯形法，对线性分式规划进行灵敏度分析。
Finally, numerical experiments are made and the results show that the proposed algorithms in this paper for a class of linear fractional programming problem are very effective.
最后，通过数值实验表明，本文提出的算法对该类线性分式双层规划问题比较有效。
In this paper, the authors present an algorithm to handle linear fractional programming in the general form directly, which need not transform the constraints of the problem into the standard form.
本文提出一个直接处理一般形式线性分式规划的算法而不需要把问题的约束条件转化为标准形式。