Proved
RoslingAssembly.end_install_cost_eq_sumassembly-systemsinventorymulti-echelon-inventoryoperations-researchstochastic-control
In every assembly network, for every vector of installation holding costs , the installation holding cost of the end item equals the sum of all echelon holding costs:
It ties the backlog coefficient of (2) to the echelon costs.
Formalization Note The end item is Lean item .
Differences from the source:
- generalization: the items are indexed so that M_i ≥ M_{i−1} for all i (p. 567) → not assumed; only the clause k < i for k ∈ A(i) is kept (
Network.s_lt); reason: the clause is never used; every tree has such an indexing and the statement is invariant under reindexing, so the Lean statement specializes to the paper's - encoding: items 1, …, N, end item 1, s(1) = 0, M_0 = 0 → items
Fin N, 0-based, end item 0,s 0 = none,Ms 0 = 0; reason: renaming of indices; same instances
Preamble
import Mathlib import Definitions.Def_RoslingAssembly_Network_h
Formal statement
namespace RoslingAssembly
/-- **H_1 = Σ h_i** (Appendix A1, p. 575, unnumbered). Rosling, *Optimal Inventory Policies for
Assembly Systems under Random Demands*, Operations Research 37(4), 1989, Appendix A, §1, p. 575:
"Recalling that H_1 = Σ_{i=1}^N h_i, the modifications are".
The installation holding cost of the end item equals the sum of the echelon holding costs of all
items, `H_1 = Σ_i h_i`, where `h_i = H_i − Σ_{k∈P(i)} H_k`.
**Formalization Note.** Items are `Fin N`, 0-based: the end item (paper item 1) is Lean item
`0`; `[NeZero N]` makes it exist. `H` is arbitrary. -/
theorem end_install_cost_eq_sum {N : ℕ} [NeZero N] (net : Network N) (H : Fin N → ℝ) :
H 0 = ∑ i, net.h H i := by sorry
end RoslingAssembly
Source
Rosling, Optimal Inventory Policies for Assembly Systems under Random Demands, Operations Research 37(4), 1989, Appendix A, §1, p. 575 (unnumbered)