应用数学2013，Vol.26Issue(2)：355-359,5.
线性分式规划问题的多项式时间近似算法
A Polynomial Time Approximation Algorithm for Linear Fractional Programs
摘要
Abstract
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.关键词
线性比式和/全局优化/多项式时间近似算法/计算复杂性Key words
Sum of linear ratio / Global optimization/ Polynomial time approximation algorithm/Computational complexity分类
数理科学引用本文复制引用
申培萍,赵小科..线性分式规划问题的多项式时间近似算法[J].应用数学,2013,26(2):355-359,5.基金项目
国家自然科学基金(11171094) （11171094）
