Theorem 4 — y*(i) ≤ S*_n(i) < S⁺(i) and r⁻⁻(i) ≤ r⁻(i) ≤ r*_n(i) ≤ r⁺(i) for all n ≥ 1
ProvedSongZipkinFluct.FixedCost.theorem4boundsinventoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1ss-policy
In the fixed-cost model (standing hypotheses, , , of the linear model), let be the smallest minimizer of , , and the smallest minimizer of . Then the bounds , , , of p. 358 exist, and for all and , with , the parameters of Theorem 3(b):
These bounds, of the type Veinott (1966) gave for discrete-time models without a world variable, localize the optimal -stage parameters in a box computed from the myopic cost and the linear model alone, uniformly in .
Formalization Note The existence of , , , , taken for granted in the paper when it defines them, is part of the conclusion; , , , , are taken through their defining properties.
Preamble
import Mathlib import Definitions.Def_SongZipkinFluct_FixedCost_Bounds open Filter Topology
Formal statement
namespace SongZipkinFluct.FixedCost
open Model
/-- Theorem 4 (p. 358; proof p. 368) of Song and Zipkin (1993). Fixed-cost model of §3.2
(`K = K̄F̃_L(α) > 0`, `W₀ = W_∞`, `G₀ = G_∞` of the linear model). Let `y⁺(i)` be the smallest
minimizer of `G⁺(i, ·)`, `y⁺_min = min_i y⁺(i)`, `y*(i)` the smallest minimizer of `G₀(i, ·)`.
Then the bounds of p. 358,
* `S⁺(i) = min{y ≥ y⁺(i) : G⁺(i, y) − G⁺(i, y⁺(i)) > γK}`,
* `r⁺(i) = max{y < y⁺(i) : G⁺(i, y) − G⁺(i, y⁺(i)) > (1 − γ)K}`,
* `r⁻(i) = max{y < y*(i) : G₀(i, y) − G₀(i, y*(i)) > K}`,
* `r⁻⁻(i) = max{y < y⁺_min : G⁺(i, y) − G⁺(i, y⁺_min) > K}`,
exist, and for all `n ≥ 1` and `i ∈ I`, with `S*_n(i)`, `r*_n(i)` as in Theorem 3(b):
* (a) `y*(i) ≤ S*_n(i) < S⁺(i)`;
* (b) `r⁻⁻(i) ≤ r⁻(i) ≤ r*_n(i) ≤ r⁺(i)`.
Formalization Note: every minimizer and extremal integer is taken through its defining property
(`IsLeast`/`IsGreatest`), never through `sInf`/`sSup` on `ℤ`. The existence of `S⁺`, `r⁺`,
`r⁻`, `r⁻⁻`, which the paper takes for granted when it defines them, is part of the
conclusion. -/
theorem theorem4 {I : Type*} [Countable I] [Nonempty I] [DecidableEq I] (M : Model I)
(hM : M.Standing) (hA1 : M.α * M.cbar < M.p) (hK : 0 < M.Kbar)
(yplus : I → ℤ) (hyplus : IsYPlus M yplus) (ymin : ℤ) (hymin : IsYPlusMin yplus ymin)
(ystar : I → ℤ) (hystar : IsYStar M ystar) :
((∃ Splus, IsSPlus M yplus Splus) ∧ (∃ rplus, IsRPlus M yplus rplus) ∧
(∃ rminus, IsRMinus M ystar rminus) ∧ (∃ rmm, IsRMinusMinus M ymin rmm)) ∧
∀ (Splus rplus rminus rmm : I → ℤ) (rs Ss : ℕ → I → ℤ),
IsSPlus M yplus Splus → IsRPlus M yplus rplus → IsRMinus M ystar rminus →
IsRMinusMinus M ymin rmm → IsStageParams M rs Ss →
∀ n : ℕ, 1 ≤ n → ∀ i : I,
(ystar i ≤ Ss n i ∧ Ss n i < Splus i) ∧
(rmm i ≤ rminus i ∧ rminus i ≤ rs n i ∧ rs n i ≤ rplus i) := by sorry
end SongZipkinFluct.FixedCost
Source
Song and Zipkin, Inventory Control in a Fluctuating Demand Environment, Oper. Res. 41(2):351–370 (1993), DOI 10.1287/opre.41.2.351, p. 358, Theorem 4 (proof p. 368)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.