Authorised by Academic Registrar, April 1996
Objectives At the completion of this subject students should be able to formulate problems suitable for linear programming and some associated applications and techniques; be able to solve linear programming models both by hand computation and by using computer software; and have skills in interpreting the output and in making decisions based on post-optimal analyses.
Synopsis Model construction, graphical solution, simplex method, solution via software, M-method, infeasibility, unboundedness, alternative optimal solution, sensitivity analysis, duality, goal programming. Assignment, transportation and travelling salesman problems. Initial solution procedures. Integer programming, branch and bound, zero-one programming.
Assessment Examination (2 hours): 70% + Assignments (2): 20% + Test (1 hour): 10%