本文针对线性比式和分式规划问题,提出一种求其全局最优解的完全多项式时间近似算法,并从理论上证明该算法的收敛性和计算复杂性,数值算例也说明了算法是可行的.
This paper presents a fully polynomial time approximation algorithm for globally solving a linear sum-of-ratios fractional programming problem. The convergence and complexity of the algorithm are proved,and the example show that the algorithm is feasible.