|
Lecturer(s)
|
-
Kubera Petr, RNDr. Ph.D.
-
Moosaei Hossein, Dr. Ph.D.
|
|
Course content
|
1. Linear programming (LP) formulation and mathematical properties. 2-4. Solution of LP problems: graphical method, primal simplex method, big M method, duality theory in linear programming (dual simplex method) 5-7. The transportation and the assignment problem, travelling salesman problem, formulation, methods of solving (MODI method, Hungarian method, TSP as LP problem) 8-9. Project management and scheduling: CPM and PERT method, cost slope analysis 10-11. Introduction to the queueing theory, Kendall's notation, M/M/1 and M/M/m models 12-13. Complex models: M/M/1/k and M/M/m/k and their applications
|
|
Learning activities and teaching methods
|
|
unspecified
|
|
Learning outcomes
|
This course is focused on an introduction to optimal decision making. The topics covered in the course are: linear programming, projects management and scheduling methods and introduction to the queueing theory. As a problem base domain, examples from economy and informatics are taken. An integral part of the course is solving practical real-world problems with the use of appropriate software.
|
|
Prerequisites
|
Basics from linear algebra and analysis (differential calculus)
|
|
Assessment methods and criteria
|
unspecified
written test focused on solving examples together with seminar work and oral examination
|
|
Recommended literature
|
|