Monash home | About Monash | Faculties | Campuses | Contact Monash |
Staff directory | A-Z index | Site map |
Undergraduate |
(ENG)
|
Leader: R N Ibrahim
Offered:
Clayton Second semester 2005 (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: Examination (3 hours): 70% + Assignment: 30%
Contact Hours: 22 lecture hours and 22 hours laboratory/practice classes
Prohibitions: ENC3312