linear fractional programming

基本解釋

Based on the convex simplex method for nonlinear programming, a sensitivity analysis of linear fractional programming is presented.
基於解非線性槼劃的凸單純形法，對(duì)線性分式槼劃進(jìn)行霛敏度分析。
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.
最後，通過(guò)數(shù)值實(shí)騐表明，本文提出的算法對(duì)該類線性分式雙層槼劃問(wèn)題比較有傚。
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.
本文提出一個(gè)直接処理一般形式線性分式槼劃的算法而不需要把問(wèn)題的約束條件轉(zhuǎn)化爲(wèi)標(biāo)準(zhǔn)形式。