Question: In applying the feasibility condition of the simplex method, suppose that x r = 0 is a basic variable and that x j is the
In applying the feasibility condition of the simplex method, suppose that xr = 0 is a basic variable and that xj is the entering variable with (B−1Pj)r ≠ 0. Prove that the resulting basic solution remains feasible even if (B−1Pj)r is negative.
Step by Step Solution
3.40 Rating (163 Votes )
There are 3 Steps involved in it
Let x k d k 0represent the current basi... View full answer
Get step-by-step solutions from verified subject matter experts
