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, J.B.G., (2005)
-
A note on the dual of an unconstrained (generalized) geometric programming problem
Frenk, Frenk, J.B.G., (2005)
- More ...
-
Product quality and quantity with responsive pricing
Yu, Yugang, (2021)
-
Timescales of delay propagation in airport networks
Wang, Yanjun, (2022)
-
Gai, Ling, (2023)
- More ...