Operations Research - MAT00084H
Module summary
Operations Research (OR) is the branch of applied mathematics that is used in the management of organisations to assist decision-making. While the emphasis lies on the introduction of the mathematics of OR, attention will be paid to its applicability and the importance of careful modelling and interpretation to OR’s usefulness in practice.
Related modules
Module will run
| Occurrence | Teaching period |
|---|---|
| A | Semester 2 2025-26 |
Module aims
Operations Research (OR) is the branch of applied mathematics that is used in the management of organisations to assist decision-making. While the emphasis lies on the introduction of the mathematics of OR, attention will be paid to its applicability and the importance of careful modelling and interpretation to OR’s usefulness in practice.
Module learning outcomes
By the end of the module, students will be able to:
-
State and describe the basic terminology and results concerning linear programming.
-
Describe the basic simplex method and use it to solve linear programs.
-
State and prove the fundamental and duality theorems.
-
Model and solve transportation and network problems.
-
Describe and apply the main results of game theory to OR problems
-
Formulate real-world problems in mathematical terms, solve these using appropriate methods, and interpret the solutions in terms of the original problems.
Module content
This module covers the basic mathematical tools of OR, such as linear programming, transportation and network models. There is a focus on both the mathematical development of the subject and its practical applicability. In particular, attention will be given to the importance of algorithms in solving a myriad of operational problems. Applications are found in many organisations (both public and private) and these will be explored through exercises. In addition, the basic concepts of game theory (the mathematical theory of strategic conflicts) and its basic results will be covered in light of typical OR problems. Students are expected to be willing to work, by themselves, on unseen problems in many different areas of applications.
Indicative assessment
| Task | % of module mark |
|---|---|
| Closed/in-person Exam (Centrally scheduled) | 100 |
Special assessment rules
None
Indicative reassessment
| Task | % of module mark |
|---|---|
| Closed/in-person Exam (Centrally scheduled) | 100 |
Module feedback
Current Department policy on feedback is available in the student handbook. Coursework and examinations will be marked and returned in accordance with this policy.
Indicative reading
Nash and Sofer (1996), “Linear and Nonlinear Programming”, McGraw-Hill.
Maschler, Solan, and Zamir (2020), “Game Theory”, 2nd edition, Cambridge University Press.
Hillier & Lieberman (2021), "Introduction to Operations Research," 11th edition, McGraw-Hill.