| Unit name | Optimisation 3 |
|---|---|
| Unit code | MATH32500 |
| Credit points | 20 |
| Level of study | H/6 |
| Teaching block(s) |
Teaching Block 2 (weeks 13 - 24) |
| Unit director | Professor. Misha Rudnev |
| Open unit status | Not open |
| Pre-requisites | |
| Co-requisites |
None |
| School/department | School of Mathematics |
| Faculty | Faculty of Science |
This unit follows on directly from the linear programming section of the Level 2 unit on Optimisation. A thorough knowledge of the simplex method is required. The major themes are (i) more advanced methods in linear programming; its application to the theory of games; (ii) linear programming in network optimisation problems, and (iii) integer programming and combinatorial optimisation. 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 business and industry.
