Introduction to Operations Research (MAST20035)

This subject introduces the essential features of operations research methods and the type of problems they can solve; it develops a mathematical techniques used to solve typical generic problems and the theoretical foundations of these techniques. Students will 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. Mixed integer linear programming and the branch and bound algorithm are also important topics. This subject demonstrates the extent and limitations of operations research techniques such as linear programming, dynamic programming, mixed integer linear programming, and sensitivity analysis in the context of problems in industry and research, showing the essential role that standard mathematical tools and computers play in the analysis and solutions of operations research problems.

Topics include linear programming, simplex and revised simplex methods, duality theory, sensitivity analysis, dynamic programming, the transportation problem, shortest path and critical path problems, knapsack problems, mixed integer linear programming, and the branch and bound algorithm. Students will also look at the applications of operations research techniques to problems in industry and research using computer packages and Internet resources.