Operations Research
An introduction to deterministic and stochastic models for engineering decision-making: linear and integer programming, network flows, dynamic programming, and queueing. The emphasis is on formulation — turning a real engineering problem into a model that can be solved — with hands-on practice using open-source solvers.Course Outlines
The detailed week-by-week schedule is finalised at the start of each semester. The provisional outline below indicates the scope.
| # | Topic |
|---|---|
| 1 | Introduction to operations research; modelling |
| 2 | Linear programming — formulation and graphical method |
| 3 | Simplex method |
| 4 | Duality and sensitivity analysis |
| 5 | Transportation and assignment problems |
| 6 | Network models — shortest path, max flow, MST |
| 7 | Integer programming |
| 8 | Branch-and-bound; cutting planes |
| 9 | Dynamic programming |
| 10 | Inventory models |
| 11 | Queueing theory |
| 12 | Decision analysis under uncertainty |
| 13 | Game theory |
| 14 | Case studies; review |
References
Standard texts include Hillier & Lieberman’s Introduction to Operations Research, Taha’s Operations Research: An Introduction, and Winston’s Operations Research: Applications and Algorithms. Specific editions are confirmed at the start of the semester.