|
Lecturer(s)
|
-
Calábek Pavel, RNDr. Ph.D.
|
|
Course content
|
1. Convex sets in n-dimensional Euclid space. 2. General problem of linear programming, special cases. 3. Graphical method of solving the PLP, the simplex method. 4. Duality in linear programming. 5. Modified simplex method. 6. Dual simplex method. 7. Distribution problem, applications of linear programming.
|
|
Learning activities and teaching methods
|
|
Lecture, Dialogic Lecture (Discussion, Dialog, Brainstorming)
|
|
Learning outcomes
|
Understanding to base of linear programming and its applications.
1. Knowledge Describe basic methods of linear programming.
|
|
Prerequisites
|
unspecified
|
|
Assessment methods and criteria
|
Seminar Work
Colloquium: the student has to solve 3 LP problems (homework) assigned during the course and has to pass one written test (i.e. to obtain at least half of the possible points).
|
|
Recommended literature
|
-
Dantzig G. B. (1966). Lineárne programovanie a jeho rozvoj. SVTL, Bratislava.
-
Gass S. I. (1965). Lineárne programovanie. SVTL, Bratislava.
-
Plesník J., Dupačová J., Vlach M. (1990). Lineárne programovanie. Alfa, Bratislava.
-
Švrček J. (1995). Lineární programování v úlohách. UP Olomouc.
|