In applying the feasibility condition of the simplex method, suppose that x_r = 0 is a basic variable and that x_j is the entering variable with (B⁻¹P_j)_r ≠ 0. Prove that the resulting basic solution remains feasible even if (B⁻¹P_j)_r  is negative.