A general algorithm for solving Generalized Geometric Programming with nonpositive degree of difficulty

Authors:
Wang Yanjun;Li Tao;Liang Zhian
Affiliations:
Shanghai University of Finance and Economics, Shanghai, China 200433;Shanghai University of Finance and Economics, Shanghai, China 200433;Shanghai University of Finance and Economics, Shanghai, China 200433
Venue:
Computational Optimization and Applications
Year:
2009

Citing 4
Cited 0

Geometric programming based robot control design

ICC&IE '94 Proceedings of the 17th international conference on Computers and industrial engineering
An infeasible interior-point algorithm for solving primal and dual geometric programs

Mathematical Programming: Series A and B - Special issue: interior point methods in theory and practice
A General Alternative Procedure for Solving Negative Degree of Difficulty Problems in Geometric Programming

Computational Optimization and Applications
Global optimization of generalized geometric programming

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

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.