Appendix 1, proof of Proposition 1, p. 108 — the MC schedule satisfies r_j(t) ≥ T_j(t), hence I(t) ≥ 0
ProvedQFlexSC.ZeroInv.coverageinventoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rolling-horizonsupply-chainsupply-contracts
Consider a flex node running the Minimum Commitment (MC) policy (21)–(23) from an arbitrary initial state against arbitrary release schedules and arbitrary QF parameters. For every period :
- for every , the replenishment schedule dominates the target (22),
- the ending stock is nonnegative,
Part 2 follows from part 1 at , where and give . This is the coverage half of the admissibility of the MC policy: the node never fails to cover its customer's actual purchase.
Formalization Note. No hypothesis on the data is needed; the statement is about the run of the model's MC policy, and is the projection computed in period from .
Preamble
import Mathlib import Definitions.Def_QFlexSC_ZeroInv_Model
Formal statement
namespace QFlexSC.ZeroInv
theorem coverage (P : QFParams) (f : ℕ → ℕ → ℝ) (I₀ : ℝ) (r₀ : ℕ → ℝ) :
∀ t : ℕ, 1 ≤ t →
(∀ j : ℕ, target P (f t) (projInvAt P I₀ r₀ f t j) j ≤ sched P I₀ r₀ f t j) ∧
0 ≤ inv P I₀ r₀ f t := by sorry
end QFlexSC.ZeroInv
Source
Tsay & Lovejoy, Quantity flexibility contracts and supply chain performance, MSOM 1(2) (1999), p. 108, Appendix 1, proof of Proposition 1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.