|
Lecturer(s)
|
|
|
|
Course content
|
Linear programming - economic interpretation of duality, dual simplex algorithm, integer programming, sensitivity analysis, bivalent programming. Graph theory - Critical Path Method - scheduling and balancing of sources, Hakimi's algorithm, Little's algorithm, map base conversion into the graph theory notation, mathematical models of problems. Dynamic programming. Location problems - hyperbolic approximation method, Elzinga's algorithm, median location of an object.
|
|
Learning activities and teaching methods
|
|
Monologic (reading, lecture, briefing), Dialogic (discussion, interview, brainstorming), Work with text (with textbook, with book)
|
|
Learning outcomes
|
Improvement and deepening of students' knowledge in the field of operational research, application of the methods in transport.
The student gets knowledge of solving methods for basic as well as more complex problems, learns the use of the methods in practical problems solving.
|
|
Prerequisites
|
Knowledge of operational research basic methods (graph theory, linear programming).
|
|
Assessment methods and criteria
|
Oral examination, Student performance assessment, Self project defence
The exam is oral with respect to the semestral work defence.
|
|
Recommended literature
|
-
Dantzig, George B. Linear programming.. New York: Springer-Verlag, 1997. ISBN 0-387-94833-3.
-
Dantzig, George B. Linear programming.. New York: Springer-Verlag, 2003. ISBN 0-387-98613-8.
-
Dudorkin, J. Operační výzkum.
-
Gass, S. I. Linear Programming, Methods and Applications, Dover Publications, Inc.,. 2003.
-
Jablonský, Josef. Operační výzkum : kvantitativní modely pro ekonomické rozhodování. Praha: Professional Publishing, 2002. ISBN 80-86419-23-1.
-
Linda, Bohdan. Lineární programování. Pardubice: Univerzita Pardubice, 2007. ISBN 978-80-7395-038-5.
|