摘要
讨论了线性规划的单纯形解法,给出了不须加人工变量就可得到一个可行基的算法.通过大量的算例表明此法比传统的单纯形方法具有算法结构简单,计算量小的优点.
The simplex method is discussed in this paper, and an algorithm for achieving an initial feasible basis of a linear programming is obtained without any artificial variables. A large mount of examples demonstrate that this method has an advantage of the simple structure and little effort than traditional method.
出处
《数学的实践与认识》
CSCD
北大核心
2009年第10期136-139,共4页
Mathematics in Practice and Theory
基金
国家自然科学基金(70572069)
关键词
线性规划
单纯形法
可行基
人工变量
the linear programming
the simplex method
the feasible basis
artificial variables
