Operations Research

Major: Intelligent Information Technologies
Code of subject: 6.126.01.E.091
Credits: 5.00
Department: Information Systems and Networks
Lecturer: Ph.D., Associate Professor Katrenko Anatolii
Semester: 5 семестр
Mode of study: денна
Learning outcomes: • know mathematical foundations and models of mathematical operation analysis, theirs current state and practical application methodology; • be able to fulfil a meaningful problem statement and create the formal mathematical model, to select or construct the algorithm to determine the optimal problem solution, to analyze the results.
Required prior and related subjects: Linear algebra and analytical geometry Discrete Mathematics Algorithmization and Programming Calculus
Summary of the subject: The basic concepts of operations research. The deterministic and stochastic optimization models and the basic approaches to their solution. The multi-objective problem and its solutions. The concept of algorithm complexity. The linear programming. The simplex method and its modifications. Duality. The concept of direct and dual problems. The dual simplex method. The transportation problems. The potential theory. The integer programming. The Gomory method. The branch and bound scheme and its basic structural elements. The flow problems. The Ford-Fulkerson theorem. The Maximum flow problem. The overview of the game solving algorithms. The matrix games. The concept of cooperative games. The decision making under uncertainty. The method of dynamic programming. The Bellman's Principle of Optimality. The nonlinear programming. The method of Lagrange multipliers. The optimal algorithms for search of extrema of the constraint and non-constraint functions.
Assessment methods and criteria: • written reports on laboratory work, oral examination, in written (40%) • Final control of (exam): in written, verbally (60%).
Recommended books: 1. Катренко А.В. Дослідження операцій. / А.В. Катренко – Львів: «Магнолія 2006», 2014. – 350с. 2. Таха Х. Введение в исследование операций / Х. Таха – М.: «Вильямс», 2001. – 911с. 3. Филипс Д. Методы анализа сетей / Д. Филипс, А. Гарсия-Диас – М.: Мир, 1984. – 496с. 4. Иенсен П. Потоковое программирование / П. Иенсен, Д.Барнес – М.: Мир, 1984. – 392с.