Open Access
2014 A Global Optimization Algorithm for Signomial Geometric Programming Problem
Xue-Ping Hou, Pei-Ping Shen, Yong-Qiang Chen
Abstr. Appl. Anal. 2014(SI43): 1-12 (2014). DOI: 10.1155/2014/163263


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.


Download Citation

Xue-Ping Hou. Pei-Ping Shen. Yong-Qiang Chen. "A Global Optimization Algorithm for Signomial Geometric Programming Problem." Abstr. Appl. Anal. 2014 (SI43) 1 - 12, 2014.


Published: 2014
First available in Project Euclid: 2 October 2014

zbMATH: 07021841
MathSciNet: MR3193489
Digital Object Identifier: 10.1155/2014/163263

Rights: Copyright © 2014 Hindawi

Vol.2014 • No. SI43 • 2014
Back to Top