Lemma 1 — no excess production
ProvedRoslingAssembly.SeriesEquiv.lemma1_no_excess_productionassembly-systemdynamic-programminginventoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Under Rosling’s Assumption, let be an optimal policy and put . For every item and period, almost surely,
The bound rules out producing an item beyond what can be made available as end product within its total lead time.
Formalization Note The minimum is for the last item. The inequalities hold almost surely because policies may differ on null histories; and consistent initial histories are explicit.
Preamble
import Definitions.Def_RoslingAssembly_SeriesEquiv_Cost
Formal statement
namespace RoslingAssembly.SeriesEquiv
/-- Rosling, Lemma 1 and (6), p. 568. -/
theorem lemma1_no_excess_production (S : Model) (x0 : InitialPositions)
(π : Policy) [MeasureTheory.IsProbabilityMeasure S.ν]
(hTree : S.ValidTree) (hDemand : S.ValidDemand)
(hα : 0 < S.α ∧ S.α < 1) (hAssumption : S.Assumption)
(hInitial : S.WellFormedInitial x0) (hOptimal : S.Optimal x0 π) :
∀ᵐ ω ∂(MeasureTheory.Measure.infinitePi fun _ : ℕ => S.ν),
∀ t ≥ 1, ∀ i ∈ Finset.Icc 1 S.N,
S.NoExcessAt x0 π ω i t := by sorry
end RoslingAssembly.SeriesEquiv
Source
Rosling, Optimal Inventory Policies for Assembly Systems under Random Demands, Oper. Res. 37(4), 1989, p. 568, Lemma 1, eq. (6); proof pp. 576–577
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.