Dopravní problém
Transportation problem
diplomová práce (OBHÁJENO)
![Náhled dokumentu](/bitstream/handle/20.500.11956/27649/thumbnail.png?sequence=7&isAllowed=y)
Zobrazit/ otevřít
Trvalý odkaz
http://hdl.handle.net/20.500.11956/27649Identifikátory
SIS: 48634
Kolekce
- Kvalifikační práce [11266]
Autor
Vedoucí práce
Oponent práce
Houda, Michal
Fakulta / součást
Matematicko-fyzikální fakulta
Obor
Pravděpodobnost, matematická statistika a ekonometrie
Katedra / ústav / klinika
Katedra pravděpodobnosti a matematické statistiky
Datum obhajoby
4. 6. 2009
Nakladatel
Univerzita Karlova, Matematicko-fyzikální fakultaJazyk
Čeština
Známka
Výborně
As a transportation problem we usually denote one of the classical problems of the linear programming. This is just a very special case of more general problem, which is sometimes called Kantorovich transportation problem. I describe Kantorovich problem and its solution in some special cases in this work. Particularly, I describe the solution of the problem with quadratic cost and the solution of the problem with concave cost on the real line, in detail. At the end of the text, I show how the solution of the general problem could be approximated by the solutions of linear task. I solve the problem with some common distributions and with three typical cost functions { linear, strictly convex and strictly concave.