MAT 535 - Linear Programming and Network Flows

Course Description: Methods and applications of optimizing a linear function subject to linear constraints. Theory of the simplex method and duality; parametric linear programs; sensitivity analysis; modeling and computer implementation.

Credit Hours: 3

Corequisite Courses: None
Prerequisite Courses: None
Additional Restrictions/ Requirements: Undergraduate linear algebra and computing experience.
Course Repeatability Course may not be repeated Maximum Repeatable Hours: 3

ADDITIONAL COURSE INFORMATION

Equivalent Courses: None
Undergraduate Crosslisting: None
Additional Course Fees: None
Course Attribute: None

Click here for the Spring 2025 Class Schedule.