ÚSI-REOPAAcad. year: 2020/2021
The course focuses mainly on the basic principles of operational research. First of all, students are familiarized with the fundamentals of linear programming (LP) and with methods of investigating LP problems. Lectures are supplemented with many examples of the practical use of LP – e.g. for the solution of the transportation problem, production optimisation, the optimisation of cutting plans, etc. Students are acquainted with the basic principles of network analysis - CPM, PERT, GERT, and others. Attention is paid to the fundamentals of queueing theory and its practical applications. Students will also be familiarized with the fundamentals of models for production schedules and inventory models.
Learning outcomes of the course unit
Students will be acquainted with the fundamental principles of the modelling of traditional managerial problems; they will learn the basic modelling principles suitable for well-structured and deterministic managerial problems. They will be able to apply individual operational analysis methods under company conditions.
The ability to solve equations and deal with graphical representations of functions, knowledge of derivation and integration. Knowledge of the fundamentals of the organization and managerial functions of a company.
Recommended optional programme components
Recommended or required reading
RAIS, K., DOSKOČIL, R. Operační a systémová analýza, CERM Brno, 2006.
RAIS, K.,DRDLA, M. Operační analýza - příklady. VUT-FP, 1995.
BECK, J.,LANGOVÁ, M., ZELINKA, J. Lineární modely v ekonomii. Praha: SNTL, 1982
CHURCHMAN, C., ACHOFF, R.,ARNOFF, E. Úvod do operačního výzkumu. Bratislava: Alfa, 1968
JABLONSKÝ, J. Operační výzkum. Kvantitativní metody pro ekonomické rozhodování, Professional Publishing, Praha, 2002
SMEJKAL,V., RAIS, K. Řízení rizik ve firmách a jiných organizacích, Grada, Publishing.,a.s. Grada, Praha, 2006.
LAPIN, L. Quantitative Methods for Business Decisions. San Diego, USA: Brace Harcourt College Publisher, 1994
Planned learning activities and teaching methods
Tuition takes place in the form of lectures and seminars. The lectures focus on the explanation of basic principles, the methods of the given discipline, problems and example solutions. The seminars mainly support practical mastery of the subject matter presented in lectures or assigned for individual study with the active participation of students.
Assesment methods and criteria linked to learning outcomes
Requirements for the exam: knowledge of the taught topics, ability to apply the presented methods in practice
Examination: written test; oral examination if necessary
Language of instruction
Basic terms concerning operational analysis, the systems approach, mathematical modelling, the graphical solution of LP tasks, linear programming, the simplex method. Transformation of a mathematical model into a canonical form, economic meaning of slack variables, initial basic solution, optimality test, transformation to a new basic solution, temporary variables, extended model.
The STORM programme system, the transportation problem: introduction to issues concerned with the transportation problem, approximation methods – the ascending index method, Vogel´s approximation method, an example of a solution of a transportation problem from real-world practice. Post-optimisation analysis. Case study.
Methods of network analysis - CPM, PERT, GERT, time analysis of a node-defined network graph, practical uses of the studied methods, case studies
Inventory models - deterministic model
Queueing system - basic terms
Models of production schedules (Johnson’s algorithm)
The main objective of the course is to familiarise students with the basic optimisation methods applicable for managerial decision-making, and to develop their skills for the application of this knowledge to the finding of solutions to practical organizational and economic problems in a company.
Specification of controlled education, way of implementation and compensation for absences
The results of independent written projects will be checked.