Linear programming
4 points * 2 hours of classes/computer laboratory per week * First semester * Caulfield * Prerequisites: Any first-year mathematics subject * Prohibitions: GAS2711
Objectives At the completion of this subject students will be able to formulate problems suitable for linear programming and some associated applications and techniques; solve linear programming models both by hand computation and using computer software, and develop skills in interpreting the output; make 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): 75% * Assignment: 10% * Test (1 hour): 15%
Recommended texts
Lee S M and others Management science 3rd edn, Allyn and Bacon, 1990
| Published by Monash University, Clayton, Victoria
3168 Copyright © Monash University 1996 - All Rights Reserved - Caution Authorised by the Academic Registrar December 1996 |