Authorised by Academic Registrar, April 1996
Objectives On completion of this subject students will be able to describe the structure and various categories of linear programming models; recognise the need for a mathematical solution algorithm and be able to use this algorithm; describe and use the primal-dual relationship; perform a detailed sensitivity analysis with respect to changes in the coefficients in the objective function or the available resources; model integer programs, and apply various techniques to generate integer solutions; compare and contrast a linear program and a goal program; formulate and solve goal programming models.
Synopsis This subject aims to develop the ability to formulate management decision problems as linear programming models or discrete mathematical programming models; to introduce mathematical solution procedures and the use of computer software; to develop a basis for interpreting solutions and to emphasise the need for sensitivity analysis and flexibility of models. Topics include building linear programming models; general characteristics and review of the graphical solution method; the simplex method including negative variables and artificial variables, and the two-phase method; duality and the primal-dual relationship; post-optimality analysis including change in objective function coefficients or constraint resources, addition of a new constraint or a new decision variable; parametric linear programming; linear goal programming models and methods of solutions; integer programming models - use of discrete variables, cutting plane and branch and bound methods of solutions; applications including transportation and transshipment models; use of computer packages to solve LP and IP problems.
Assessment Two assignments: 40% + Examination: 60%