正定式约束下广义几何规划的一种线性化方法  

A New Linearization Method for Posynomial Constrained Generalized Geometric Programming

作　　者：韩学锋 杨本朝[2] 

机构地区：[1]河南理工大学数学与信息科学学院,河南焦作454000 [2]信息工程大学数学工程与先进计算国家重点实验室,河南郑州450000

出　　处：《郑州大学学报（理学版）》2015年第1期24-27,共4页Journal of Zhengzhou University:Natural Science Edition

基　　金：国家自然科学基金资助项目;编号11305048

摘　　要：几何规划是一类具有特殊形式的非线性规划问题,正定式几何规划问题借助于凸规划问题的求解已基本得到解决.但广义几何规划问题作为一种特殊的(DC)规划,至今没有好的求解方法.利用线性化技术,将正定式约束下的一类广义几何规划问题转化为一列凸规划问题进行求解,构造了正定式约束下广义几何规划的一种新算法,并证明了该算法的全局收敛性.Geometric programming was a type of nonlinear programming problem in special form. A posy- nomial geometric programming could be converted to convex programming problem. Therefore, the prob- lem of posynomial geometric programming could be solved just like that of convex program. But general- ized geometric programming was a special DC programming, and its problem was very difficult to solve. And so far, there were not any good methods for this problem. By using linearization technique, posyno- mial ct,nstrained generalized geometric programming was converted to a sequence of convex programming, and a new algorithm was proposed the problem of posynomial constrained generalized geometric program- ming. The proof of global convergence of the proposed algorithm was also given.

关 键 词：广义几何规划 正定式 凸规划 最优解 

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