The field of Operations Research (OR) explores how optimization algorithms can inform decision-making. In this course, students will engage with a variety of decision-making problems that can be solved efficiently by fundamental OR algorithms. Some of the problems we will study include the diet problem, the assignment problem, and transport problems such as shortest-path and maximum-flow. Each problem can be framed as a Linear Program, for which there is an elegant and insightful theory leading to the ubiquitous simplex method. Other topics to be considered include degeneracy, duality, sensitivity analysis, and some Integer Programming algorithms such as branch-and-bound. Students should expect a healthy mix of theory and hands-on coding.
Written reviews 0
No written reviews yet
Numerical ratings and written feedback are separate. Be the first to share what you wish you’d known before taking this course.