This paper presents a simple approach to working out the basic feasible solution directly in linear programming, which avoids introducing artificial variables, decreases memory, and generally gets a better basic feasible solution at a quicker speed.

• 本文给出直接求线性规划问题基可行解的一种简易方法,该方法既避免了引入人工变量,减少存储,一般又能较快地得到一个较好的基可行解。