Linear Programming and the Simplex Algorithm. Sensitivity analysis, duality, and the dual simplex algorithm. Transportation and Assignment Problems, Network models. Integer programming. Lect: 3 hrs. Prerequisites: MTH 231 or (MTH 108 and MTH 310) or (MTH 240 and MTH 141) Course Weight: 1.00 Billing Units: 1
