[an error occurred while processing this directive]
|
|||||||||
IND3313Systems modelling and simulation I (6 points)(ENG) Leader: R N Ibrahim
Offered: 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 laboratory/tutorial hours Prohibitions: ENC3312 |
Australian Government Requirements for International Students - CRICOS Provider Number: 00008C
Copyright © 1994-2001 Monash University - Last Date Modified: 13 October 2003 - Caution - Privacy Monash University ABN 12 377 614 012 |