| Unit name | Optimisation 34 |
|---|---|
| Unit code | MATHM2510 |
| Credit points | 10 |
| Level of study | M/7 |
| Teaching block(s) |
Teaching Block 2 (weeks 13 - 24) |
| Unit director | Dr. Harrow |
| Open unit status | Not open |
| Pre-requisites |
None |
| Co-requisites |
None |
| School/department | School of Mathematics |
| Faculty | Faculty of Science |
This unit follows on directly from the linear programming section ofthe Level 2 unit on Optimisation. A solid knowledge of linear programming and duality is required. The major themes are (i) review of linear programming, duality; applications in game theory; (ii) linear programming in combinatorial optimisation problems; (iii) approximation algorithms for NP-complete problems. The focus will be on understanding the nature of the mathematical problems and developing methods for solving them. Mathematical theory for its own sake is not a feature of this unit; in this respect it is an "applied mathematics" unit. The methods introduced in this unit are used regularly throughout economics, computer science, business and industry.
