运输问题中最优调运方案的检验

Verifying of Optimal Scheduling Schema on Transportation Problem

提出了一种关于检验运输问题中最优调运方案的矩阵算法,可以一次性解决所有非基变量的检验数,其优点是既避免了闭回路法中对众多非基变量检验数的逐一计算,又回避了位势法中多次利用求解线性方程组来计算位势的过程.在原方案非最优解时,只需在前一次的检验数矩阵的基础上稍加修正即可完成方案调整后的检验数的计算.

We give a matrix algorithm about verification of potential scheduling schema in transportation problem. The algorithm can solve test number of all nonbasic variable once. It＇s advantage is that we needn＇t to calculate test number of nonbasic variable one by one in closed circuit method or calculate potential by solving linear equation system in potential method. If the original scheme is not the optimal, we can finish the calculation of verification number after modifying scheme on the basis of modification of the last test matrix.