Theory, algorithms, and applications of linear programming. Topics include the simplex method and resolution of degeneracy, duality and sensitivity analysis, basis factorization, the dual and revised simplex methods, and geometry of polyhedra. Intended for Ph.D. students.