MAT 536 - Nonlinear and Discrete Optimization

Course Description: Theory and applications of discrete optimization algorithms. Transportation problems and network flow problems; integer programming; computer implementation.

Credit Hours: 3

Corequisite Courses: None
Prerequisite Courses: MAT 535
Additional Restrictions/ Requirements: None
Course Repeatability Course may not be repeated

ADDITIONAL COURSE INFORMATION

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

Click here for the Spring 2025 Class Schedule.