A concise way of determination for LP initial feasible basis of simplex method

摘要

The initial feasible basis is a elementary concept in simplex method of solving linear programming problem. The big M method and the two-phases way are usually adopted to construct a unit matrix as a initial basis. But, these schemes often make one confusion in thinking clue and complication in calculation. Aim at this point, we establish the association between the elementary transformation of matrix and the concept of initial feasible basis, a determination way for initial feasible basis of linear programming is presented here. The presented scheme is concisely, convenience and making the solving procedure clearly in practice.Some examples are given to demonstrate these characteristics in this paper.