The generalized simplex algorithm in Section 4.4.2 is intended to show that the
simplex method is not rigid, in the sense that you can modify the rules to handle problems that start both infeasible and nonoptimal. However, this material may be skipped without loss of continuity.