Transportation problems (Programming)
Enlarge text Shrink text-
Topic
- Work cat.: 97-34593: Rachev, S.T. Mass transportation problems, c1997.
- Math. subj. classif.(90-XX, Economics, Operations research, Programming, Games; 90Cxx, Mathematical programming; 90C08, Special problems of linear programming (transportation and multi-index problems, etc.))
- McGraw-Hill dict. sci. tech.(transportation problem: a programming problem that is concerned with the optimal pattern of the distribution of goods from several points of origin to several different destinations, with the specific requirements at each destination)
- Eisenreich. Mathematik(transportation problem, transport problem, GP [graph theory], PG [mathematical optimization (programming)])
- Encyc. dict. math.:p. 943, under Linear programming (transportation problem)
- Encyc. math.(transport problem, transportation problem)
In mathematics and economics, transportation theory or transport theory is a name given to the study of optimal transportation and allocation of resources. The problem was formalized by the French mathematician Gaspard Monge in 1781. In the 1920s A.N. Tolstoi was one of the first to study the transportation problem mathematically. In 1930, in the collection Transportation Planning Volume I for the National Commissariat of Transportation of the Soviet Union, he published a paper "Methods of Finding the Minimal Kilometrage in Cargo-transportation in space". Major advances were made in the field during World War II by the Soviet mathematician and economist Leonid Kantorovich. Consequently, the problem as it is stated is sometimes known as the Monge–Kantorovich transportation problem. The linear programming formulation of the transportation problem is also known as the Hitchcock–Koopmans transportation problem.
Read more on Wikipedia >