| 随机运输问题的对偶森林迭代算法 |
| |
| 引用本文： | 祁力群,涂晓鸣.随机运输问题的对偶森林迭代算法[J].清华大学学报(自然科学版),1988(3). |
| |
| 作者姓名： | 祁力群 涂晓鸣 |
| |
| 作者单位： | 应用数学系
(祁力群),应用数学系(涂晓鸣) |
| |
| 摘 要： | 本算法从一个对偶森林向另一个对偶森林迭代。在非退化的情况下,每步迭代都使对 偶目标函数值严格增加,并在有限步内达到最优值,每步迭代最多只需解一个一维非线 性方程。在“宇宙６８０００”机上,对此算法进行了两个包括６００个以上变量的大型问题计 算,计算结果表明算法是可行有效的。
|
| 关 键 词： | 对偶森林 分裂 交换 连接 |
Dual Forest Iteration Method for the Stochastic Transportation Problem |
| |
| Qi Liqun, Tu Xiaoming.Dual Forest Iteration Method for the Stochastic Transportation Problem[J].Journal of Tsinghua University(Science and Technology),1988(3). |
| |
| Authors: | Qi Liqun Tu Xiaoming |
| |
| Institution: | Department of Applied Mathematics |
| |
| Abstract: | This paper presents a dual forest iteration algorithm for solving stochastic transportation problems. The algorithm iterates from one dual forest to another with the values of the dual objective function strictly increasing in the nondegenerate case. It converges thus in a finite number of steps. At each step it is necessary to solve at most a one-dimensional monotone equation. Some examples computed on "UNIVERSE-68000" computer are also presented. |
| |
| Keywords: | dual forest splitting pivoting connecting |
| 本文献已被 CNKI 等数据库收录！ |
