Rigorous introduction to the theory of linear programming. Simplex method, revised simplex method, duality, dual simplex method. Post-optimality analysis. Interior point methods. Decomposition methods. Network flow algorithms. Maximum flow, shortest path, assignment, min cost flow problems.