Linear Programming
| Code | Completion | Credits | Range | Language |
|---|---|---|---|---|
| 611LP | KZ | 3 | 2P+1C+12B | Czech |
- Course guarantor:
- Ivan Nagy, Pavla Pecherková, Šárka Voráčová
- Lecturer:
- Ivan Nagy, Pavla Pecherková, Šárka Voráčová
- Tutor:
- Ivan Nagy, Pavla Pecherková, Šárka Voráčová
- Supervisor:
- Department Děčín
- Synopsis:
-
Formulation of the problem of linear programming, transcription of some practical problems to the linear programming problems. Simplex and convex polyedra. Simplex method, basic solutions, duality principle in linear programming, stability of solution of linear programming problem. Traffic problem.
- Requirements:
-
differential calculus, linear algebra
- Syllabus of lectures:
- Syllabus of tutorials:
- Study Objective:
-
To acquaint students with the method of linear programming and types of practical problems, which can be solved using this method.
- Study materials:
-
Linda B., Volek J.: Lineární programování, univerzita Pardubice, 2009
Brázdová M.: Řešené úlohy z lineárního programování, univerzita Pardubice, 2011
Tuzar A., Maxa P., Svoboda V.: Teorie dopravy, skriptum FD ČVUT, Praha, 1997
Švrček J.: Lineární programování v úlohách, skriptum PřF, Olomouc, 2003
- Note:
- Time-table for winter semester 2024/2025:
- Time-table is not available yet
- Time-table for summer semester 2024/2025:
- Time-table is not available yet
- The course is a part of the following study plans:
-
- KOMBI bak. studium od 22-23 (specializace LOG) (compulsory course)
- KOMBI bak. studium od 23-24 (specializace LOG) (compulsory course)