Theorem 4, p. 175 — nondecreasing myopic levels give optimal ordering and rationing
ProvedTopkisRation.Myopic.theorem_4Consider ordering periods under the paper's standing assumptions. Let , and choose for each period a myopic level according to the rule that it is any nonnegative minimum of , or when no minimum exists. If
then (a) is finite and, from any net stock , ordering to is optimal among all levels at least . If and the stock at the beginning of period is at most , then (b) the optimal rationing decisions in every interval of that period are exactly the optimal decisions for the single-period model with terminal costs and .
The result identifies when both dynamic ordering and rationing can be computed from single-period cost functions.
Formalization Note Part (b) compares the sets of minimizers of recursion (1) at every interval and every feasible state whose stock does not exceed . Stock does not rise within a period. The condition follows from the theorem's hypotheses; the statement expresses (b) for every real value equal to that level.
import Definitions.Def_TopkisRation_Myopic_MultiPeriod
namespace TopkisRation.Myopic
variable {n : ℕ}
/-- Theorem 4, p. 175: monotone myopic levels give optimal ordering and, under the stock bound, rationing. -/
theorem theorem_4 (Q : MultiModel n) (hQ : Q.Standing)
(hv : Q.v = Q.c (Q.N + 1))
(ybar : ℕ → WithTop ℝ)
(hy : ∀ i ∈ Finset.Icc 1 Q.N, IsMyopicLevel (Q.gmyopic i) (ybar i))
(m : ℕ) (hm : m ∈ Finset.Icc 1 Q.N)
(hmono : MonotoneOn ybar (Set.Icc m Q.N)) :
(∃ y : ℝ, ybar m = y ∧
∀ w z : ℝ, max w 0 ≤ z → Q.gtilde m (max w y) ≤ Q.gtilde m z) ∧
(m < Q.N → ∀ y' : ℝ, ybar (m + 1) = y' →
∀ t ∈ Finset.Icc 1 (Q.P m).k, ∀ z : ℝ, 0 ≤ z → z ≤ y' →
∀ B : Fin n → ℝ, 0 ≤ B → ∀ u ∈ TopkisRation.Levels.feasible z B,
let Ma := (Q.P m).withSalvage (fun _ => 0)
(fun y => -Q.c (m + 1) * y + Q.C (m + 1) y)
let Ml := (Q.P m).withSalvage (fun _ => 0)
(fun y => -Q.c (m + 1) * y)
IsMinOn (Ma.obj t (Ma.g (t - 1)) z B) (TopkisRation.Levels.feasible z B) u ↔
IsMinOn (Ml.obj t (Ml.g (t - 1)) z B) (TopkisRation.Levels.feasible z B) u) := by sorry
end TopkisRation.Myopic
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.