MAT3157

Sequential decision models

Not offered in 1999

Dr Richard Egudo

8 points - Second semester - 6 hours per week - Gippsland, distance (even-numbered years) - Prerequisites: MAT2156 - Prohibitions: GAS2714, MAT2091, MAT3182

Objectives Building on linear programming this subject introduces network optimisation modelling concepts and nonlinear programming; develops understanding and skills for constructing netforms that represent a management decision problem; achieves a basic understanding and ability to use appropriate dynamic programming models for decision problems; develops an understanding of the need for and role played by necessary and sufficient optimality conditions allows students to acquire the ability to develop or apply optimisation software; develops awareness and appreciation in the importance for decision makers' involvement in all stages of the modelling process.

Synopsis This subject introduces students to different techniques in modelling decision problems as sequential decision models. It aims to develop students' ability and understanding of modelling decision problems using sequential decision techniques; to introduce students to various techniques for solving sequential decision modelling problems and to give students an appreciation of the limitations inherent in each technique. Topics include an introduction to different types of decision models including non-linear, quadratic and geometric programming models; formulating management problems as optimisation models; solution techniques for the introduced decision models and typical applications; introduction to sequential (dynamic) programming models, separable functions, recursive equations and limitations; netforms including maximal flow, minimal spanning tree, shortest path, travelling salesman and Chinese postman problems; minimum cost flow problems, project planning and scheduling with limited/unlimited resources (CPM and PERT methods); use of computer software for solution of problems.

Assessment: Assessment assignments: 40% - Examination (3 hours): 60%

Prescribed texts

Glover F, Klingmman D and Phillips N V Network models in optimization and their applications in practice Wiley, 1992
Bazaraa M S, Sherali H D and Shetty C M Nonlinear programming: Theory and algorithms Wiley, 1993

Back to the 1999 Science Handbook