The simplex method is the basic method for Linear programming.
The Simplex method is a search procedure that sifts through the set of basic feasible solutions, one at a time, until the optimal basic feasible solution is identified.