  This paper presents new and easy to use versions of primal and dual phase 1
processes which obviate the role of artificial variables and constraints by
allowing negative variables into the basis. During the process new method
visits the same sequence of corner points as the traditional phase 1 does. The
new method is artificial free so, it also avoids stalling and saves degenerate
pivots in many cases of linear programming problems.
