摘要
单纯形法是求解线性规划问题的有效方法。本文给出用初等行变换求线性规划问题的初始基本可行解的新方法 ,该方法与传统的方法相比 ,具有计算量小且占用存储空间少的特点 。
Simplex algorithm is an effective method for solving linear programming problem. A new method based on elementary row transformations for seeking initial basic feasible solution of linear programming is presented. Comparing with traditional methods, it has low computation amount and need less memory cells for computing. A example is given and it illustrates that the method is feasible and efficient.
