(5) and §4 — every vector base-stock policy with level vector s lies in Z(s)
ProvedLostSalesOldNew.StateReduction.vectorBaseStock_mem_ZsLet be the lead time and let satisfy . Let be the vector base-stock policy with parameter ,
Then : it orders a nonnegative amount in every state , it orders nothing in every state outside , and for and every .
The paper states this for Morton's standard vector ("the standard vector base-stock policy [is in ], by construction"); the construction gives it for every level vector, which is what is stated here. The same sentence of the paper also asserts that any optimal policy lies in ; that part rests on Morton's bounds (4), which the paper cites without proof, and it is not part of this statement.
The result shows that contains the paper's vector base-stock heuristics, so Claim 1 applies to them.
Formalization Note. The paper assumes . Policies are functions (Fin L → ℝ) → ℝ; quantifies its sign and zero conditions over nonnegative states only.
import Mathlib import Definitions.Def_LostSalesOldNew_StateReduction_Model
namespace LostSalesOldNew.StateReduction
theorem vectorBaseStock_mem_Zs {L : ℕ} (hL : 0 < L)
(s : Fin (L + 1) → ℝ) (hs : IsLevelVector s) :
vectorBaseStock s ∈ Zs s := by sorry
end LostSalesOldNew.StateReduction
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.