Operation Research
Section outline
-
Tento výstup lze užít v souladu s licenčními podmínkami Creative Commons BY-SA 4.0 International
(http://creativecommons.org/licenses/by-sa/4.0/legalcode).
-
For more details about the course - the syllabus, requirements, literature and so on, see the course in STAG system - Operations Research KMI/OAA.
-
Introduction to Operation research including short history of this subject.
-
Introduction to linear optimization. Construction of mathematical models.
Practice: Formulate mathematical models for given examples.
-
Graphical solution of linear optimization problems. Feasible solution, optimal solution, problem of unbounded objective function.
Practice: If it is possible, solve (in graphical way) problems given in the previous part. If not, explain why it is not possible.
-
Theory of simplex method, using of SW for solution of LO problems.
Practice: Solve the given LO problems in software. Interpret the solution.
-
Interpretation of LO solution. Post-optimality analysis.
Practice: Develop the post-optimality analysis for above given problems.
-
Introduction to Multiple Criteria Decision Making (MCDM) methods. Introduction to terminology, basic properties of MCDM methods.
Practice: Use your own problem to solve. Identify criteria, find possible alternatives, develop the decision matrix, if it is necessary suggest missing data values and explain your suggestion. Identify dominated alternatives.
-
Pareto optimality. Construction of weights for MCDM. Classification of methods for MCDM.
Practice: Construct weights for your problem. Use all studied methods.
-
Methods for MCDM -- lexicographical method, point method, WSA, TOPSIS.
Practice: Apply all studied methods to solve your problem. What is your conclusion?
-
Introduction to Data Envelopement Analysis (DEA). 1 -1 models (1 input, 1 ouput).
Practice: Solve Problem 1.
-
2 - 1 and 1 - 2 models (2 inputs and 1 output; 1 input and 2 outputs models) and graphical solution.
Practice: Solve Problems 2, 3.
-
Using of LO in DEA - models for general number of inputs and outputs. Postoptimization analysis.
Practice: Solve Problems 4 and 5.
-
Construction of project networks, duration of the project, critical path.
Practice: Apply CPM to given problems.
-
Including of stochastic activity duration. Expected duration of the project, probabilities of finishing project in time.
Practice: Apply PERT method to the above given problems.
-
Time-Cost Trade-Offs. Using Linear Programming to Make Crashing Decisions.
Practice: Solve Problem no. 4.
-
Materials for exam.