论文部分内容阅读
该文对求解线性规划一种新的快速算法，称为最好主元法，在计算机上通过了数千个实例的试算表明，迭代次数不超过变量维数与约束个数之和，是一个很有价值的实用算法．
In this paper, a new fast algorithm for solving linear programming is called the best principal component method. The trial calculation of thousands of instances on a computer shows that the number of iterations does not exceed the sum of the number of variables and the number of constraints. A very valuable practical algorithm.