Abstract
We often encounter the optimization problems with variant coefficients or the problem whose structure are same as each other but different only coefficients, and are usually required to solve them quickly. In the present paper we deal with the geometric programming problems with variant coefficients. In geometric programming, if the degree of difficulty of the given problem is 0, the dual problem to the given problem has only one feasible solution i.e. optimal solution excluding coefficients which can be easily obtained by solving a simultaneous linear equation.
So we try to apply the approximate decomposition method for the given problem and decompose it into a set of 0 degree of difficulty subproblems. A equation, whose solution is the approximate optimum of the given problem, can be derived from the optimums of the subproblems. The equation is constructed with the variant coefficients, therefore we can use the equation to obtain an approximate optimum by substituting any values into the coefficients.
Moreover we can easily and quickly solve the equation. At last we check our method to apply some numerical examples and show the usefulness of this method.
