Corollary 1, p. 165 — some optimal u leaves no demand of class i > j unsatisfied whenever u^j < B^j
ProvedTopkisRation.Levels.corollary_1dynamic-programminginventoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rationing
In the model of Topkis (1968, §1) under Assumptions (A)–(C), let , and . There is a feasible vector (, ) that attains the minimum in (1),
and satisfies: implies for all .
So some optimal rationing decision serves a class only after every more important class has been fully served.
Formalization Note. "Optimal feasible" is read as attaining in (1); by Lemma 2 that value is the minimum of the bracket.
Preamble
import Mathlib import Definitions.Def_TopkisRation_Levels_Model
Formal statement
namespace TopkisRation.Levels
theorem corollary_1 {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) :
∃ u ∈ feasible z B, M.f t z B = M.obj t (M.g (t - 1)) z B u ∧
∀ j i : Fin n, u j < B j → j < i → u i = 0 := 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, Corollary 1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.