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
中科院分区:
文献类型:
--
作者:
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.
登录
查看更多内容
影响因子:
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
影响因子:
1.9
作者:
T. R. Jefferson;C. Scott
通讯作者:
T. R. Jefferson;C. Scott
影响因子:
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