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 |
-
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, J.B.G., (2005)
-
Efficient convexification strategy for generalized geometric programming problems
Lu, Hao-Chun, (2019)
- More ...
-
Robust canonical duality theory for solving nonconvex programming problems under data uncertainty
Shen, Linsong, (2016)
-
The study on the operating efficiency of rural banks based on DEA model : a case of Jiangsu Province
Xu, Lingjuan, (2017)
-
A graph multi-attention network for predicting airport delays
Zheng, Hongfeng, (2024)
- More ...