Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 139-158 |
| Number of pages | 20 |
| Journal | Computational Optimization and Applications |
| Volume | 44 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Oct 2009 |
| Externally published | Yes |
Keywords
- Decomposition method
- Degree of difficulty
- Generalized Geometric Programming