Linear álgebra, convex analysis, and polyhedral sets The simplex method Starting solution and convergence Special simplex implementations and optimality conditions Duality and sensitivity analysis The decomposition principle Complexity of the simplex algorithm and polynomial algorithms Minimal cost network flows The transportation and assignment problems The out of kilter algorithm Maximal flow, shortest path, multicommodity flow, and network synthesis problems
