620-261 Introduction to Operations Research

One of [01]620-112, 620-122, 620-142, [99]620-200, 620-211.

This subject introduces the essential features of operations research methods and the type of problems they can solve; it develops a number of basic mathematical techniques used to solve typical generic problems and the theoretical foundations of these techniques. Students should develop the ability to construct formal mathematical models for practical optimisation problems, to solve linear programming problems and to assess the results, to use dynamic programming techniques in the modelling analysis and solution of operations research problems, and to conduct sensitivity analysis in the context of a number of operations research problems. This subject demonstrates the extent and limitations of operations research techniques such as linear programming, dynamic programming and sensitivity analysis in the context of real-world problems. It also shows the essential role that standard mathematical tools and computers play in the analysis and solutions of operations research problems.

Selected topics from mathematical modelling, linear programming, simplex and revised simplex methods, duality theory, sensitivity analysis, dynamic programming, shortest path and critical path problems, and knapsack problem will be studied. Students will also look at the applications of operations research techniques to real-world problems and the use of computer packages and internet resources will be covered.

Up to 24 pages of written assignments and a 3-hour end-of-semester written examination.