Examples
Examples
Try the starting example
- Initial branch asset counts
- 4,1,3
- Demands [zero-based branch,needed day,units]; enter JSON
- [[1,2,4],[0,3,2]]
- Transfer lead matrix (days); enter JSON
- [[0,1,2],[1,0,1],[2,1,0]]
- Transfer per-asset cost matrix (USD); enter JSON
- [[0,10,20],[10,0,15],[20,15,0]]
- Feasible transfers and unmet demand (JSON)
- {"transfers":[[1,1,2,3,1,2,30],[2,3,1,1,1,3,20]],"unmet":[],"ending_stock":[0,0,2]}
- Total transfer cost (USD)
- $50.00
- Unmet asset demand (count)
- 0
Try another scenario
- Initial branch asset counts
- 3,1,2
- Demands [zero-based branch,needed day,units]; enter JSON
- [[1,1,4],[0,2,3]]
- Transfer lead matrix (days); enter JSON
- [[0,2,2],[2,0,1],[2,1,0]]
- Transfer per-asset cost matrix (USD); enter JSON
- [[0,12,20],[12,0,10],[20,10,0]]
- Feasible transfers and unmet demand (JSON)
- {"transfers":[[1,3,2,2,0,1,20]],"unmet":[[1,1]],"ending_stock":[0,0,0]}
- Total transfer cost (USD)
- $20.00
- Unmet asset demand (count)
- 1
Calculation method
Calculation method
Feasible transfers and unmet demand (JSON)
Use local inventory then donors whose lead<=needed day; choose lowest transfer cost, then lead, then index. Reserve stock immediately; transfer dispatch=needed−lead.
Total transfer cost (USD)
Sum per-transfer rounded units×cost.
Unmet asset demand (count)
Sum remaining demand after available timely donor transfers.
Symbols and units
- a
- Initial branch asset counts
- b
- Demands [zero-based branch,needed day,units]; enter JSON
- c
- Transfer lead matrix (days); enter JSON
- d
- Transfer per-asset cost matrix (USD); enter JSON
Use the units shown. A list keeps the order in which you enter its values. The symbol ^ means “raised to the power of”.
Assumptions & limits
Assumptions & limits
- One-way inventory depletion, no asset returns inside horizon. Demand processed by date; donor cost per asset supplied; dispatch cannot precede day zero. Supported limits: All numeric inputs and computed intermediates must remain finite. Supported numeric input magnitude is zero or 1e-12 through 1e12 in absolute value; reject values outside this bounded range. All lists/JSON record tables are limited to 100 records unless a stricter bound is stated; reject malformed record arity and wrong member types. 1..20 branches; square nonnegative lead/cost matrices with zero diagonal; counts/needed days nonnegative integers; branch indices valid. Greedy chronological heuristic; no asset returns or intermediate transshipment; not global minimum-cost solution.
Are these inputs private?
These calculations run in your browser. A shared link contains the values you choose to share. Only questions submitted to the separate AI finder are sent to OpenAI.