|
Vyučující
|
-
Calábek Pavel, RNDr. Ph.D.
|
|
Obsah předmětu
|
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.
|
|
Studijní aktivity a metody výuky
|
|
Přednášení, Dialogická (diskuze, rozhovor, brainstorming)
|
|
Výstupy z učení
|
Understand the basics of linear programming and its applications.
1. Knowledge Describe basic methods of linear programming.
|
|
Předpoklady
|
nespecifikováno
|
|
Hodnoticí metody a kritéria
|
Seminární práce
Colloquium: submit protocols with solutions to 3 tasks assigned sequentially during the semester, write a final paper and get at least half of the points in it.
|
|
Doporučená literatura
|
-
Brickman L. (1989). Mathematical Introduction to Linear Programing and Game Theory.
-
Dantzig G. B. Linear Programing and extansions.
-
Hadley G. (1962). Linear programing. Wesley.
-
Loomba, N. P. (1964). Linear programming : an introductory analysis. New York, McGraw-Hill Book Company, San Francisco, Toronto.
-
Strayer, J, K. (1989). Linear programming and its applications. New York.
-
Vanderbei, R. J. (2014). Linear programming: foundations and extensions. New York.
|