摘要
本文对线性规划中的对偶单纯形法和运输问题中的表上作业法中选取出基变量或者入基变量的准则进行改进,给出一种新的换基准则,按该方法进行优化运算,可以使这两种算法的迭代次数减到最少,从而加快运算速度.尤其适合于大系统线性规划问题的求解.
This arcticle is supposed to display a new principle of basis substitution by improving the principle of how to select out-of-basis and in-basis variables from dual simplex metod and operation of transportation problem on table method. On this principle we can do optimum calculating and minimize the repeat substitution times in these two methods and quicken the speed of calculating. This principle is especially helpful for the solutions to problems of large-scale linear programming.
出处
《系统工程》
CSCD
1998年第3期21-24,共4页
Systems Engineering
关键词
运输问题
换基准则
线性规划
算法
Dual Simplex Mthod, Transportation, linear programming