一个新的求解广义几何规划问题的全局优化方法(英文)  

A New Global Optimization Algorithm for Solving Generalized Geometric Programming

作　　者：张永红[1] 王继霞[1] 申培萍[1] 

机构地区：[1]河南师范大学数学与信息科学学院,河南新乡453007

出　　处：《应用数学》2015年第2期420-430,共11页Mathematica Applicata

基　　金：Supported by the National Natural Science Foundation of China(11171094);the Key Scientific and Technological Project of Henan Province(142102210058);the Doctoral Scientific Research Foundation of Henan Normal University(qd12103);the Youth Science Foundation of Henan Normal University(2013qk02);the Henan Normal University national research project to cultivate the Funded Projects(01016400105);the Henan Normal University Youth Backbone Teacher Training

摘　　要：为求解广义几何规划问题,提出一个新的线性化松弛技巧.在此基础上,给出一个新的分支定界算法.为进一步改进算法,构造一个新的删除技巧,该技巧可被用来提高算法收敛效率.理论上证明了算法的收敛性,数值试验显示本文方法是有效可行的.In this paper,based on a new linearization method,a new branch and bound algorithm for globally solving generalized geometric programming is presented. Furthermore, a new pruning technique is proposed, which can be used to improve the convergence speed of this algorithm. Con- vergence of the algorithm is shown, and some numerical experiments are given to illustrate the feasi- bility and efficiency of the algorithm.

关 键 词：全局优化 广义几何规划 删除技巧 分支定界 线性松弛 

分 类 号：O221[理学—运筹学与控制论]