整数最小极差运输问题及其算法

Integer Minimal Extreme Difference Transportation Problem and Its Algorithm

建立一个关于均衡运费(时间,距离等)的极差运输问题的线性规划模型,根据对偶规划原理推导出模型最优解的判定定理,解决了求模型最优解的问题,给出求此模型最优解的算法,通过一个实例说明该算法的有效性和实用性。

A balance of freight on the （time,distance,etc.） of the minimal extreme difference transportation problem of the linear programming model is discussed, and based on the principle of dual programming modle is derived to determine the optimal solution theorem, solved the issue of seeking the optimal solution model, thereby, the order to the optimal solution algorithm of the modle is given, and finally an example shows that the algorithm is effective and practical is listed.