摘要
线性规划的单纯形法一直是运筹学教学中的难点,是求解线性规划的一种重要方法.通过实例从代数角度探讨了单纯形法的迭代思想,提出了用单纯形矩阵求解线性规划的方法.同传统的单纯形表计算比较而言,此方法操作简单,不易出错,为线性规划的求解提供了一种行之有效的方法。
Simplex method is always a difficult point in teaching operational research and an important approach for solving linear programming. This paper investigates the iterative idea of simplex method by illustrating an example from algebraic point, and introduces the method of solving linear programming by simplex matrix. Compared with the calculation of traditional simplex table, the method is simple to operate and does seldom make mistakes. It is an effective method for solving linear programming.
出处
《数学的实践与认识》
CSCD
北大核心
2013年第17期274-279,共6页
Mathematics in Practice and Theory
基金
北京市属高校人才强教计划项目(201106206)
北京市自然科学基金项目(1122013)
北京市优秀人才培养资助(2012D005003000004)
北京工商大学青年教师科研启动基金(QNJJ2012-26)
北京市大学生科学研究与创业行动计划项目(PXM2012014213000067)
关键词
线性规划
单纯形法
代数求解法
单纯形矩阵
linear programming
simplex method
algebraic method of solving
simplexmatrix
