全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
计算数学  2015 

一类广义分式规划问题的完全多项式时间近似算法

, PP. 179-185

Keywords: 分式规划,全局优化,近似算法,计算复杂性

Full-Text   Cite this paper   Add to My Lib

Abstract:

本文对一类广义分式规划问题,提出一种求其全局最优解的完全多项式时间近似算法,给出该算法的理论分析和计算复杂性,通过数值算例验证该算法是有效可行的.

References

[1]  Benson H P. On the global optimization of sums of linear fractional functions over a convex set[J]. Journal of Optimization Theory and Applications, 2004, 121: 19-39.
[2]  Shen P P, Wang C F. Global optimization for sum of generalized fractional functions[J]. Journal of Computational and Applied Mathematics, 2008, 214: 1-12.
[3]  Barros A I, Frenk J B G. Generalized fractional programming and cutting plane algorithms[J]. Journal of Optimization Theory and Applications, 1995, 87: 103-120.
[4]  Konno H, Fukaishi K. A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems[J]. Journal of Global Optimization, 2000, 183: 283-299.
[5]  Schaible S, Ibaraki T. Fractional Programming[J]. European Journal of Operational Research, 1983, 12: 325-338.
[6]  Depetrini D, Locatelli M. Approximation of linear fractional-multiplicative problems[J]. Mathematical Programming, 2011, 128: 437-443.
[7]  Hoai-Phuong Ng T, Tuy H A. A unified monotonic approach to generalized linear fractional programming[J]. Journal of Global optimization, 2003, 26: 229-259.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133