Lemma C.3: shipping at offset thresholds, crossing count, and the averaged reserve over the offset
ProvedOWMR.arb_credited_reserveapproximation-algorithmsinventoryinventory-theoryoperations-researchrenewal-theorystochastic-control
Fix a request size and a nondecreasing cumulative allocation path with and . For an offset , the request ships its whole allocation in period when the allocation rises to or past a threshold (, and if ) or reaches ; (shippedPath) is the quantity shipped by period . Let if and otherwise. Then:
- , and when ;
- for and every , the number of periods with a threshold crossing is at most ;
- for and , ;
- .
Item 3 is the averaged retained reserve against the depletion ; item 4 gives the expected number of dispatches .
Preamble
import Definitions.Def_owmr_consolidation_policy open MeasureTheory open scoped ENNReal
Formal statement
namespace OWMR
theorem arb_credited_reserve (Q : ℝ) (A : ℕ → ℝ) (hQ : 0 < Q) (hA0 : 0 ≤ A 0) (hA : Monotone A)
(hAQ : ∀ k, A k ≤ Q) :
(∀ θ k, 0 ≤ shippedPath Q θ A k ∧ shippedPath Q θ A k ≤ A k) ∧
(∀ θ k, A k = Q → shippedPath Q θ A k = Q) ∧
(∀ θ T, 0 < θ →
∑ k ∈ Finset.range T,
(if crossesThreshold Q θ (if k = 0 then 0 else A (k - 1)) (A k) then (1 : ℝ) else 0)
≤ 1 + if θ < 1 / 3 then 2 else 1) ∧
(∀ k z, 0 ≤ z → A k < Q →
∫⁻ θ in Set.Ioo (0 : ℝ) 1, ENNReal.ofReal (A k - shippedPath Q θ A k - z)
≤ ENNReal.ofReal (max (3 * Q / 4 - z) 0 ^ 2 / (3 * Q / 2))) ∧
∫⁻ θ in Set.Ioo (0 : ℝ) 1, ENNReal.ofReal (1 + if θ < 1 / 3 then 2 else 1)
= ENNReal.ofReal (7 / 3) := 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), Appendix C, Step 3, Lemma C.3 with (C.12)-(C.15), pp. E.12-E.14; dispatch thresholds of Definition 2, p. 27.