Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 6, proof of (i), pp. ec1–ec2 — robust generation limits under the W_it-policy are four deterministic inequalities

Proved
MultistageRUC.WitPolicy.genLimits_iff_four

by mikedeng1 · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

affine-policyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimizationunit-commitment

Let D=∏tDt\mathcal D=\prod_t\mathcal D^tD=∏t​Dt be the budget uncertainty set (3), and let dmax⁡,dmin⁡∈D\mathbf d_{\max},\mathbf d_{\min}\in\mathcal Ddmax​,dmin​∈D be trajectories whose total load is maximal, respectively minimal, over D\mathcal DD in every period ((19), (20)). Write Lmax⁡=∑jdmax⁡,jtL_{\max}=\sum_j d^t_{\max,j}Lmax​=∑j​dmax,jt​ and Lmin⁡=∑jdmin⁡,jtL_{\min}=\sum_j d^t_{\min,j}Lmin​=∑j​dmin,jt​ for their total loads in period ttt.

Fix a generator iii and a period ttt, and consider the WitW_{it}Wit​-policy pit(d)=wit+Wit∑jdjtp^t_i(\mathbf d)=w^t_i+W_{it}\sum_j d^t_jpit​(d)=wit​+Wit​∑j​djt​. The robust generation limits (8c),

pimin⁡xit≤wit+Wit(∑j∈Nddjt)≤pimax⁡xit∀ d∈D,p^{\min}_i x^t_i\le w^t_i+W_{it}\Big(\sum_{j\in\mathcal N_d}d^t_j\Big)\le p^{\max}_i x^t_i\qquad\forall\,\mathbf d\in\mathcal D,pimin​xit​≤wit​+Wit​(j∈Nd​∑​djt​)≤pimax​xit​∀d∈D,

hold if and only if the four inequalities

pimin⁡xit≤wit+WitLmax⁡≤pimax⁡xit,pimin⁡xit≤wit+WitLmin⁡≤pimax⁡xitp^{\min}_i x^t_i\le w^t_i+W_{it}L_{\max}\le p^{\max}_i x^t_i,\qquad p^{\min}_i x^t_i\le w^t_i+W_{it}L_{\min}\le p^{\max}_i x^t_ipimin​xit​≤wit​+Wit​Lmax​≤pimax​xit​,pimin​xit​≤wit​+Wit​Lmin​≤pimax​xit​

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 (wit,Wit,xit)(w^t_i,W_{it},x^t_i)(wit​,Wit​,xit​).

Formalization Note. Lean periods are 0-based. The commitment xitx^t_ixit​ is an arbitrary real. The scenarios are hypotheses: any trajectories in D\mathcal DD that maximize, respectively minimize, the total load of every period.

Preamble
import Mathlib
import Definitions.Def_MultistageRUC_WitPolicy_Setting
Formal statement
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
Source
Lorca, Sun, Litvinov, Zheng, Multistage adaptive robust optimization for the unit commitment problem, Oper. Res. (2016), doi:10.1287/opre.2015.1456, manuscript of Sept. 29, 2014, pp. ec1–ec2 (PDF pp. 34–35), Proof of Proposition 6, part (i)
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me