The transportation problem is a special type of linear programming problem where the objective is to minimise the cost of distributing a product from a number of sources (Bj) or origins to a number of destinations (Ai).
- Validating for a closed task
- First Base plan is calculated by Northwest corner method
- Checking the Base plan on degeneracy
- Improvement method of Base plan is the Potentials method
- Optimality criterion: min or max [default: "min"]
- The input data from a csv-file with a tab delimiter making by manually copy table from Excel to it
http://matecos.ru/mat/matematika/kak-reshit-transportnuyu-zadachu-2.html