Skip to main content
Skip header

Operations Research I

Type of study Follow-up Master
Language of instruction English
Code 460-4121/04
Abbreviation OV I
Course title Operations Research I
Credits 5
Coordinating department Department of Computer Science
Course coordinator doc. Ing. Lenka Skanderová, Ph.D.

Subject syllabus

Lectures:
=========
1. Introduction into operations research
2. History of operations research, impact for practical applications
3. Basic areas of operations research
4. Types of problems, application domains
5. Mathematical modelling, parameter optimization
6. Linear programming
7. Applications of linear programming
8. Traffic and distribution problems
9. Fundamentals of graph theory, graph paths, network flows
10. Bound variables, simplex algorithm
11. One dimensional cutting stock problem
12. Dantzing-Wolfe decomposition algorithm
13. Primal-dual algorithm
14. Multiobjective problems, formulation of goal programming

Seminars:
========
1. Implementation of the simplex method
2. Application of the simplex method to problems with bound variables
3. Representation of a graph, adjacency matrix
4. Implementation of the  Dantzig-Wolfe algorithm
5. Implementation of the primal-dual algorithm
6. Implementation of goal programming
7. Travelling salesman problem
8. Vehicle routing problem
9. Capacitated vehicle routing problem
10. Network flow maximization problem
11. Minimum cost flow problem
12. Knapsack problem
13. Job shop scheduling problem
14. Assignment problem

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
[4] Hillier, F. S. (2012): Introduction to operations research. Tata McGraw-Hill Education. ISBN: 0072321695 

Advised literature

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