A general algorithm for solving Generalized Geometric Programming with nonpositive degree of difficulty

A general algorithm for solving Generalized Geometric Programming with nonpositive degree of difficulty
复制标题

求解非正难度广义几何规划的通用算法

DOI:
10.1007/s10589-007-9148-3
复制
发表时间:
2009-10
影响因子:
2.2
通讯作者:
Li Tao
Li Tao
中科院分区:
数学3区
文献类型:
--
作者:
Liang Zhian;Wang Yanjun;Li Tao

文献摘要

参考文献

被引文献

相似文献

本文提出了求解非正困难度广义几何规划问题的一种通用算法。证明了在一定的假设条件下,原始问题可以被分解为几个易于求解的子问题,并进一步证明了通过求解这些子问题可以得到原始问题的最优值和解,即全局解。最后,通过实例验证了本文的结论。
In this paper, a general algorithm for solving Generalized Geometric Programming with nonpositive degree of difficulty is proposed. It shows that under certain assumptions the primal problem can be transformed and decomposed into several subproblems which are easy to solve, and furthermore we verify that through solving these subproblems we can obtain the optimal value and solutions of the primal problem which are global solutions. At last, some examples are given to vindicate our conclusions.
DOI: 10.1016/j.camwa.2004.07.008
发表时间: 2004-11
影响因子: 2.9
作者:
Yanjun Wang;Kecun Zhang;Yuelin Gao
通讯作者: Yanjun Wang;Kecun Zhang;Yuelin Gao
DOI: --
发表时间: 1967-04
期刊: --
影响因子: --
作者:
R. Duffin;E. Peterson;C. Zener
通讯作者: R. Duffin;E. Peterson;C. Zener
DOI: 10.1007/bf00934597
发表时间: 1980
影响因子: 1.9
作者:
T. R. Jefferson;C. Scott
通讯作者: T. R. Jefferson;C. Scott
DOI: 10.1023/b:coap.0000004981.17496.9c
发表时间: 2004
影响因子: 2.2
作者:
J. L. Alejandre;A. Allueva;Jose Miguel Gonzalez
通讯作者: J. L. Alejandre;A. Allueva;Jose Miguel Gonzalez
DOI: 10.1007/978-0-387-74759-0_234
发表时间: 1997-12
期刊: --
影响因子: --
作者:
C. Maranas
通讯作者: C. Maranas