1. Operations research – systemic basis for the quantitative approach to decision making. Development and systemic characteristics of the operations research. Economic-mathematical modeling. IT and software support. Methods of the operations research and their classification. Applicability of the subject for real-situation problems solving.
2. Optimization methods, linear programming (LP), principles of mathematical models designing.
3. Basic problems of LP and their characteristics. General model of LP problem.
4. LP problems solving and interpretation. Basic principles for models solving, simplex method.
5. Problem of duality and efficiency of LP problems. Sensitivity analysis of the optimal solution – sensitivity to change of right-hand-side coefficients of constraints, objective function coefficients, adding and removing variables or constraints.
6. Distribution problems. Characteristics of basic problem – balanced and unbalanced problem, basic solution, methods of optimization.
7. Multi-objective programming (dominated/non-dominated solution, aggregation of objective functions using the weights, compromise solution).
8.Introduction to the graph theory,network analysis – possible areas for application, basic terminology and methods. Methodology for network graphs designing.
9. Time analysis in network graphs. Time demands of projects, dates of project activities, critical path, reserves of activities, critical path analysis.
10. Resources analysis. Problem of resource consuption minimizing, project schedule optimization.
11. PERT method (differences from CPM method, probability distribution, involving the risk into network analysis).
2. Optimization methods, linear programming (LP), principles of mathematical models designing.
3. Basic problems of LP and their characteristics. General model of LP problem.
4. LP problems solving and interpretation. Basic principles for models solving, simplex method.
5. Problem of duality and efficiency of LP problems. Sensitivity analysis of the optimal solution – sensitivity to change of right-hand-side coefficients of constraints, objective function coefficients, adding and removing variables or constraints.
6. Distribution problems. Characteristics of basic problem – balanced and unbalanced problem, basic solution, methods of optimization.
7. Multi-objective programming (dominated/non-dominated solution, aggregation of objective functions using the weights, compromise solution).
8.Introduction to the graph theory,network analysis – possible areas for application, basic terminology and methods. Methodology for network graphs designing.
9. Time analysis in network graphs. Time demands of projects, dates of project activities, critical path, reserves of activities, critical path analysis.
10. Resources analysis. Problem of resource consuption minimizing, project schedule optimization.
11. PERT method (differences from CPM method, probability distribution, involving the risk into network analysis).