This problem is designed to reinforce your understanding of the simplex feasibility condition. In the first tableau in Example 3.3-1, we used the minimum (nonnegative)

ratio test to determine the leaving variable. The condition guarantees feasibility (all the new values of the basic variables remain nonnegative as stipulated by the definition of the LP). To demonstrate this point, force s2, instead of s1, to leave the basic solution, and carry out the Gauss-Jordan computations. In the resulting simplex tableau, s1 is infeasible 1= -122.