The solution of optimal lineac programming can be greatly simplified by usingthe continual matrix primary transformation instead of the basis change and iteration in the simplex method.

• 将单纯形方法的换基迭代过程代之以矩阵的初等变换，从而使得线性规划最优解的求解过程大大简化。