- Student Records
Programme & Unit Catalogues

MA50087: Optimisation methods of operational research

Follow this link for further information on academic years Academic Year: 2018/9
Further information on owning departmentsOwning Department/School: Department of Mathematical Sciences
Further information on credits Credits: 6      [equivalent to 12 CATS credits]
Further information on notional study hours Notional Study Hours: 120
Further information on unit levels Level: Masters UG & PG (FHEQ level 7)
Further information on teaching periods Period:
Semester 1
Further information on unit assessment Assessment Summary: CW 25%, EX 75%
Further information on unit assessment Assessment Detail:
  • Coursework (CW 25%)
  • Examination (EX 75%)
Further information on supplementary assessment Supplementary Assessment:
Like-for-like reassessment (where allowed by programme regulations)
Further information on requisites Requisites:
Further information on descriptions Description: Aims & Learning Objectives:
To present methods of optimisation commonly used in OR, to explain their theoretical basis and give an appreciation of the variety of areas in which they are applicable. To facilitate an in-depth understanding of the topic.
Objectives: On completing the course, students should be able to:
* Recognise practical problems where optimisation methods can be used effectively.
* Implement appropriate algorithms, and understand their procedures.
* Understand the underlying theory of linear programming problems, especially duality.
* Demonstrate an in-depth understanding of the topic.


* The Nature of OR: Brief introduction.
* Linear Programming: Basic solutions and the fundamental theorem. The simplex algorithm, two phase method for an initial solution. Interpretation of the optimal tableau. Applications of LP. Duality.
* Topics selected from: Sensitivity analysis and the dual simplex algorithm. Brief discussion of Karmarkar's method. The transportation problem and its applications, solution by Dantzig's method. Network flow problems, the Ford-Fulkerson theorem.
* Non-linear Programming: Revision of classical Lagrangian methods. Kuhn-Tucker conditions, necessity and sufficiency. Illustration by application to quadratic programming.
Further information on programme availabilityProgramme availability:

MA50087 is Optional on the following programmes:

Department of Mathematical Sciences