Balanced Transportation Cost Planner
Allocate integer supply to integer demand over declared routes and return a checked minimum-cost shipment matrix.
Loading tool…
How to use Balanced Transportation Cost Planner
Build a capacitated supply-demand network and repeatedly augment a shortest residual route, allowing earlier shipments to be rerouted. Exact costs preserve ties, while the final allocation verifies every supply and demand total.
- Enter model json (schema and units below).
- Choose the stated convention and check the units and supported model.
- Calculate, inspect the result, then copy or download it.
Good to know
- Plain decimal JSON numbers or strings, at most six fractional places, magnitude at most 1,000,000,000; raw numeric spellings and duplicate object members are checked. Exact rational arithmetic is capped at 8,192 bits. Text is at most 30,000 characters; a local JSON download preserves exact fractions or full stored approximate numbers. Up to 10 sources and 10 destinations; nonnegative whole supply/demand with equal positive total at most 10,000. Cost matrix matches dimensions, with nonnegative costs at most 1,000,000 or null for forbidden routes. At most 1,000 augmentations. No transit, fixed setup, route capacity, timing or real-world feasibility is inferred.
- Local calculation only; no input persistence or external lookup. Text/JSON is limited to 30000 characters and output to 1000000 characters. Numeric model inputs and precision/work limits are stated on this page. Approximate JSON numbers retain full stored values; exact arithmetic outputs retain decimal or fraction strings. Unsupported states fail explicitly.
- Educational user-assumption arithmetic only. No live prices, laws, tax rules, quotes or financial advice.
Common questions
Can a cheap route be unavailable?
Yes. Use null rather than a large artificial cost. If the remaining declared network cannot fulfill all balanced supply and demand, the model refuses the scenario.
Is the input uploaded or saved?
No. The tool calculates inside this browser tab and provides a local download; it does not persist your input.
Keep going with related tools
All calculators →Maximum Flow and Minimum Cut Workbench
Compute an exact capacity-constrained flow and inspect conservation plus an equal-capacity minimum-cut witness.
CalculatorsCost Assignment Workbench
Find an exact minimum-cost or maximum-value one-to-one assignment and export the matching witness.
CalculatorsDimensional Weight Batch Planner
Compare actual and dimensional weight across a package batch using your divisor and rounding rules.
MathMinimum-cost Coverage Workbench
Choose a least-cost subset of candidates that collectively covers every named requirement, with a coverage witness.