| Course Unit Code | 157-0590/02 |
|---|
| Number of ECTS Credits Allocated | 4 ECTS credits |
|---|
| Type of Course Unit * | Choice-compulsory |
|---|
| Level of Course Unit * | First Cycle |
|---|
| Year of Study * | |
|---|
| Semester when the Course Unit is delivered | Summer Semester |
|---|
| Mode of Delivery | Face-to-face |
|---|
| Language of Instruction | English |
|---|
| Prerequisites and Co-Requisites | Course succeeds to compulsory courses of previous semester |
|---|
| Name of Lecturer(s) | Personal ID | Name |
|---|
| ZAP149 | doc. Mgr. Ing. František Zapletal, Ph.D. |
| Summary |
|---|
|
| Learning Outcomes of the Course Unit |
|---|
The aims of the subject is as follows:
- to provide fundamentals of a systems approach;
- to present the classification of methods of the Operations research;
- to provide fundamentals in economic-mathematical modeling using the OR methods;
- to present selected methods of network analysis and their applications in
project management;
- to present the basics of mathematical optimization, in particular the linear
programming;
- to make participants familiar with SW products which can be used to solve OR
problems efficiently;
- to learn the participants how to provide the sensitivity analysis and how to
interpret the results of modelling. |
| Course Contents |
|---|
The aim of the subject is to learn students how to think systemically, how to analyze the problem and, also, how to find the optimal decision/solution. Economic-mathematical models are used to solve real practical problems which are solved using information technologies. Two basic methods are presented to students: mathematical programming and network analysis. The outline of the subject is as follows:
1) Operational research - basic description, properties, classification.
2) Mathematical programming - structure of the model, methodology.
3) Linear programming - structure of the model, areas of application.
4) Linear programming - Graphical solution of LP problems.
5) Linear programming - canonical form of the model.
6) Linear programming - simplex method - algorithm and its description.
7) Linear programming - duality: usage and interpretation.
8) Linear programming - sensitivity analysis of LP results.
9) Multi-criteria linear programming
10) Network analysis - CPM method and its properties.
11) Network analysis - Network chart, reserves, critical path.
12) Network analysis - Feasibility of the project, cost analysis.
13) Network analysis - Gant linear diagram.
14) Network analysis - PERT method - involving the risk into projects. |
| Recommended or Required Reading |
|---|
| Required Reading: |
|---|
TAHA, Hamdy A. Operations research: an introduction. 9th ed., international ed. Upper Saddle River: Pearson, c2011. ISBN 978-0-13-139199-4.
WISNIEWSKI, Mik. Quantitative methods for decision makers. 5th ed. Harlow: Financial Times Prentice Hall, 2009. ISBN 978-0-273-71207-7.
PANNEERSELVAM, Robert. Operations research. 2nd ed. New Delhi: PHI Learning, 2012. ISBN 978-81-203-2928-7.
|
TAHA, Hamdy A. Operations research: an introduction. 9th ed., international ed. Upper Saddle River: Pearson, c2011. ISBN 978-0-13-139199-4.
WISNIEWSKI, Mik. Quantitative methods for decision makers. 5th ed. Harlow: Financial Times Prentice Hall, 2009. ISBN 978-0-273-71207-7.
PANNEERSELVAM, Robert. Operations research. 2nd ed. New Delhi: PHI Learning, 2012. ISBN 978-81-203-2928-7.
|
| Recommended Reading: |
|---|
BIRGE, John R. a LOUVEAUX, François. Introduction to stochastic programming. 2nd ed. New York: Springer, c2011. ISBN 978-1-4614-0236-7.
PRÉKOPA, András. Stochastic programming. Dordrecht: Kluwer Academic Publishers, c1995. ISBN 0-7923-3482-5. |
BIRGE, John R. a LOUVEAUX, François. Introduction to stochastic programming. 2nd ed. New York: Springer, c2011. ISBN 978-1-4614-0236-7.
PRÉKOPA, András. Stochastic programming. Dordrecht: Kluwer Academic Publishers, c1995. ISBN 0-7923-3482-5. |
| Planned learning activities and teaching methods |
|---|
| Lectures, Tutorials |
| Assesment methods and criteria |
|---|
| Tasks are not Defined |