Linear Programming
Code | Completion | Credits | Range | Language |
---|---|---|---|---|
11LP | KZ | 3 | 2P+1C+12B | Czech |
- Garant předmětu:
- Karel Ječmen, Ivan Nagy, Šárka Voráčová
- Lecturer:
- Karel Ječmen, Ivan Nagy, Šárka Voráčová
- Tutor:
- Karel Ječmen, Ivan Nagy, Šárka Voráčová
- Supervisor:
- Department of Applied Mathematics
- 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 2023/2024:
- Time-table is not available yet
- Time-table for summer semester 2023/2024:
-
06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon Tue Wed Thu Fri - The course is a part of the following study plans:
-
- LOG bak.prez.19/20 (compulsory course in the program)
- LOG bak.prez.20/21 (compulsory course in the program)
- LOG bak.prez.20/21 (skok do 3.r.) (compulsory course in the program)
- LOG (obor) bak.prez.21/22 (skok do 3.r.) (compulsory course in the program)