Visual Proof: The Strong Duality Theorem in Linear Programming
Students often confuse the Weak Duality Theorem, which only provides a bound , with the Strong Duality Theorem. Strong Duality strictly requires the existence of feasible solutions for both problems to ensure that the duality gap reaches exactly zero.
Institutional Reference: Linear and Integer Programming
View Full Proof →