| 线性分式多乘积规划问题的完全多项式时间近似算法 |
| |
| 引用本文： | 申子慧,申培萍. 线性分式多乘积规划问题的完全多项式时间近似算法[J]. 计算数学, 2019, 41(2): 212-218. DOI: 10.12286/jssx.2019.2.212 |
| |
| 作者姓名： | 申子慧 申培萍 |
| |
| 作者单位： | 商丘工学院基础教学部,商丘,476000;河南师范大学数学与信息科学学院,新乡,453007 |
| |
| 基金项目： | 国家自然科学基金（11671122）. |
| |
| 摘 要： | 本文针对线性分式多乘积规划问题，通过Charnes-Cooper转化将原问题转化为一个等价问题，借助此等价问题提出一个获得原问题全局近似最优解的算法，最终证明了算法的收敛性，且提供了算法运算时间的理论分析.
|
| 关 键 词： | 线性分式多乘积 全局优化 近似算法 计算复杂性 |
| 收稿时间： | 2018-02-04 |
A FULLY POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR LINEAR FRACTIONAL MULTIPLICATIVE PROGRAMMING PROBLEMS |
| |
| Shen Zihui,Shen Peiping. A FULLY POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR LINEAR FRACTIONAL MULTIPLICATIVE PROGRAMMING PROBLEMS[J]. Mathematica Numerica Sinica, 2019, 41(2): 212-218. DOI: 10.12286/jssx.2019.2.212 |
| |
| Authors: | Shen Zihui Shen Peiping |
| |
| Affiliation: | 1. Department of Basic Education, Shangqiu Institute of Technology, Shangqiu 476000, China;2. College of Mathematics and Information Science, Henan Normal University, Xinxiang 453007, China |
| |
| Abstract: | In this article, an approximation algorithm is developed for a class of linear fractional multiplicative programming problems. The key to the method is converting the original problem to an equivalent problem by introducing the Charnes-Cooper transformation, based on which this algorithm is discussed. It turns out that this algorithm is convergent. Moreover, we provide the theoretical computational time of the algorithm. |
| |
| Keywords: | linear fractional multiplicative global optimization approximation algorithm computational complexity |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算数学》浏览原始摘要信息 |
|
点击此处可从《计算数学》下载全文 |
|
