OR202     
Operational Research Methods

This information is for the 2013/14 session.

Teacher responsible

Dr Giacomo Zambelli NAB 3.36

Availability

This course is compulsory on the BSc in Management Sciences. This course is available on the BSc in Accounting and Finance, BSc in Business Mathematics and Statistics, BSc in Econometrics and Mathematical Economics, BSc in Economics, BSc in Management, BSc in Management and BSc in Statistics with Finance. This course is available as an outside option to students on other programmes where regulations permit and to General Course students.

Pre-requisites

Mathematics, Statistics and Probability Theory to the level of the courses Quantitative Methods and Introduction to Statistics for Accounting and Finance is required. In particular, students should have covered elementary distribution theory and the Poisson Process, and have an elementary knowledge of linear algebra. Students must be prepared to use computer packages when required. A further course OR301 Model Building In Operational Research which extends the Mathematical Programming component and covers Simulation in some detail may be taken after or in conjunction with this course.

Course content

An introduction to all the main theoretical techniques of Operational Research. OR202.1 Operational Research Techniques. Some methodological aspects of operational research, and some of the main OR techniques, including: Critical Path Analysis, Production, Scheduling, Markov Chains, Queueing Theory, Replacement, Simulation, Stock Control, Dynamic Programming, Decision Theory, Theory of Games. OR202.2 Mathematical Programming. Linear programming: from the most basic introduction to sufficient conditions for optimality; duality; sensitivity of the solution; discovery of the solution to small problems by graphical methods, and proof of optimality by testing the sufficient conditions; solution to larger problems by using a computer package. The transportation programme: properties of solution, connection with graph theory, an algorithm for hand computation. Full lecture notes are provided.

Teaching

20 hours of lectures and 18 hours of classes in the MT. 10 hours of lectures, 13 hours of classes and 5 hours of computer workshops in the LT. 5 hours of lectures and 3 hours of classes in the ST.

Please note that lectures and classes are divided between the two parts of the course (OR202.1 and OR202.2), and that the computer workshops are optional help sessions.

Indicative reading

Recommended books are H G Daellenbach, J A George & D C McNickle, Introduction to Operations Research Techniques, Allyn & Bacon; A Ravindran, D T Philips & J J Solberg, Operations Research; H P Williams, Model Building in Mathematical Programming, Wiley; H P Williams, Model Solving in Mathematical Programming, Wiley; Wayne L Winston, Operations Research, Duxbury Press.

Students may also wish to consult R L Ackoff & M W Sasieni, Fundamentals of Operations Research; N A J Hastings, Dynamic Programming with Management Applications; F S Hillier & G J Lieberman, Operations Research; E Page, Queueing Theory in OR; M Sasieni, A Yaspan & L Friedman, Operations Research: Methods and Problems.

Assessment

Exam (100%, duration: 3 hours and 15 minutes) in the main exam period.

Key facts

Department: Management Science Group

Total students 2012/13: 276

Average class size 2012/13: 15

Value: One Unit

Guidelines for interpreting course guide information

PDAM skills

  • Self-management
  • Problem solving
  • Application of information skills
  • Communication
  • Application of numeracy skills