The Strong Duality Theorem for Linear Programming

Students frequently conflate Strong Duality with Weak Duality. While Weak Duality ensures

c^T x \leq b^T y

for all feasible solutions, Strong Duality requires the existence of an optimal point; it fails if both primal and dual are infeasible or unbounded.

Institutional Reference: Fundamentals of Optimization