The paper probes into the solution, by means of the matrix elementary transformation, of the non-elementary feasible base of linear program.

Direct search feasible direction (DSFD) is an effective algorithm for solving the constrained non-linear programming problem, however, it could only find the local optimal solution.

In this paper, the authors establish a new method of finding the base feasible solution for linear program subject to non-negative variables and equality constraints.