1. Explain why it is sufficient to look only at basic solutions in the reformulation of the LOP with slack variables.
2. Explain why the system infeasible if the algorithm stops in phase 1.
3. Explain why the system is unbounded if in phase 2 the algorithm displays a column in the tableau with no positive entries and the corresponding entry in the objective row is negative.
4. Explain why the snr rule maintains feasibility in phase 2.
5. Explain why the optimal solution has been obtained in phase 2 when every entry in the objective row is non-
