A New Method for Achieving a Basic Feasible Solution of a Linear Programming

A new method for achieving a basic feasible solution of a linear programming is presented in this paper. This new method needs not introducing any artificial variables or auxiliary programming, instead of elimination transformation only. Start from any basic solution (either feasible or regular), through some proper elimination transformations, a feasible solution can be obtained or one can prove that no feasible solution exists. The basic idea is: after one elimination transformation the negative components of basic solution will be increased strictly, so the number of the negative components of basic solution will become less and less, finally a basic feasible solution can be obtained. An example is given to demonstrate the valid of this method.