CSCI2100 · Computer Science
Morrissey College of Arts & Sciences
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.
Course experience
Averages use the original five-point historical evaluation scale.
Organization
3.8 / 5
How well the course was organized
Challenge
4.8 / 5
How intellectually challenging students found it
Attendance
4.8 / 5
How necessary attendance was
Assignments
3.9 / 5
How helpful assignments were
Weekly effort
~5
hours per week
Estimated from the original workload response buckets. Individual sections may differ.
Instructor options
Ratings below reflect only recovered evaluations connected to this course.
Across time
Section-level results available in the recovered archive.
Spring 2024
1 section