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

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

作　　者：吴举林[1] 杜林古[2] 

机构地区：[1]青岛大学数学系 [2]山东纺织工学院

出　　处：《青岛大学学报（工程技术版）》1990年第3期78-81,共4页Journal of Qingdao University(Engineering & Technology Edition)

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

关 键 词：对偶单纯形法 循环 最小下标原则 

分 类 号：TB-55[一般工业技术]