Simplex Method (2D)

George Dantzig, 1947

The simplex algorithm (1947) walks from vertex to vertex of the feasible region. This schematic uses a triangle feasible region and highlights improving corners in gold, visited in teal, and edges in coral.