Rosetta Code

Transportation problem: Difference between revisions

Page Discussion

Transportation problem (view source)

Revision as of 08:02, 12 July 2016

532 bytes removed ,  7 years ago
m
shortened task description, added related tasks section
m (shortened task description, added related tasks section)
Line 1:
{{draft task}}
The '''[[wp:Transportation_theory_%28mathematics%29|Transportationtransportation problem]]''' in linear programming is to find the optimal transportation plan for certain volumes of resources from suppliers to consumers, taking into account the cost of transportation. The plan is a table (matrix), whose rows and columns correspond to the suppliers and consumers, the cells are placed in cargo volume.
 
Example of the transportation problem:
<centerbr><br>
 
{| border="1" style="border-collapse: collapse; border: 1px solid black; text-align: center;"
|-
Line 21 ⟶ 22:
|$5 per kg
|}
</center>
 
<br><br>
 
The programobject is to solve the classical transport problem using the method of potentials (with redistributive cycle) with the preparation of the initial transportation plan by the north-west corner of the features to be implemented in this task. The input is the number of suppliers and customers, inventory levels, needs and cost matrix transport cargo. The output of the program is the optimal plan. If necessary, enter a fictitious vendor or customer.▼
For the first time this problem mathematically studied the Soviet mathematician A. N. Tolstoy. In 1930 he published his work on finding the minimum total mileage in rail transportation, which used the redistributive cycles. The main contribution to the development of the mathematical apparatus of the transport problem introduced Soviet economist L. V. Kantorovich during the Great Patriotic War (published in 1939 and 1942). The way to solve the transportation problem by the potential method was it published in conjunction with M. K. Gavurin in 1949.
 
▲The program is to solve the classical transport problem using the method of potentials (with redistributive cycle) with the preparation of the initial transportation plan by the north-west corner of the features to be implemented in this task. The input is the number of suppliers and customers, inventory levels, needs and cost matrix transport cargo. The output of the program is the optimal plan. If necessary, enter a fictitious vendor or customer.
 
The solution for the above example would be the plan:
<centerbr><br>
 
{| border="1" style="border-collapse: collapse; border: 1px solid black; text-align: center;"
|-
Line 47 ⟶ 46:
| 5 kg
|}
</centerbr><br>
 
;<nowiki>See also:</nowiki>
* [http://orms.pef.czu.cz/text/transProblem.html The Transportation Problem]
<br><br>
* [[Vogel's approximation method]]▼
 
; Related tasks:
▲* [[Vogel's approximation method]]
<br><br>
 
=={{header|1C}}==
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/232183"