Journal
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
Volume 44, Issue 1, Pages 139-158Publisher
SPRINGER
DOI: 10.1007/s10589-007-9148-3
Keywords
Generalized Geometric Programming; Degree of difficulty; Decomposition method
Funding
- National Natural Science Foundation of China [10601030]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available