1Wang Y, Wang X. Second - order method of generalized geometric programming for spatial frame optimization[ J]. Computer Methods in Applied Mechanics and Engineering, 1997,14 ( 1 ) : 117 - 123.
2Shen P, Zhang K. Global optimization of signomial geometric pro- gramming using linear relaxation[ J]. Applied Mathmatics and Com- putation,2004,150( 1 ) :99 - 114.
3Sherali H D,Tuncbilek C H. Comparison of two reformulation- lin- earization technique based linear programming relaxation for polyno- mial programming problems [ J ]. Journal of Global Optimization, 1997,10(4) :381 -390.
7Wang Y, Shen P, Liang Z. A brancb and bound algorithm to global- ly solve the sum of several linear ratios [ J ]. Applied Mathmatics and Computation,2005,168 ( 1 ) :89 - 101.
2Sherali H D, Tuncbilek C H. Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems. Journal of Global Optimization, 1997, 10:381-390
3Sherali H D. Global optimization of nonconvex polynomial programming problems having rational exponents. Journal of Global Optimization, 1998, 12; 267-283
4Maranas C D, Floudas C A. Global optimization in generalized geometric programming. Computers Chemical Engineering, 1997, 21(4): 351-369
5Shen Peiping, Zhang Kecun. Global optimization of signomial geometric programming using linear relaxation. Applied Mathematics and Computation, 2004, 150:99-114
6Ron S Dembo. A set of geometric programming test problems and their solutions. Mathematical programming, 1976, 10:192-213
7Alejandre J L,Allueva A I and Gonzalez J M.A new algorithm for geometric programming based on the linear structure of its dual problem.Mathematical and Computer Modelling,2000,31:61-78.
8Passy U,Wilde D J.Generalized polynomial optimization.Journal on Applied Mathematics,1967,15(5):1344-1356.
9Avriel M,Dembo R,Passy U.Solution of generalized geometric programs.Internat.J.Numer.Methods Engrg.,1975,9:149-169.
10Ecker J G.Geometric programming:Methods,computations and applications.SIAM Review,1980,22(3):338-362.
