Accessibility statement

Operations Research - MAT00084H

« Back to module search

  • Department: Mathematics
  • Module co-ordinator: Prof. Jacco Thijssen
  • Credit value: 20 credits
  • Credit level: H
  • Academic year of delivery: 2024-25
    • See module specification for other years: 2023-24

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

Pre-requisite modules

Co-requisite modules

  • None

Prohibited combinations

  • None

Module will run

Occurrence Teaching period
A Semester 2 2024-25

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:

  1. State and describe the basic terminology and results concerning linear programming.

  2. Describe the basic simplex method and use it to solve linear programs.

  3. State and prove the fundamental and duality theorems.

  4. Model and solve transportation and network problems.

  5. Describe and apply the main results of game theory to OR problems

  6. 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.

Assessment

Task Length % of module mark Group
Closed/in-person Exam (Centrally scheduled)
Operations Research		 3 hours 100 Default
Closed/in-person Exam (Centrally scheduled)
Operations Research		 3 hours 100 B

Special assessment rules

None

Reassessment

Task Length % of module mark Group
Closed/in-person Exam (Centrally scheduled)
Operations Research		 3 hours 100 Default
Closed/in-person Exam (Centrally scheduled)
Operations Research		 3 hours 100 B

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.


The information on this page is indicative of the module that is currently on offer. The University is constantly exploring ways to enhance and improve its degree programmes and therefore reserves the right to make variations to the content and method of delivery of modules, and to discontinue modules, if such action is reasonably considered to be necessary by the University. Where appropriate, the University will notify and consult with affected students in advance about any changes that are required in line with the University's policy on the Approval of Modifications to Existing Taught Programmes of Study.