302292 (v.1) Network Optimisation 202

---

 

Area:	Department of Mathematics and Statistics
Contact Hours:	4.0
Credits:	25.0
Lecture:	3 x 1 Hours Weekly
Tutorial:	1 x 1 Hours Weekly
Prerequisite(s):	8140 (v.5) Operations Research 201 or any previous version
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.