CMP 747: Linear Programming and Operations Research.
4 hours, 4 credits. Theory and application of linear techniques. Convex sets and polyhedrons. The simplex method and the revised simplex method. Procedures to handle degeneracy. Duality theory and the dual simplex method. Elements of inventory and queueing theory. Industrial applications in scheduling and production control. Khachian's algorithm. PREREQ: One course in linear algebra.
Last modified: 8/4/2015