460-4062 – Operational Research I (OV )

Gurantor departmentDepartment of Computer Science
Subject guarantordoc. MSc. Donald David Davendra, Ph.D.
Study levelundergraduate or graduate
Subject version
Version codeYear of introductionYear of cancellationCredits
460-4062/01 2013/2014 2014/2015 4

Subject aims expressed by acquired skills and competences

The aim of this course is to teach the basic deterministic and advanced stochastic methods for solving different complex combinatorial / discrete problems of an optimization nature. This course will also introduce different problems in transportation, assignment and scheduling, which are common and have a practical foundation. Upon completion of the course, the students will be able to solve, (by making use of various methods) various tasks from the area of production control and planning, logistics, routing etc. The emphasis will be also on obtaining the practical experience with solving the tasks from this area.

Teaching methods



Operations Research (OR) is a discipline of applying advanced analytical methods to help make better decisions. Also known as management science or decision science, it involves the application of information technology in designing systems to operate in the most effective way or deciding how to allocate scarce human resources, money, equipment, or facilities. This course will address the three different aspects of OR, which are: 1. Simulation: the ability to try out approaches and test ideas for improvement 2. Optimisation: Narrowing choices to the very best when there are virtually innumerable feasible options and comparing them is difficult 3. Probability and Statistics: measure risk, mine data to find valuable connections and insights, test conclusions, and make reliable forecasts. Lectures: 1. Linear programming formulation 2. Linear programming solution – graphical method 3. Linear programming solution – algebraic method 4. Simplex algorithm 5. Big-M Method 6. Two Phase Method 7. Simplex algorithm – Initialisation and Iteration 8. Simplex algorithm – Termination 9. Primal – Dual Relationship 10. Dual Simplex Algorithm 11. Introduction to Sensitivity Analysis 12. Transportation problem 13. Assignment problems 14. Hungarian Algorithm

Compulsory literature:

1. Taha Hamdy (2010) Operations Research: An Introduction (9th Edition). ISBN-13: 978-0132555937 2. Winston Wayne (2003) Operations Research: Applications and Algorithms. ISBN-13: 978-0534380588 3. Pinedo M. (2012) Scheduling: Theory, Algorithms, and Systems. Springer. ISBN-13: 978-1461419860

Recommended literature:

1. Marlow W. Mathematics for Operations Research. Dover Publications. ISBN-13: 978-0486677231


Subject has no prerequisities.


Subject has no co-requisities.