You are now in the main content area

MTH 503

Operations Research I

Linear Programming and the Simplex Algorithm. Sensitivity analysis, duality, and the dual simplex algorithm. Transportation and Assignment Problems, Network models. Integer programming.
Weekly Contact: Lecture: 3 hrs.
GPA Weight: 1.00
Course Count: 1.00
Billing Units: 1

Prerequisites

(MTH 108 or MTH 141) and (MTH 231 or MTH 240 or MTH 310)

Co-Requisites

None

Antirequisites

None

Custom Requisites

None