摘要
本文主要是针对线性规划问题的求解方法—单纯形法存在的一些问题,提出了一种改进算法,它与单纯形法的主要区别是主元的选取不同。并将它与单纯形方法的优缺点作一对照分析,并附有实例。实践证明,用该方法求解线性规划问题是一种有效方法。
In this paper, a new calculating approach is proposed on the basis of simplex method for Linear Programming. And the traditional simplex method is brought into side—to side comparision with the proposed approach, illustrated with factual cases Also in this study, factual instances are used to show the use of approach, which is herewith proved to be a practicable and efficiend method to solve Linear programming problems
出处
《西北纺织工学院学报》
1992年第2期40-46,共7页
Journal of Northwest Institute of Textile Science and Technology
关键词
单纯形算法
主元
比较评价
线性规划
Simplex algorithm, pivot element, comparative evaluation