|
| |
302292 (v.1) Network Optimisation 202
Area: | Department of Mathematics and Statistics |
Credits: | 25.0 |
Contact Hours: | 4.0 |
Lecture: | 1 x 3 Hours Weekly |
Tutorial: | 1 x 1 Hours Weekly |
Prerequisite(s): | 8140 (v.5) Operations Research 201 or any previous version
|
Syllabus: | Basic definitions and applications of graph theory to network design and analysis, scheduling, facility layout design and various allocation problems. Basic concepts of network flows - Max-Flow Min-Cut Theorem, feasible flows and algorithms. Algorithm for maximum matchings in bipartite graphs. Project and planning; CPM and PERT, resource allocation problems and time constraints. |
| |
Unit Outcomes: | On successful completion of this unit the student will be able to recognise easily the decision problems from business that may be mathematically modeled as a network optimization problem; Think analytically and develop network based mathematical formulation of certain practical problems arising in business organizations; Independently learn, investigate and develop methods to solve network based mathematical models of certain business decision problems; Write reports that explain ideas in a logical sequence. |
Texts and references listed below are for your information only and current as of September 30, 2003. Some units taught offshore are modified at selected locations. Please check with the unit coordinator for up-to-date information and approved offshore variations to unit information before finalising study and textbook purchases. |
Unit References: | Bondy, JA and Murty, USR, 1976.Graph Theory with Applications, American Elsevier. Chartrand, G and Oellermann, OR, 1993. Applied and Algorithmic Graph Theory, McGraw-Hill. Chen, Wai-Kai, 1990. Theory of Nets: Flows in Networks, Wiley & Sons (A Wiley Interscience Publication). Hillier, FS and Lieberman, GT, 1991. Operations Research, 5th Edition, McGraw-Hill. Moder, JJ and Phillips, DR, 1967. Project Management with CPM and PERT, Reinhold. Roberts, F, 1976. Discrete Mathematical Models, Prentice-Hall. Taha, H, 1992. Operations Research: An Introduction, 5th Edition, MacMillan Publishing Co. |
Unit Texts: | No prescribed texts |
| |
Unit Assessment Breakdown: | Assignments: 20%, Tutorial Work: 10%, Mid Semester Test 15%, Examination: 55% |
Field of Education: | 10100 Mathematical Sciences (Narrow Grouping) | HECS Band (if applicable): | 2 |
|
Extent to which this unit or thesis utilises online information: | Not Online | Result Type: | Grade/Mark |
|
Availability
| Year | Location | Period | Internal | Area External | Central External | | 2004 | Bentley Campus | Semester 2 | Y | | |
Area
External | refers to external course/units run by the School or Department, offered online or through Web CT, or offered by research. |
Central
External | refers to external course/units run through the Curtin Bentley-based Distance Education Area |
|
Click here for a printable version of this page
|
|
|
|
