约束正定式几何规划的一种多项式时间算法  

A Polynomial Time Algorithm in Positive Define Geometric Programming with Constraints

作　　者：景书杰[1] 毕小山[1] 张可村[2] 

机构地区：[1]焦作工学院基础部,河南454159 [2]西安交通大学理学院,西安710049

出　　处：《工程数学学报》2002年第2期75-80,102,共7页Chinese Journal of Engineering Mathematics

基　　金：河南省教委自然科学基金资助项目

摘　　要：利用了几何规划的特点 ,借助于对偶及矩阵分析的理论为约束正定式几何规划构造了一种内点算法 ,并证明了算法具有多项式时间收敛性 ,从而推广了张可村等 (1995 )文的结果。Give an interior-point algorithm for positire define geometric programming with constraints by using the characteristics of geometric programming duality principle and matrix analysis principle, and prove the algovithm has a polynomial time convergence. The algorithm is a primaldual path following interior-point algorithm for the duality programming of the geometric programming. Therefore the result of Zhang Ke-cun et al (1995) is generalized.

关 键 词：约束几何规划 多项式时间算法 对偶理论 凸规划 

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