A Global Optimization Algorithm for Signomial Geometric Programming Problem

الملخص EN

This paper presents a global optimization algorithm for solving the signomial geometric programming (SGP) problem.

In the algorithm, by the straight forward algebraic manipulation of terms and by utilizing a transformation of variables, the initial nonconvex programming problem (SGP) is first converted into an equivalent monotonic optimization problem and then is reduced to a sequence of linear programming problems, based on the linearizing technique.

To improve the computational efficiency of the algorithm, two range reduction operations are combined in the branch and bound procedure.

The proposed algorithm is convergent to the global minimum of the (SGP) by means of the subsequent solutions of a series of relaxation linear programming problems.

And finally, the numerical results are reported to vindicate the feasibility and effectiveness of the proposed method.