MIE365H1
UTSGAdvanced Operations Research
Linear programming extensions: goal programming. Cooperative game theory (shapley values and nucleolus), interior point methods, large scale decomposition methods (Lagrangian relaxation, Dantzig-Wolfe decomposition, benders decomposition and column generation), stochastic programming. Karush-Kuhn-Tucker (KKT) conditions with application to quadratic programming and bi-level programming. Mathematical Programming formulation choices. Markov Decision Process (MDP) problems.
View full details on the UofT Academic CalendarPrereq: MIE262H1, MIE263H1
0%
liked
Easy0%
Useful0%
0
comments
0
ratings
Course Info
DepartmentMIE
CampusUTSG (St. George)
Level300
Hours36.6L/7T/20P
What do you think of MIE365H1?
Reviews
No reviews yet — be the first to share your experience.