Theorem 2 — a policy of is optimal if the stocks between the two reorder points are accessible from its order-up-to level
ProvedVeinottWagnerSS.Selection.theorem2_optimal_of_accessibleLet and consider the inventory model with set-up cost , convex one-period cost with as , and i.i.d. integer demands with finite mean. Let be the candidate set of Step ii: the policies with , that minimize among such policies, where are the integers of (21)–(23).
Let and belong to . Suppose that is optimal, i.e. it minimizes over all policies for every starting stock , and that every integer with
is accessible from under . Then is optimal.
The theorem lets the algorithm of the paper certify a policy of as optimal by a reachability check on the demand distribution instead of a comparison of average costs; its Corollaries 2.1 and 2.2 give conditions (e.g. for ) under which this check is automatic.
Formalization Note Policies are pairs ; "optimal" is among all policies for every integer starting stock (p. 536). is . The bounds are least integers, computed from , and . As for Lemma 1, the paper's standing assumptions are kept.
import Mathlib import Definitions.Def_VeinottWagnerSS_Selection_Model import Definitions.Def_VeinottWagnerSS_Selection_CandidateSet
namespace VeinottWagnerSS.Selection
/-- Veinott & Wagner (1965), Theorem 2, p. 543: let `0 < α < 1` and let `(sⁱ, Sⁱ)`, `(sʲ, Sʲ)`
be policies of the candidate set `𝒮` of Step ii. If `(sⁱ, Sⁱ)` is optimal, and if each `x'`
with `min(sⁱ, sʲ) ≤ x' < max(sⁱ, sʲ)` is accessible from `Sʲ` under `(sʲ, Sʲ)`, then
`(sʲ, Sʲ)` is optimal. -/
theorem theorem2_optimal_of_accessible (M : Model) (α : ℝ) (hα0 : 0 < α) (hα1 : α < 1)
(pi pj : ℤ × ℤ) (hpi : pi ∈ candSet M α) (hpj : pj ∈ candSet M α)
(hopt : Optimal M α pi.1 pi.2)
(hacc : ∀ x' : ℤ, min pi.1 pj.1 ≤ x' → x' < max pi.1 pj.1 →
Accessible M pj.1 pj.2 pj.2 x') :
Optimal M α pj.1 pj.2 := by sorry
end VeinottWagnerSS.Selection
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.