| Article ID: | iaor2007941 |
| Country: | Netherlands |
| Volume: | 164 |
| Issue: | 1 |
| Start Page Number: | 117 |
| End Page Number: | 131 |
| Publication Date: | May 2005 |
| Journal: | Applied Mathematics and Computation |
| Authors: | Xu Chengxian, Wang Yanjun, Gao Yuelin, Zhang Lianshen |
| Keywords: | programming: branch and bound |
In this paper a new two-level linear relaxed bound method is proposed for solving the global solution of geometric programming problems, and its convergent properties are proved, and a numerical example is used to illustrate the effectiveness of the presented algorithm. The bound technique in this algorithm is different from the other ones. The two-level relaxed linear programming problems of a geometric programming problems are given without additional new variables and constraints by making use of the linear approximation of power functions and the new formulas for product to be unequal with sum.