Simplex Table

Optimality Criteria Unbounded Solution Alternate Solution/ Improvement criteria

Multiple Solution (∃ another BFS that improves objective function)

All 𝑧𝑗 − 𝑐𝑗 ≥ 0 One non-basic 𝑧𝑗 − 𝑐𝑗 < 0 One non-basic 𝑧𝑗 − 𝑐𝑗 = 0 One non-basic 𝑧𝑗 − 𝑐𝑗 < 0

and corresponding all and at least one and at least one corresponding
𝑦𝑖𝑗 ≤ 0 corresponding 𝑦𝑖𝑗 > 0 𝑦𝑖𝑗 > 0

Big-M Method
(in the optimal table, i.e. when 𝑧𝑗 − 𝑐𝑗 ≥ 0)

No a.v present in basis A.v present in basis at zero level A.v present in basis at positive level

Optimal solution exists with no Optimal solution exists with redundancy No feasible solution
redundancy in constraint equations in constraint equations