摘要
本文提出并证明了求解线性规划 (L P)的单纯形法中检验数 (σj)的迭代计算方法的定理。由此定理得到的迭代计算方法比传统的按定义式计算法的渐近时间复杂度降了一级 ,同时简化了计算过程并提高了计算效率。
This paper raises and verifies a theorem iteratively calculating check digit (σ j) in simplex method solving linear programming(LP). Asymptotic time complexity of this new algorithm from that theorem is reduced one degree than traditionally calculating method in definite formulation. Meanwhile, this new algorithm not only simplifies calculating process but also raises calculating efficiency.
出处
《运筹与管理》
CSCD
2001年第2期71-74,共4页
Operations Research and Management Science
关键词
线性规划
单纯形法
检验数
迭代
渐近时间复杂度
linear programming
simplex method
check digit
iteration
asymptotic time complexity
