MATH 441

Modelling of Discrete Optimization Problems (3,1,0) 3 credits

Real-world optimization problems are formulated so that they can be tackled by standard techniques involving linear programming, network flows, dynamic programming and difference equations. Additional techniques may include post-optimality analysis, game theory, Markov chains, and matchings.

Prerequisite: MATH 340