ABSTRACT
Simplex Method
Step 0: Generate an initial basic feasible solution x(0). Let k = 0 and go to Step 1.
Step 1: Check optimality of x(k). If x(k) is optimal, then STOP and return x(k) as the optimal solution, else go to Step 2.
Simplex Method
Step 0: Generate an initial basic feasible solution x(0). Let k = 0 and go to Step 1.
Step 1: Check optimality of x(k). If x(k) is optimal, then STOP and return x(k) as the optimal solution, else go to Step 2.