| 带负系数几何规划的一维探索法 |
| |
| 引用本文： | 崔恩第,李来义.带负系数几何规划的一维探索法[J].天津城市建设学院学报,1998,4(4):45-51. |
| |
| 作者姓名： | 崔恩第 李来义 |
| |
| 作者单位： | [1]天津城市建设学院土木工程系副教授 [2]天津城市建设学院土木工程系 |
| |
| 摘 要： | 对带负系数几何规划的多困难度情况提供了一个有效的方法，首先即利用Ｄｕｆｉｎ公式，采用集约缩并法，将带有负系数的几何规划化为正项几何规划，进一步化为Ｄ维线性规划，最后化为一维探索问题．结果表明，该方法十分有效．
|
| 关 键 词： | 负系数，几何规划，对偶规划，对偶变量，线性规划，困难度 |
ONE DIMENSION SEARCH METHOD OF GEOMETRIC PROGRAMMING WITH NEGATIVE COEFFICIENT |
| |
| Cui Endi,Li Laiyi.ONE DIMENSION SEARCH METHOD OF GEOMETRIC PROGRAMMING WITH NEGATIVE COEFFICIENT[J].Journal of Tianjin Institute of Urban Construction,1998,4(4):45-51. |
| |
| Authors: | Cui Endi Li Laiyi |
| |
| Affiliation: | Dept. of Civil Engineering |
| |
| Abstract: | 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. |
| |
| Keywords: | negative coefficient geometric programming dual programming dual variable linear programming degree of difficulty |
| 本文献已被 CNKI 维普 等数据库收录！ |
