Proposition 2, p. 97 — under the MC policy, supply flexibility at least the customer's keeps inventory at zero; equal flexibilities give lot-for-lot
ProvedQFlexSC.ZeroInv.proposition_2Consider a flex node with input QF parameters and output QF parameters , , satisfying the standing assumptions and , with cumulative flexibilities and . Suppose that
- (a) the release schedules received in periods are nonnegative and their updates obey the output IR constraints (6);
- (b) the node uses the Minimum Commitment policy (21)–(23) in every period ;
- (c) , and the run starts lot-for-lot, ;
- (d) , i.e. and for all .
Then the node holds no inventory:
Moreover, in the special case , provided for all , the node is a pure lot-for-lot conduit:
The proposition makes precise the claim that inventory at a flex node results from a disparity between input and output flexibility: a node whose supply side is at least as flexible as its customer side can meet every obligation with zero stock, and with matched flexibility it transmits every schedule upstream unaltered.
Formalization Note. Three hypotheses are added to the page's statement and disclosed. (i) : the paper's quantities are "measured in end-item equivalents", and its proof multiplies an inequality between flexibility ratios by . (ii) The start : the paper names no initial schedule, and without a condition on it the claim fails (a large forces ). (iii) in the equal case only: the paper's proof divides by ; with , , (equal profiles ), , , the MC policy gives . Constraint (6) is stated with index in place of ; the parameter sequences' value at index is unused; period is the initial state and the policy acts from period on.
import Mathlib import Definitions.Def_QFlexSC_ZeroInv_Model
namespace QFlexSC.ZeroInv
theorem proposition_2 (P : QFParams) (f : ℕ → ℕ → ℝ) (I₀ : ℝ) (r₀ : ℕ → ℝ)
(hstd : ∀ q, 1 ≤ q → 0 ≤ P.αin q ∧ 0 ≤ P.αout q ∧ 0 ≤ P.ωin q ∧ P.ωin q ≤ 1 ∧
0 ≤ P.ωout q ∧ P.ωout q ≤ 1)
(hf : ∀ t j, 0 ≤ f t j)
(ha : IROut P f)
(hc : I₀ = 0)
(hr₀ : r₀ = f 0)
(hd : ∀ j, 1 ≤ j → Acum P.αout j ≤ Acum P.αin j ∧ Ωcum P.ωout j ≤ Ωcum P.ωin j) :
(∀ t : ℕ, inv P I₀ r₀ f t = 0) ∧
((∀ j, 1 ≤ j → Acum P.αin j = Acum P.αout j ∧ Ωcum P.ωin j = Ωcum P.ωout j) →
(∀ q, 1 ≤ q → P.ωin q < 1) →
∀ t : ℕ, 1 ≤ t → ∀ j : ℕ, sched P I₀ r₀ f t j = f t j) := by sorry
end QFlexSC.ZeroInv
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.