Linear Programming

Course guarantor:

Lecturer:

Tutor:

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:

Further information:

No time-table has been prepared for this course

The course is a part of the following study plans:

• Bachelor TET-LOG Full-Time from 2022/23 (compulsory course in the program)
• Bachelor TET-LOG Full-Time from 2023/24 (compulsory course in the program)
• Bachelor TET-LOG Full-Time from 2024/25 (compulsory course in the program)
• Bachelor TET-LOG Part-Time from 2025/26 (compulsory course in the program)