几何规划的一种多项式时间算法

A POLYNOMIAL TIME ALGORITHM IN GEOMETRIC PROGRAMMING

利用几何规划的特点，借助于对偶理论，把原始对偶道路跟踪内点算法，推广应用于正定式几何规划，并证明了此算法对于无约束正定式几何规划是一种多项式时间算法，可以预料，这种算法可推广应用于约束几何规划问题。

The original and dual road trace interior point algorithmis generalized and applied topositive definite geometric programming , which makes use of the characteristics of geometricprogramming and duality principle, It is proved that this algorithm is a polynomial time algo-rithm for unconstrained positive definite geometric programming.It is expected that this al-gorithm can be generalized and applied to constrained geometric programming problems。