求线性规划初始基可行解的一种直接方法

Direct Method of First Base Feasible Solution to Linear Programming

给出了求解一般线性规划问题的单纯形算法 ,均无需直接引进人工变量 ,即可以得到初始基可行解或判定无可行解的一种直接方法 .

With the simplicial method to solve ordinary problems of linear programming,without the direct introduction of artificial variables,we can obtain a direct method of getting feasible solutions of first base or deciding that there are no feasible solutions.