(6), p. 165 — f_t(z, B) is the minimum of f_t(w; z, B) over w ∈ [(z − B^{(1)})⁺, z]
ProvedTopkisRation.Levels.eq_6dynamic-programminginventoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rationing
In the model of Topkis (1968, §1) under Assumptions (A)–(C), let , and , and write . Then
where is the cost (4) of issuing exactly units in interval : the infimum over equals and is attained.
Together with Lemma 4 this reduces the choice of the optimal vector in (1) to the choice of the single number , the stock level after rationing.
Formalization Note. The statement asserts both the equality with the real sInf and the existence of a minimizing , which is what "min" means.
Preamble
import Mathlib import Definitions.Def_TopkisRation_Levels_Model import Definitions.Def_TopkisRation_Levels_Split
Formal statement
namespace TopkisRation.Levels
theorem eq_6 {n : ℕ} (M : Model n) (hM : M.Standing) (t : ℕ) (ht : t ∈ Finset.Icc 1 M.k)
(z : ℝ) (hz : 0 ≤ z) (B : Fin n → ℝ) (hB : 0 ≤ B) :
M.f t z B = sInf ((fun w => M.fw t w z B) '' Set.Icc (max (z - ∑ j, B j) 0) z) ∧
∃ w ∈ Set.Icc (max (z - ∑ j, B j) 0) z, M.fw t w z B = M.f t z B := by sorry
end TopkisRation.Levels
Source
Topkis, Optimal ordering and rationing policies in a nonstationary dynamic inventory model with n demand classes, Management Science 15 (1968), p. 165, (6)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.