Linear programming

Dantzig’s simplex method and branch and bound for integer programs.

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