VŠTE:N_KVM Quantitative Methods - Course Information
N_KVM Quantitative Methods
Institute of Technology and Business in České Budějovicewinter 2018
- Extent and Intensity
- 0/2/0. 3 credit(s). Type of Completion: z (credit).
- Teacher(s)
- Mgr. Vladislav Biba, Ph.D. (seminar tutor)
Ing. Jiří Čejka, Ph.D. (seminar tutor) - Guaranteed by
- Mgr. Vladislav Biba, Ph.D.
Department of Informatics and Natural Sciences – Faculty of Technology – Rector – Institute of Technology and Business in České Budějovice
Supplier department: Department of Informatics and Natural Sciences – Faculty of Technology – Rector – Institute of Technology and Business in České Budějovice - Timetable of Seminar Groups
- N_KVM/L5: Sat 3. 11. 8:00–9:30 B5, 9:40–11:10 B5, 11:25–12:10 B5, Sat 15. 12. 13:50–14:35 B5, 14:50–16:20 B5, 16:30–18:00 B5, V. Biba
N_KVM/S01: Tue 13:05–14:35 D616, J. Čejka - Course Enrolment Limitations
- The course is offered to students of any study field.
- Course objectives supported by learning outcomes
- The aim of this course is to introduce the students to the quantitative methods with respect to the logistic processes, particulary: linear optimization (simplex method, two-step simplex method, duality), so-called transportation problem (finding basic feasible solution, improvement method) and basics of queuinq theory.
- Learning outcomes
- After the successful completing of the course, the student solves advanced tasks related to linear programming and graph theory (transportation problem, travelling salesman problem, shortest path).
- Syllabus
- 1. Introduction to the quantitative methods, applications 2. Linear programming (standard and graphics solution). 3. Linear programming (simplex method, duality). 4. Parametric linear programming. 5. Transportation problem (Indexing method, Vogel method, …). 6. Transportation problem(Modified distribution method). 7. Assignment problem (Hungarian algorithm). 8. Circular transportation problem – Travelling salesman problem. 9. Queuing theory and its applications. 10. Renewal theory. 11. Supply theory.. 12. Fuzzy modelling, Genetics algorithms, Neurons net, Soft computing. 13. Alternative quantitative methods and using in logistics.
- Literature
- required literature
- LINDA, Bohdan and Josef VOLEK. Lineární programování. Vyd. 4. Pardubice: Univerzita Pardubice, 2011, 139 s. ISBN 978-80-7395-426-0. info
- VOLEK, Josef. Operační výzkum I. Vyd. 2., nezměn. Pardubice: Univerzita Pardubice, 2008, 111 s. ISBN 978-80-7395-073-6. Obsah info
- recommended literature
- ZIMOLA, Bedřich. Operační výzkum, Brno: VUT v Brně, 2000. ISBN 80-214-1664-5
- Forms of Teaching
- Exercise
- Teaching Methods
- Frontal Teaching
Individual Work– Individual or Individualized Activity
- Student Workload
Activities Number of Hours of Study Workload Daily Study Combined Study Preparation for the Mid-term Test 13 18 Preparation for Seminars, Exercises, Tutorial 26 26 Preparation for the Final Test 13 26 Attendance on Seminars/Exercises/Tutorial/Excursion 26 8 Total: 78 78 - Assessment Methods and Assesment Rate
- Test – mid-term 30 %
Test – final 70 % - Exam conditions
- First Test: maximum 30% (0-30 points). Final Test: maximum 70% (0-70 points). Successful graduates of the course have to get totally at least 70 points. Possibility to repeat the test: 69,99 – 30, not fulfilled 29,99 – 0.
- Language of instruction
- Czech
- Enrolment Statistics (winter 2018, recent)
- Permalink: https://is.vstecb.cz/course/vste/winter2018/N_KVM