|
|||||
|
|
| 广义线性多乘积问题的完全多项式时间近似算法 | |
| 引用本文： | 申培萍,申子慧.广义线性多乘积问题的完全多项式时间近似算法[J].计算数学,2017,39(3):287-294. |
| 作者姓名： | 申培萍 申子慧 |
| 作者单位： | 1. 河南师范大学数学与信息科学学院, 新乡 453007; 2. 商丘工学院基础教学部, 商丘 476000 |
| 基金项目： | 国家自然科学基金（11671122）；河南省高等学校重点科研项目基础研究计划 |
| 摘 要： | 本文针对广义线性多乘积极小化问题,通过一系列的线性规划问题的解提出一种求其全局最优解的完全多项式时间近似算法,并给出该算法的计算复杂性,且数值算例验证该算法是可行的. |
| 关 键 词： | 线性多乘积 全局优化 近似算法 计算复杂性 |
A FULL POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR GENERALIZED LINEAR MULTIPLICATIVE PROBLEMS |
|
| Shen Peiping,Shen Zihui.A FULL POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR GENERALIZED LINEAR MULTIPLICATIVE PROBLEMS[J].Mathematica Numerica Sinica,2017,39(3):287-294. | |
| Authors: | Shen Peiping Shen Zihui |
| Institution: | 1. College of Mathematics and Information Science, Henan Normal University, Xinxiang 453007, China; 2. Department of Basic Education, Shangqiu Institute of Technology, Shangqiu 476000, China |
| Abstract: | In this article we consider the problem of minimizing a class of generalized linear multiplicative function over a polytope and present a fully polynomial time approximation algorithm for globally solving this problem. The computational complexity result of the algorithm is derived, and the numerical examples show that the algorithm is feasible. |
| Keywords: | Linear multiplicative Global optimization Approximation algorithm Computational complexity |
| 本文献已被 CNKI 等数据库收录！ | |
| 点击此处可从《计算数学》浏览原始摘要信息 | |
| 点击此处可从《计算数学》下载免费的PDF全文 | |