MTH 537 - Operations Research I

(4 credits)

Prerequisite(s): Grad course eligibility for undergraduates: credits earned greater than or equal to 144 and gpa 2.75 OR level is graduate. Linear programming, including the simplex method, sensitivity analysis, duality, and integer programming. Additional topics selected from LU decomposition, dual simplex algorithm, game theory, Karmarkar’s algorithm, as well as topics from nonlinear programming, such as steepest descent and Kuhn-Tucker conditions. Part one of a two-part sequence.

Click here for the schedule of courses