MATH 4410 Modelling of Discrete Optimization Problems (3,1,0)

Credits: 3 credits
Delivery: Campus

Real-world optimization problems are formulated in order to be resolved by standard techniques involving linear programming, integer programming, network flows, dynamic programming and goal programming. Additional techniques may include post-optimality analysis, game theory, nonlinear programming, and heuristic techniques. Prerequisites: MATH 3400-Intro to Linear Programming with a minimum grade of C
For more information, search for this course here.