Eq. (33) — the DLP value changes by at most Σ_l r^l_max (b_l − b'_l)⁺ when the capacity right-hand side drops
ProvedResolvingNRM.FRUpper.lp_rhs_sensitivityLet have nonnegative entries , let and , and for let
With , for all capacity vectors ,
Applied with and , the average remaining capacity of the FR policy in period , this is eq. (33) of the paper: it converts the per-period gap between the DLP and the LP that FR solves into the positive parts , which Lemma 8 controls. The number bounds the dual price of resource .
Formalization Note. The paper states (33) for the two LPs it compares ( and ); the statement here is for arbitrary right-hand sides , as the paper's justification ("only differ in the right hand side") is. The printed sum runs over ; the paper has resources, so it is read as . , and are the model's standing assumptions (p. 7). With the LP is feasible and bounded, so piValue is its maximum.
import Mathlib import Definitions.Def_RLPBidPrice_Unbiased_Model import Definitions.Def_ResolvingNRM_FRUpper_Model open RLPBidPrice.Unbiased Matrix
namespace ResolvingNRM.FRUpper
/-- Eq. (33), App. C.2, p. 35: two DLPs (2) that differ only in the capacity right-hand side
satisfy `v(b) − v(b') ≤ ∑_l r^l_max (b_l − b'_l)⁺`. -/
theorem lp_rhs_sensitivity {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (r lam : Fin n → ℝ)
(hlam : ∀ j, 0 < lam j) (hr : 0 ≤ r) (hA : ∀ l j, 0 ≤ A l j)
(b b' : Fin m → ℝ) (hb : 0 ≤ b) (hb' : 0 ≤ b') :
piValue A r b lam - piValue A r b' lam ≤ ∑ l, rmaxRes A r l * max (b l - b' l) 0 := by sorry
end ResolvingNRM.FRUpper
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.