| 最小费用流的直接优化 |
| |
| 引用本文： | 刘凯.最小费用流的直接优化[J].华中科技大学学报(自然科学版),1997(9). |
| |
| 作者姓名： | 刘凯 |
| |
| 作者单位： | 华中理工大学经济学院 |
| |
| 摘 要： | 研究了广义最小费用流问题，给出并证明了最小费用流的直接优化原理，构造了直接优化算法．数据实例表明，直接优化算法不仅有效而且可以弥补ＯＫＡ（Ｏｕｔ－ｏｆ－ＫｉｌｔｅｒＡｌｇｏｒｉｔｈｍ）算法的缺陷，并能解决网络流规划的其他类型的问题．
|
| 关 键 词： | 最小费用流 选中弧 允许流量 操作矩阵 |
Direct Optimization of the Minimum Cost Flow |
| |
| Liu Kai Assoc. Prof., College of Economics,HUST,Wuhan ,China..Direct Optimization of the Minimum Cost Flow[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,1997(9). |
| |
| Authors: | Liu Kai Assoc Prof College of Economics HUST Wuhan China |
| |
| Institution: | Liu Kai Assoc. Prof., College of Economics,HUST,Wuhan 430074,China. |
| |
| Abstract: | The generalized minimum cost flow is studied. The principle of direct optimization is given and proved, and a direct optimization algorithm is developed. A numerical example shows that an optimal solution can be obtained with only once through calculation by the algorithm. So, it is time saving and is independent of the initial solution as is the case with the Out off Kilter Algorithm. |
| |
| Keywords: | minimum cost flow chosen arc permissible flow operational matrix |
| 本文献已被 CNKI 等数据库收录！ |
