This module presents a comprehensive theory of linear programming and its applications. Starting from geometrical interpretation it builds on basic knowledge of linear algebra and develops the simplex method and its variants (revised, two-phase) while simultaneously providing examples of practical managerial applications. It also creates the necessary platform for further management mathematics courses by fully presenting duality theory including complementary slackness. Advanced economic applications such as shadow prices or data envelopment analysis and alternative solution methods such as the internal point method are optional and at the discretion of the lecturer in charge.
Learning Outcomes
By the end of the module the student should be able to:
Understand basic techniques of linear programming (graphical method and simplex method);
Construct linear programming models of a variety of managerial problems and interpret the results;
Obtained by applying the linear programming techniques to these problems;
Explain why and when the simplex method fails to provide a solution and how to resolve such a situation;
Present, prove and use the results of duality theory and interpret them.
Assessment
22491-01 : CA Sem 1 : Coursework (5%)
22491-02 : CA Sem 2 : Coursework (5%)
22491-03 : Exam : Exam (Centrally Timetabled) - Written Unseen (90%)
22491-04 : Extra Task Sem 1 : Coursework (0%)
22491-05 : Extra Task Sem 2 : Coursework (0%)
Assessment Methods & Exceptions
10% based on course work and/or class tests during term-time; 90% based on a 3-hour examination
