Proof of Finite Termination of the Simplex Algorithm (Assuming Non-Degeneracy)
Students often misunderstand what 'non-degeneracy' truly implies. It means that all basic variables in a basic feasible solution are strictly positive. This is crucial because a degenerate BFS (where some basic variables are zero) can lead to a pivot that doesn't improve the objective function value, potentially causing cycling.
Institutional Reference: Linear and Integer Programming
View Full Proof →