【摘要】 本文针对广义线性多乘积极小化问题,通过一系列的线性规划问题的解提出一种求其全局最优解的完全多项式时间近似算法,并给出该算法的计算复杂性,且数值算例验证该算法是可行的.更多还原

【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.更多还原