摘要
在线性规划初始可行基的寻求中,根据线性代数的理论和算法,从约束方程组的增广矩阵出发,采用直接对其进行初等行变换和换基迭代的方法,求得初始可行基,省去人工变量,减少存储单元,便于编制程序和计算。
The method,by increasing the amount of artificial variable and constructing the artificial base,is commonly used to achieve the solution of initial feasible base in linear programming.This paper adopts a new method that proceeds from the augmented matrix of bounded equation group and achieves the initial feasible base directly.This method,which omits artificial variables and reduces storage units,has clear superiorities over the method of artificial base for some questions.
关键词
基
可行基
单纯形表
线性规划
base
feasible baser canonical expression
simplex tableau
