§3, p. 175 — ordering to w ∨ x̄ᵐ minimizes period-m cost
ProvedTopkisRation.Myopic.order_up_tocritical-levelinventoryorderingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
For each ordering period , the convex actual cost attains a minimum at some . Every nonnegative minimizer yields an optimal order-up-to policy: from net stock , among all feasible order-up-to levels , the level minimizes :
This is the general dynamic ordering policy before the myopic-level condition of Theorem 4 is imposed.
Preamble
import Definitions.Def_TopkisRation_Myopic_MultiPeriod
Formal statement
namespace TopkisRation.Myopic
variable {n : ℕ}
/-- The General Case, p. 175: `g̃ᵐ` has a minimizer, and ordering to its level is optimal. -/
theorem order_up_to (Q : MultiModel n) (hQ : Q.Standing)
(m : ℕ) (hm : m ∈ Finset.Icc 1 Q.N) :
(∃ x : ℝ, 0 ≤ x ∧ ∀ z, 0 ≤ z → Q.gtilde m x ≤ Q.gtilde m z) ∧
∀ x : ℝ, 0 ≤ x → (∀ z, 0 ≤ z → Q.gtilde m x ≤ Q.gtilde m z) →
∀ w z : ℝ, max w 0 ≤ z → Q.gtilde m (max w x) ≤ Q.gtilde m z := by sorry
end TopkisRation.Myopic
Source
Topkis, Optimal ordering and rationing policies in a nonstationary dynamic inventory model with n demand classes, Management Science 15 (1968), p. 175, §3, The General Case, paragraph before Myopic Policies
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.