A New Variant of Simplex Method

In this paper a new variant of simplex method is proposed to solve a class of linear programming problem having all constraints≥ type. In the proposed method, instead of using artificial basis techniques we start with infeasible solution obtained by converting all the constraints into ≤ type. Then by judicious selection of entering and leaving vector in and from the initial simplex table, feasible solution is obtained in the first iteration only and optimal solution then can be obtained using regular simplex method.