3 unit(s) Modelling and solutions for engineering and science problems using linear optimization, including networks, transportation, assignment, and scheduling problems. Solution methods include combinatorial algorithms such as simplex methods, primal-dual formulations, branch and bound formulations for mixed integer programming, and heuristics.
Three lectures, one tutorial (one hour); first term Prerequisite(s): COMPSCI 2C03 Antirequisite(s):SFWRENG 3O03, 4O03 Cross-list(s):SFWRENG 3O03
