Proposition 6, proof of (i), pp. ec1–ec2 — robust generation limits under the W_it-policy are four deterministic inequalities
ProvedMultistageRUC.WitPolicy.genLimits_iff_fourLet be the budget uncertainty set (3), and let be trajectories whose total load is maximal, respectively minimal, over in every period ((19), (20)). Write and for their total loads in period .
Fix a generator and a period , and consider the -policy . The robust generation limits (8c),
hold if and only if the four inequalities
hold.
This is the computational content of part (i) of Proposition 6: a semi-infinite family of constraints, one per load trajectory, collapses to four deterministic linear constraints in .
Formalization Note. Lean periods are 0-based. The commitment is an arbitrary real. The scenarios are hypotheses: any trajectories in that maximize, respectively minimize, the total load of every period.
import Mathlib import Definitions.Def_MultistageRUC_WitPolicy_Setting
namespace MultistageRUC.WitPolicy
theorem genLimits_iff_four {Ng Nd T : ℕ}
(pmin pmax : Fin Ng → ℝ) (x w W : Fin Ng → Fin T → ℝ)
(dbar dhat : Fin T → Fin Nd → ℝ) (Γ : ℝ)
(dmax dmin : Fin T → Fin Nd → ℝ)
(hmax : IsMaxLoad (MultistageRUC.Equiv.uncSet dbar dhat Γ) dmax)
(hmin : IsMinLoad (MultistageRUC.Equiv.uncSet dbar dhat Γ) dmin) (i : Fin Ng) (t : Fin T) :
GenLimits pmin pmax x w W (MultistageRUC.Equiv.uncSet dbar dhat Γ) i t ↔
(pmin i * x i t ≤ w i t + W i t * totalLoad dmax t ∧
w i t + W i t * totalLoad dmax t ≤ pmax i * x i t) ∧
(pmin i * x i t ≤ w i t + W i t * totalLoad dmin t ∧
w i t + W i t * totalLoad dmin t ≤ pmax i * x i t) := by sorry
end MultistageRUC.WitPolicy
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.