Lemma 4, p. 165 — the priority vector u(z − w, B) of (5) is feasible for (4) and minimizes it
ProvedTopkisRation.Levels.lemma_4dynamic-programminginventoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rationing
In the model of Topkis (1968, §1) under Assumptions (A)–(C), let , , and . Let be the constraint set of (4), and let be the vector (5), . Then and
Whatever amount of stock is issued in an interval, it is optimal to issue it to the classes in order of importance.
Formalization Note. Minimality is stated directly against every , not through the infimum defining .
Preamble
import Mathlib import Definitions.Def_TopkisRation_Levels_Model import Definitions.Def_TopkisRation_Levels_Split
Formal statement
namespace TopkisRation.Levels
theorem lemma_4 {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)
(w : ℝ) (hw : w ∈ Set.Icc (max (z - ∑ j, B j) 0) z) :
uVec (z - w) B ∈ {u : Fin n → ℝ | 0 ≤ u ∧ u ≤ B ∧ ∑ j, (B j - u j) = z - w} ∧
∀ u ∈ {u : Fin n → ℝ | 0 ≤ u ∧ u ≤ B ∧ ∑ j, (B j - u j) = z - w},
M.p t ⬝ᵥ uVec (z - w) B + M.g (t - 1) w (M.a t • uVec (z - w) B) ≤
M.p t ⬝ᵥ u + M.g (t - 1) w (M.a t • u) := 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), pp. 164–165, Lemma 4 with (4) and (5)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.