Mathematics
The Simplex Method for Linear Programming
Quick fact
The simplex method, developed by George Dantzig in 1947, is remarkably efficient in practice: it almost always solves a linear program in a number of steps that grows roughly linearly with the number of constraints, even though its worst-case behavior is exponential.
Why this is interesting
Imagine you are a factory manager trying to maximize profit with limited resources — there are infinitely many possible production plans, yet only a few can be optimal. How can you find the best one without checking them all?