Regularity of the retailer cost
ProvedOWMR.F_propertiesapproximation-algorithmsinventoryinventory-theoryoperations-researchrenewal-theorystochastic-control
Consider an OWMR network that satisfies the standing assumptions and a retailer , with lead-time demand a sum of i.i.d. demands of retailer , and
Then ; is convex on ; for all ; and has slopes at least : whenever .
Preamble
import Definitions.Def_owmr_single_location open MeasureTheory open scoped ENNReal NNReal
Formal statement
namespace OWMR
theorem F_properties {n : ℕ} (N : Network n) (hN : N.Standing) (i : Fin n) :
(∀ y, 0 ≤ N.F i y) ∧ ConvexOn ℝ Set.univ (N.F i) ∧
(∀ y y', |N.F i y - N.F i y'| ≤ (N.H i + N.p) * |y - y'|) ∧
(∀ y y', y ≤ y' → N.F i y - N.p * (y' - y) ≤ N.F i y') := 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), eq. (8) and its footnote, p. 12 ("F_i finite and globally Lipschitz"); convexity and the slope bound F(S-x) >= G - p(w-x) are used in Step 1 of the proof of Lemma 3, p. 14.