Module Details |
| The information contained in this module specification was correct at the time of publication but may be subject to change, either during the session because of unforeseen circumstances, or following review of the module at the end of the session. Queries about the module should be directed to the member of staff with responsibility for the module. |
| Title | Operational Research: Linear and Convex Methods | ||
| Code | MATH269 | ||
| Coordinator |
Dr JE Banks Mathematical Sciences Jessica.Banks@liverpool.ac.uk |
||
| Year | CATS Level | Semester | CATS Value |
| Session 2025-26 | Level 5 FHEQ | Second Semester | 15 |
Aims |
|
|
The aims of the module are to develop an understanding of how mathematical modelling and operational research techniques are applied to real-world problems and to gain an understanding of linear and convex programming, multi-objective problems, inventory control and sensitivity analysis. |
|
Learning Outcomes |
|
|
(LO1) Accurately use a range of routine methods for optimisation and sensitivity analysis in a variety of mathematical contexts. |
|
|
(LO2) Explain the practical significance of optimisation and sensitivity analysis in real-world contexts. |
|
|
(LO3) Analyse the advantages and disadvantages of applying a particular operational research method in a specific situation or in comparison to another method. |
|
|
(LO4) Adapt, combine and apply operational research methods and their derivations to unfamiliar mathematical or real-world settings. |
|
|
(S1) Adaptability |
|
|
(S2) Problem solving skills |
|
|
(S3) Numeracy |
|
|
(S4) Self-management readiness to accept responsibility (i.e. leadership), flexibility, resilience, self-starting, initiative, integrity, willingness to take risks, appropriate assertiveness, time management, readiness to improve own performance based on feedback/reflective learning |
|
Syllabus |
|
|
Operational research methodology. Linear programming: solvability, simplex method, artificial variables, duality, degeneracy, elementary sensitivity analysis. Transportation Problem: NWCR, Least-cost method, MODI methods, degeneracy, unbalanced problems. Convex programming: Lagrange multipliers, duality, numerical techniques (gradient methods, penalty functions, etc.). Multiobjective problems: dominance, non-inferior set, weighting method, other approaches. Inventory theory: fixed-order-quantity models, sensitivity analysis, production-inventory systems. |
|
Recommended Texts |
|
| Reading lists are managed at readinglists.liverpool.ac.uk. Click here to access the reading lists for this module. | |
Pre-requisites before taking this module (other modules and/or general educational/academic requirements): |
| MATH102 CALCULUS II 2024-25; MATH101 Calculus I 2024-25; MATH103 Introduction to Linear Algebra 2024-25 |
Co-requisite modules: |
Modules for which this module is a pre-requisite: |
Programme(s) (including Year of Study) to which this module is available on a required basis: |
Programme(s) (including Year of Study) to which this module is available on an optional basis: |
Assessment |
||||||
| EXAM | Duration | Timing (Semester) |
% of final mark |
Resit/resubmission opportunity |
Penalty for late submission |
Notes |
| Final Assessment | 90 | 50 | ||||
| CONTINUOUS | Duration | Timing (Semester) |
% of final mark |
Resit/resubmission opportunity |
Penalty for late submission |
Notes |
| Homework 3 Writing Assessment | 0 | 20 | ||||
| Homework 1 open book and remotely (Moebius) | 0 | 15 | ||||
| Homework 2 open book and remote (Moebius) | 0 | 15 | ||||