Appendix (proof of Theorem 6.1), p. 938 — |v_{n,k}(i, x′) − v_{n,k}(i, x)| ≤ C|x′ − x|/(1 − α), and the same for v_n
ProvedSethiChengSS.Infinite.appendix_lipschitzdynamic-programminginfinite-horizoninventorylipschitzp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Under the standing assumptions (2.1)–(2.2) and , the truncated values of (6.4) and their limit are Lipschitz in the surplus, with the constant of (2.2):
for all , , , , .
In the paper this bound is what places the limit in .
Formalization Note. The values are finite (they are bounded by ), and the inequalities are stated for their real values. The Lipschitz constant of is because is convex, nonnegative and bounded by .
Preamble
import Mathlib import Definitions.Def_BertsekasKConvex import Definitions.Def_SethiChengSS_Infinite_Model
Formal statement
namespace SethiChengSS.Infinite
theorem appendix_lipschitz {L : ℕ} (D : Model L) (α : ℝ) (hD : Standing D) (hα0 : 0 < α)
(hα1 : α < 1) :
(∀ n k i x x', |(vTrunc D α n k i x').toReal - (vTrunc D α n k i x).toReal| ≤
D.C * |x' - x| / (1 - α)) ∧
(∀ n i x x', |(vLim D α n i x').toReal - (vLim D α n i x).toReal| ≤
D.C * |x' - x| / (1 - α)) := by sorry
end SethiChengSS.Infinite
Source
Sethi and Cheng, Optimality of (s, S) policies in inventory models with Markovian demand, Oper. Res. 45(6) (1997), DOI 10.1287/opre.45.6.931, p. 938, Appendix (proof of Theorem 6.1), the display after "From Assumption (2.2), we have"
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.