| Unit name | Optimisation 2 |
|---|---|
| Unit code | MATH20600 |
| Credit points | 20 |
| Level of study | I/5 |
| Teaching block(s) |
Teaching Block 1 (weeks 1 - 12) |
| Unit director | Professor. Misha Rudnev |
| Open unit status | Not open |
| Pre-requisites |
MATH11002 and MATH11003 |
| Co-requisites |
None |
| School/department | School of Mathematics |
| Faculty | Faculty of Science |
Methods for finding (local or global) maxima or minima of functions of 1 or more variables, particularly when subject to constraint. Linear programming and non- linear minimisation, including results where convexity is relevant, such as the Kuhn-Tucker theorems. Applications in industry and economics. The emphasis is on practical techniques for solution of specific problems, but enough theory is given to provide a solid foundation for them. Some numerical work is included.
