用最小下标原则避免对偶单纯形迭代的循环

Using the Smallest-Subscript Rules to Avoid Cycling of Iterations of the Dual Simplex

本文提出了用对偶单纯形方法求解线性规划问题时避免循环的最小下标原则,即:(ⅰ)当有几个基变量可以出基时,就选下标最小的那个为换出变量;(ⅱ)当有几个非基变量可以进基时,就选下标最小的那个为换入变量.

This paper proposes the smallest-subscript rules to avoid cycling of iterations during linear programm settlement using the dual simplex method That is(i) When several basic variables may leave the basis, choose that with the smallest subscript,(ii) When several nonbasic variables may enter the basis, choose the one with the smallest subscript.