A Decomposition Method For Signomial Geometric Programming
符号几何规划的一种分解方法

In this paper, a direct decomposition method is proposed for signomial geometric programming. Through decomposition and some equivalent transformation a separable programming can be derived whose degree of nonlinearity is very low. And it is important that this method can be used to produce a kind of primal algorithm for signomial geometric programming processing large scale and high degree of difficulty. Specially each separated sub-problem is very easy to solve. Finally numerical examples are given to show the effectiveness of the method.