This module shows that aspects of certain managerial problems such as optimal allocation of resources, transporting goods economically, and assigning workers to jobs can be modelled mathematically and their solutions can be found efficiently by Management Mathematics techniques. This module also presents some optimisation methods for a class of managerial applications such as inventory management, project management, waiting line, job shop scheduling, among others.
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;
Model some practical optimisation problems, including stock control, project scheduling and queuing systems;
Provide optimal solutions using mathematical techniques.
Assessment
22495-01 : CA Sem 1 : Coursework (5%)
22495-03 : Exam : Exam (Centrally Timetabled) - Written Unseen (90%)
22495-04 : Extra Task Sem 1 : Coursework (0%)
22495-05 : Extra Task Sem 2 : Coursework (0%)
22495-06 : CA Sem 2 : Coursework (5%)
Assessment Methods & Exceptions
10% based on course work and/or class tests during term-time; 90% based on a 3-hour examination
