A global optimization algorithm for solving generalized geometricprogramming (GGP) problem is developed based on a new linearizationtechnique. Furthermore, in order to improve the convergence speed of this algorithm,a new pruning technique is proposed, which can be used to cut away alarge part of the current investigated region in which the global optimal solutiondoes not exist. Convergence of this algorithm is proved, and some experimentsare reported to show the feasibility of the proposed algorithm.
展开▼
