Transportation problem calculator: the cheapest shipping plan, solved and checked
Plants with supplies, markets with demands, and a cost per unit for each route: find how much to ship on each route at the lowest total cost. Edit the costs, supplies and demands below and solve, no account needed. The plan comes from a real LP solver and is checked against every supply and demand.
Solve it here
The example below is the Transportation problem worked example; its saved answer, checked by the solver, is 465 (optimal).
How to type it
- First line:
maximizeorminimizeand the objective, such as3*a + 2*b. - Then
subject toand one constraint per line with<=,>=or=. a, b >= 0for nonnegative variables;integer: aorbinary: zfor whole-number or yes/no ones.- Lines starting with
#are notes, such as what a variable means.
What you get here
- how many units to ship on each route, and the total cost
- a check that every supply and demand holds
- the proof label: exactly proven optimal
With a free account: the full step-by-step walkthrough, word problems, photos and voice, and your history.
Worked examples
- Transportation problem
- Dual of a transportation problem
- Minimum-cost network flow
- Two-stage supply chain
Questions
What if supply and demand are not equal?
Write supplies as <= (ship at most what a plant has) and demands as >= or =; the solver handles the difference, or says the problem is infeasible if demand cannot be met.
Does it use the northwest corner or VAM method?
No: it solves the whole problem as a linear program, so the plan is optimal, not a starting guess.
More: all calculators · 50 solved examples · what the app solves
Try ProvenDecisions free: type, photograph or say an optimization problem; every answer is checked by a solver.