摘要
本文提出了一种新的优化方法──约束正定式几何规划迭代法。当约束正定式几何规划问题因目标函数项数较多而引起困难度很大时，用迭代法求解比用其它优化方法更为简便，而且易学易懂，便于掌握。
A new optimization method──the iteration of geometric programming with constrainedpositive definite function──is proposed. When a problem of geometric programming with constrainedpositive definite functionhs many terms in the objective function,difficuity arises.Solution of the problemby the proposed iteration method is simpier than other methods. The method is also easy to understand and to grasp.
