Linear programming

Dantzig’s simplex method, branch and bound for integer programs, and Karmarkar’s interior-point approach.

Dantzig’s simplex method: walking the vertices of a production LP

Dantzig's simplex method: walking the vertices of a production LP

Branch and bound: integer versus relaxed optimum

Branch and bound: integer versus relaxed optimum

Karmarkar’s interior-point method: the central path

Karmarkar's interior-point method: the central path