Course title | Optimal Decision Making |
---|---|
Course code | KI/EOPR |
Organizational form of instruction | Lecture + Lesson |
Level of course | Bachelor |
Year of study | not specified |
Semester | Winter |
Number of ECTS credits | 7 |
Language of instruction | English |
Status of course | unspecified |
Form of instruction | Face-to-face |
Work placements | This is not an internship |
Recommended optional programme components | None |
Course availability | The course is available to visiting students |
Lecturer(s) |
---|
|
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 |
unspecified
|
Assessment methods and criteria |
unspecified
Exam: written test focused on solving examples together with seminar work and oral examination Prerequisites: Basics from linear algebra and analysis (differential calculus) |
Recommended literature |
|
Study plans that include the course |
Faculty | Study plan (Version) | Category of Branch/Specialization | Recommended semester |
---|