352-0908/05 – System Analysis (SA)
Gurantor department | Department of Control Systems and Instrumentation | Credits | 10 |
Subject guarantor | prof. Ing. Miluše Vítečková, CSc. | Subject version guarantor | prof. Ing. Miluše Vítečková, CSc. |
Study level | postgraduate | Requirement | Choice-compulsory type B |
Year | | Semester | winter + summer |
| | Study language | English |
Year of introduction | 2014/2015 | Year of cancellation | |
Intended for the faculties | FS, HGF | Intended for study types | Doctoral |
Subject aims expressed by acquired skills and competences
Graph theory, shortest and longest path problems, CPM, PERT, signal flow graphs. Decision theory. Waiting-line problems. Linear programming, simplex method, transportation problems. Allocation problems. Inventory prob-lems. Replacement and renewal problems.
Teaching methods
Individual consultations
Project work
Summary
Graph theory, shortest and longest path problems, CPM, PERT, signal flow graphs. Decision theory. Waiting-line problems. Linear programming, simplex method, transportation problems. Allocation problems. Inventory problems. Replacement and renewal problems.
Compulsory literature:
Recommended literature:
RAVINDRAN, A., RAGSDELL, K. M., REKLAITIS, G. Engineering Optimization. Methods and Applications. Second Edition. John Wiley & Sons, Hoboken, 2006, ISBN-13 978-0-471-53814-9
Way of continuous check of knowledge in the course of semester
Kontrola zadaného projektu.
E-learning
Other requirements
Elaboration of the project.
Prerequisities
Subject has no prerequisities.
Co-requisities
Subject has no co-requisities.
Subject syllabus:
Linear optimization models, their algebraic and geometric representations, simplex method, sensitivity and duality. Network models, transportation problem, assignment model, duality in transportation problem, simplex technique for transportation. Shortest route in general network, shortest and longest routes for acyclic network. Dynamic programming in optimization of networks, CPM, PERT. Waiting line models. Single-server and multiple-server model with Poisson input and exponential service other queuing models.
Conditions for subject completion
Occurrence in study plans
Occurrence in special blocks
Assessment of instruction
Předmět neobsahuje žádné hodnocení.