Offered
Clayton Second semester 2008 (Day)
Synopsis
Linear programming (LP) problem formulation, graphical solution. LP solution algorithms; simplex, big M and 2-phase methods. LP post optimality analysis. Problems of degeneracy. Solution via computer package. The assignment and transportation problems. Network analysis. Shortest path. Minimal spanning tree. Maximal flow; Decision theory. Decision tree. Bayes theorem and its application in decision models. Two-person zero sum game theory. Dynamic programming: problem formulation: Use of multistage decision processes. Taguchi approach to quality. Design of experiments and reporting of results.
Assessment
Assignment: 30%
Examination (3 hours): 70%
Contact hours
36 lecture hours and 24 hours laboratory/practice classes per semester
Prerequisites
Must have passed 72 credit points including IND2400 (or IND2311) and IND2401 (or IND1332 or IND2332)
