Přístupnostní navigace
E-application
Search Search Close
Course detail
FEKT-DKA-TK1Acad. year: 2023/2024
This study unit is made of two main parts. The first part deals with various currently used optimization methods. Students are first introduced to general Optimization theory. Then various forms of Mathematical Programming are dealt with. After the introduction into Linear and Integer Programming, the attention is given to Nonlinear Programming from its backgrounds like Convexity Theory and optimization conditions to overview and practical use of various optimization algorithms. A practically oriented introduction into Dynamic Programming with finite horizon follows. Students are also introduced into backgrounds of Stochastic Programming and Dynamic programming with infinite horizon, in particular to methods of solving Bellman's equations. The first part is closed by introduction to heuristic optimization algorithms.The second part of the unit deals with the Queuing Theory. Various models of single queue systems and queuing networks are derived. The theory is then used by solving practical problems. Students are also introduced into simulation methods that are the only feasible solution method when a theoretical model is not available.
Guarantor
Department
Offered to foreign students
Learning outcomes of the course unit
Prerequisites
Co-requisites
Recommended optional programme components
Literature
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
Language of instruction
Work placements
Course curriculum
Aims
Classification of course in study plans
Guided consultation
Teacher / Lecturer