针对广义几何规划问题提出了一种确定型的全局优化方法,给出了一种构造目标函数及约束函数下界函数的新方法,从而建立了广义几何规划问题的松弛线性规划.通过对线性规划问题可行域的细分以及一系列的线性规划问题的求解,从理论上证明了该算法全局收敛性,数值实验表明了算法的可行性.
This paper presents a determined global optimization algorithm for generalizaed geometric programming. In this algorithm,a new linear relaxed method for generating the lower bound functions of objective function and constraint function is given,and the relaxation linear programming of generalized geometric programming is established. The proposed branch and bound algorithm is convergent to the global minimum through the successive refinement of the solutions of a series of linear programming problems. Numerical examples illustrate the feasiblity of this algorithm.