| Description | Weighting (%) |
1. Introduction to Linear Programming History of OR, prototype problems, the systems approach to problem solving, methodology of OR. Linear programming will be introduced through a variety of applications, leading to a general definition of an L.P. problem. Graphical solution of problems with 2 decision variables will be shown and the corner point method will be used for solving problems with a 2 or more decision variable. An elementary presentation of sensitivity analysis will be given.
| 10.00 |
2. Simplex Method The canonical and standard forms of L.P. problems will be discussed and the concept of slack and surplus variables introduced. Basic and non-basic variables will be introduced via 2-dimensional problems, leading to a discussion of the general case. The simplex method will then be studied and applied to all cases. The cases of infeasible and unbounded problems, and problems with an infinite number of solutions will be examined.
| 17.00 |
3. Duality The idea of the dual of an L.P. problem will be introduced, and the relationships between the primal and dual problems studied.
| 12.00 |
4. Sensitivity Analysis It will be emphasised that the solution obtained is dependent on the values of the parameters being known precisely, whereas in fact these parameters are only estimates and/or liable to change. The effect on the solution of changing the objective function or constraints will be studied along with the introduction of new constraints and variables.
| 12.00 |
5. Transportation and Assignment Problems The special case of L.P. problems which can be formulated as transportation or assignment problems will be studied, using more efficient methods of solving these problems. Transportation problems studied will include those requiring dummy sources and destinations, and a variety of starting procedures will be considered. The Hungarian method will be used in solving assignment problems
| 20.00 |
6. Integer Programming Applications of pure and mixed integer programming will be introduced and the branch and bound method will be introduced.
| 9.00 |
7. Networks Elementary graph theory will be introduced to provide a basis for the use of networks to model a variety of problems. Critical path, shortest route, minimal spanning tree and maximal flow problems will be studied
| 20.00 |