Linear optimization has been widely used to solve small and large problems in the various areas of economics and man- agement. The simplex algorithm is very effective for solving linear programming problems. This paper performs the analysis of ＂a new simplex pivoting rule＂ and gives the computational steps in detail. Furthermore, a numerical test on some large - scale examples is done to indicate the computational efficiency of the algorithm. It found that the new simplex algorithm is often in iterative number fewer than the classical simplex method, but spends more CPU time.%线性规划广泛应用于经济与管理的各个领域，单纯形法是求解线性规划实际问题非常有效的算法．对“单纯形法选择进出基变元的一个新准则”进行了分析，给出了详细的算法步骤，通过大规模的数值试验进一步揭示了该算法的计算效率．结果表明，这种改进的单纯形算法虽然在大部分问题上的迭代次数比经典的单纯形算法有所减少，但所耗费的计算时间却普遍增加，其计算效率随着问题规模的增大而不断下降．
展开▼
