Module Code :

MA3252

IVLE

Module Title : 
Linear and Network Optimisation 
Module Description : 
The objective of this course is to work on optimization problems which can be formulated as linear and network optimization problems. We formulate linear programming (LP) problems and solve them by the simplex method (algorithm). We also look at the geometrical aspect and develop the mathematical theory of the simplex method. We further study problems which may be formulated using graphs and networks. These optimization problems can be solved by using linear or integer programming approaches. However, due to its graphical structure, it is easier to handle these problems by using network algorithmic approaches. Applications of LP and network optimization will be demonstrated. This course should help the student in developing confidence in solving many similar problems in daily life that require much computing.
Major topics: Introduction to LP: solving 2variable LP via graphical methods. Geometry of LP: polyhedron, extreme points, existence of optimal solution at extreme point. Development of simplex method: basic solution, reduced costs and optimality condition, iterative steps in a simplex method, 2phase method and BigM method. Duality: dual LP, duality theory, dual simplex method. Sensitivity Analysis. Network optimization problems: minimal spanning tree problems, shortest path problems, maximal flow problems, minimum cost flow problems, salesman problems and postman problems. 
Module Examinable : 


Exam Date : 
08052018 EVENING

Modular Credits : 
4 
Prerequisite : 
MA1101R or MA1306 or MA1311 or MA1508 or MA1506 or MA1508E or MA1513 
Preclusion : 
MQ2204, CS3252, IC2231, DSC3214, DSN3701, MA3235, BH3214, ISE students 
Module Workload (ABCDE)* : 
31006 
Remarks : 
Nil 
* 
A: no. of lecture hours per week
B: no. of tutorial hours per week
C: no. of laboratory hours per week
D: no. of hours for projects, assignments, fieldwork etc per week
E: no. of hours for preparatory work by a student per week
 
Class  Type  Week Type  Week Day  Start  End  Room 
SL1  LECTURE  EVERY WEEK  TUESDAY  1900  2200  LT26,


Class  Type  Week Type  Week Day  Start  End  Room 
Iteration 
T01  TUTORIAL  EVERY WEEK  WEDNESDAY  1800  1900  S170404,

Available in Tutorial Balloting [Iteration 2].

T02  TUTORIAL  EVERY WEEK  WEDNESDAY  1900  2000  S170404,

Available in Tutorial Balloting [Iteration 2].

T03  TUTORIAL  EVERY WEEK  THURSDAY  1000  1100  S170405,

Available in Tutorial Balloting [Iteration 2].

T04  TUTORIAL  EVERY WEEK  THURSDAY  1100  1200  S170405,

Available in Tutorial Balloting [Iteration 2].

T05  TUTORIAL  EVERY WEEK  FRIDAY  1100  1200  S170611,

Available in Tutorial Balloting [Iteration 2].

T06  TUTORIAL  EVERY WEEK  FRIDAY  1200  1300  S170611,

Available in Tutorial Balloting [Iteration 2].


