【摘要】 对正项几何规划的多困难度情况提供了一个十分有效的方法．即将困难度为Ｄ的几何规划首先化为Ｄ维线性规划，然后再化为一维探索问题．结果表明，该法十分有效．更多还原

【Abstract】 An efficient method for solving positive coefficient geometric programming withmany degrees of difficulty has been given in this paper. First of all, the geometric Programmingwith D degree of difficulty is transformed into a D-dimcntional linear programming’and then, intoone-dimentional searching problem. The results show that the method is quite efficient.更多还原