仅用一个人工变量求线性规划初始可行基

Using a Single Artificial Varible for a Primal Feasible Basis of a Linear Programming

对单纯形法与对偶单纯形法及其思想结合运用，针对约束条件全为不等式的线性规划问题，探索出一种特殊解法．从线性规划问题的任一个初始基出发，最多引入一个人工变量，即可求出问题的初始可行基。

By applying the idea of combining simplex algorithm and dual simplex algorithm, the au thor improved the fashion of importation artificial veariables in the two -phase method. This paper proposes a new method which uses a single artificial variable for a primal feasible basis of a linear programming, thus to save the computation time and storage capacity of computer effectively.