The student will learn how to solve a variety of linear programming problems which are the basis of a scientific approach to optimisation of management problems.
LINEAR PROGRAMMING PROBLEMS
Introduction to variables, constraints and objectives. Turning information into sets of Constraint Inequalities. Classical Examples.
TWO VARIABLE PROBLEMS
Two dimensional problems and their graphical solution. Integer Programming in 2D. Feasible region, binding constraints and scarce resources. Sensitivity analysis.
NETWORK PROBLEMS
Network diagrams. Minimal span problems. Shortest route problems. Maximal flow problems. Representation of transportation problems using networks.
TRANSPORTATION AND ASSIGNMENT PROBLEMS
Transportation problems. Initial feasible solution - Vogel's approximation method. Improving the solution. The stepping stone method. The modified distribution method. Assignment problems. The Hungarian method. Maximisation problems.
| Module Content & Assessment | |
|---|---|
| Assessment Breakdown | % |
| Other Assessment(s) | 30 |
| Formal Examination | 70 |