A general algorithm for solving Generalized Geometric Programming with nonpositive degree of difficulty
Year of publication: |
2009
|
---|---|
Authors: | Yanjun, Wang ; Tao, Li ; Zhian, Liang |
Published in: |
Computational Optimization and Applications. - Springer. - Vol. 44.2009, 1, p. 139-158
|
Publisher: |
Springer |
Subject: | Generalized Geometric Programming | Degree of difficulty | Decomposition method |
-
Synthesis and Implementation of a Fixed Low Order Controller on an Electronic System
Ben Hariz, Maher, (2016)
-
A note on the dual of an unconstrained (generalized) geometric programming problem
Frenk, Frenk, J.B.G., (2005)
-
Branch-reduction-bound algorithm for generalized geometric programming
Shen, Peiping, (2013)
- More ...
-
The study on the operating efficiency of rural banks based on DEA model : a case of Jiangsu Province
Xu, Lingjuan, (2017)
-
Robust canonical duality theory for solving nonconvex programming problems under data uncertainty
Shen, Linsong, (2016)
-
Product quality and quantity with responsive pricing
Yu, Yugang, (2021)
- More ...