Single-location values are nondecreasing in the setup cost
ProvedOWMR.slValue_mono_setupapproximation-algorithmsinventoryinventory-theoryoperations-researchstochastic-control
Let be a probability law of demand on and a one-period holding and backlog cost. Write for the optimal long-run average cost of the single-location problem with i.i.d. demands of law and period cost , the infimum over all nonanticipative policies with nonnegative orders, possibly randomized. If , then
The source uses this monotonicity in the proof of Theorem 1 to compare with and with .
Formalization Note is slValue ρ f K, an extended nonnegative real.
Preamble
import Definitions.Def_owmr_single_location open MeasureTheory open scoped ENNReal NNReal
Formal statement
namespace OWMR
theorem slValue_mono_setup (ρ : Measure ℝ≥0) [IsProbabilityMeasure ρ] (f : ℝ → ℝ) {K K' : ℝ}
(hK : K ≤ K') : slValue ρ f K ≤ slValue ρ f 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), Section 5.4, Steps 2 and 3 of the proof of Theorem 1 ("single-location values are nondecreasing in setup cost"), p. 26.