Skip to main content

Unit information: Optimisation Theory and Applications in 2015/16

Please note: you are viewing unit and programme information for a past academic year. Please see the current academic year for up to date information.

Unit name Optimisation Theory and Applications
Unit code EMAT30670
Credit points 10
Level of study H/6
Teaching block(s) Teaching Block 1 (weeks 1 - 12)
Unit director Dr. Colin Campbell
Open unit status Not open
Pre-requisites

EMAT20200 Engineering Mathematics 2 or equivalent.

Co-requisites

None

School/department Department of Engineering Mathematics
Faculty Faculty of Engineering

Description

This unit gives an overview of methods and algorithms both in linear programming (operational research) and non-linear optimisation. Techniques to be considered include: Linear Programming. Graphical solution of simple problems, basic solutions, the Simplex method, finding an initial basic solution (including artificial variables), multiple optima in the Simplex method, duality. Integer Programming. Some examples of integer programming in finance and engineering. The branch and bound method. Non-Linear Programming. The downhill simplex method. The steepest ascent method. The conjugate gradient method. Dynamic Programming (multi-stage decision making).

Aims: To give students an understanding of theory and engineering applications of linear and nonlinear optimisation, and dynamic programming.

Intended learning outcomes

  • Students will gain an understanding of a range of techniques in optimisation theory covering linear and non-linear optimisation and dynamical programming.
  • Through examples students will learn how these techniques can be applied in practice across a diverse range of fields.

Teaching details

Lectures.

Assessment Details

2-hour written exam (100%) – all learning outcomes

Reading and References

Hamdy Taha, Operations Research: An Introduction, Prentice-Hall International

Feedback