摘要
对带负系数几何规划的多困难度情况提供了一个有效的方法，首先即利用Ｄｕｆｉｎ公式，采用集约缩并法，将带有负系数的几何规划化为正项几何规划，进一步化为Ｄ维线性规划，最后化为一维探索问题．结果表明，该方法十分有效．
A effective method of solving the problem of multi difficulty degree geometric programming with negative coefficient is given in this paper. First of all, using Duffin formula and the intensive reduceing method, the geometric programming with negative coefficient is transformed into a positive coefficient geometric programming, and then, is transformed into a D dimensional linear programming, finally, into one dimensional search problem. The results show that the method is quite effective.
出处
《天津城市建设学院学报》
CAS
1998年第4期45-51,共7页
Journal of Tianjin Institute of Urban Construction
关键词
负系数
几何规划
一维
D维
探索法
线性规划
公式
难度
情况
困难
negative coefficient, geometric programming, dual programming, dual variable, linear programming, degree of difficulty
