几何规划数值方法的新进展

The New Development of Geometric Programming

对既含等式又含不等式约束的几何规划问题，引进了一类新的变量替换，把原规划转化为更为特殊的规划，使之具有更好的分析性质，更易于构造算法．文中不仅给出了算法，而且还给出了算法的收敛性及收敛速度，并用计算实例检验了算法的有效性和可实现性．

The solving method for geometric programming with both equality and inequality constraints is discussed. By using a new class of variable replacement, the old programming problem is transformed into a special one with good analytical property. Apart from the algorithm, the convergency and the convergence rate of the algorithm are also presented. The feasibility and effectiveness of the algorithm are illustrated by a numerical example.