This course addresses formulation, solution techniques and applications of linear programming problems. Topics covered include simplex-method, revised simplex method, duality, sensitivity analysis, large scale liner programs, column generation, Dantzig-Wolf decomposition, interior point methods, and computer solutions. Prerequisites: Consent of Instructor. ((F;S)