摘要
对没有现成可行基的线性规划问题,目前都采用传统的引进辅助规划问题的方法求解。笔者对这种传统方法进行了功能分析,指出了它的不足之处,给出了一种新的简单解法——初等变换法。
People solve linear programming problem without ready-made feasible basis often adopting traditional method by introducing an auxiliary programming problem. In this paper, the authors point out deficiency of the above traditional method by functional analysis and give a new kind of simple Solution——method of elementary transformation.
关键词
初等变换
单纯形法
线性规划
simplicial method
feasible basis
iteration of changing basis
elementary transformation
objective function
optimum solution
linear programming
