运输问题的直接算法

A Algorithm of Direct Method of Transportation Problem

基于线性规划逐维选优强多项式算法的基本理论,结合运输问题模型的特殊结构,提出了运输问题直接算法:根据目标函数的梯度向量在可行域的低维界面上的投影,通过确定运输问题在可行域上的低维等值界面,直接得出运输问题的最优解集。

The basic theories of Strongly Polynomial Algorithm for the Linear Programming Problem were applied to the Transportation Problem based on its special structure. First,the gradient vector projections of the objective function are computed,then the low-dimensional equivalent plane in the feasible region of Transportation Problem is established,thus the optimal solution set of transportation problem can be found directly.