Proof of Theorem 2 — cost rewrite
ProvedRoslingAssembly.SeriesEquiv.thm2_cost_rewriteassembly-systemdynamic-programminginventoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
For every policy, the original and equivalent series systems assign the same objective (2), because the series holding coefficient is and its lead time is .
This identifies the cost term after the series transformation, independently of the feasibility comparison.
Formalization Note Both objectives omit the same policy-independent constant (4); the equivalent demand convolution agrees because .
Preamble
import Definitions.Def_RoslingAssembly_SeriesEquiv_Cost
Formal statement
namespace RoslingAssembly.SeriesEquiv
/-- The cost identity at the start of the proof of Rosling's Theorem 2,
p. 569. Both sides are objective (2), without its fixed constant. -/
theorem thm2_cost_rewrite (S : Model) (π : Policy)
[MeasureTheory.IsProbabilityMeasure S.ν]
(hTree : S.ValidTree) (hα : 0 < S.α ∧ S.α < 1) :
S.cost π = (S.series).cost π := by sorry
end RoslingAssembly.SeriesEquiv
Source
Rosling, Optimal Inventory Policies for Assembly Systems under Random Demands, Oper. Res. 37(4), 1989, p. 569, proof of Theorem 2, first displayed formula
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.