Finite-horizon single-location bound for adapted positions:
ProvedOWMR.sl_adapted_boundapproximation-algorithmsinventoryinventory-theoryoperations-researchrenewal-theorystochastic-control
Let be i.i.d. with law on a measurable space , independent of auxiliary randomness , and let be measurable, so that the demand of period is . Let the orders be measurable and depend on only through , and let
be the position after the order of period . Let be measurable, and let be a bounded subsolution: is measurable, , and
Then for all horizons , with set to (periods before never use them),
This is the finite-horizon bound (6) of Lemma 1 for policies that also use network history and auxiliary randomness, as Proposition 3 requires.
Preamble
import Definitions.Def_owmr_network_model open MeasureTheory open scoped ENNReal NNReal
Formal statement
namespace OWMR
theorem sl_adapted_bound {α U : Type} [MeasurableSpace α] [Zero α] [MeasurableSpace U]
(μ : Measure α) [IsProbabilityMeasure μ] (ν : Measure U) [IsProbabilityMeasure ν]
(g : α → ℝ≥0) (hg : Measurable g) (q : ℕ → U → (ℕ → α) → ℝ)
(hna : ∀ (t : ℕ) (u : U) (d d' : ℕ → α), (∀ s < t, d s = d' s) → q t u d = q t u d')
(hqm : ∀ t, Measurable fun ω : U × (ℕ → α) => q t ω.1 ω.2)
(hq0 : ∀ t u d, 0 ≤ q t u d) (y0 : ℝ) (f : ℝ → ℝ) (hf : Measurable f)
(hf0 : ∀ y, 0 ≤ f y) (K J : ℝ) (v : ℝ → ℝ) (hv : Measurable v)
(hvb : ∀ y, -K ≤ v y ∧ v y ≤ 0)
(hsub : ∀ y, J ≤ f y + ∫ a, v (y - (g a : ℝ)) ∂μ - v y) (T N : ℕ) (hTN : T ≤ N) :
ENNReal.ofReal (T * J)
≤ ∫⁻ ω, ∑ t ∈ Finset.range T, ENNReal.ofReal
(K * (if 0 < q t ω.1 (padHist N ω.2) then 1 else 0)
+ f (y0 + ∑ s ∈ Finset.range (t + 1), q s ω.1 (padHist N ω.2)
- ∑ s ∈ Finset.range t, (g (padHist N ω.2 s) : ℝ)))
∂(ν.prod (Measure.pi fun _ : Fin N => μ)) + ENNReal.ofReal K := by sorry
end OWMRSource
M. Hu, "A 5/2 Guarantee for Echelon Stock (s,S) Policies in One-Warehouse Multi-Retailer Systems", working paper (manuscript of November 2026), Lemma 1, Section 4.1, p. 11 (equations (5) and (6)), and Appendix A (proof of Lemma 1); used in Steps 2 and 3 of the proof of Proposition 3, Section 5.3, pp. 24-25.