Tag: optimization

George Dantzig’s simplex method turned linear programming from a modeling idea into a practical computational technique, linking postwar planning problems to the emerging world of electronic computation.

Richard Bellman turned multistage decision problems into a recursive method in which later optimal choices are reused to solve earlier ones, creating dynamic programming as a general algorithmic strategy.