Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.4, (2.6), p. 7 — SPl\mathcal{SP}^lSPl has the same optimal value as problem (2.6)

Proved
PrimalDualLDR.FixedRecourse.sec_2_4_eq_2_6

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

linear-decision-rulesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-programming

Assume the standing assumptions of §2. Then the dual linear-decision-rule problem

SPl:min⁡x∈Lk,n2, s∈Lk,m2E(c(ξ)⊤x(ξ))  s.t.  E([Ax(ξ)+s(ξ)−b(ξ)]ξ⊤)=0, s(ξ)≥0 P-a.s.\mathcal{SP}^l:\quad \min_{x\in\mathcal L^2_{k,n},\,s\in\mathcal L^2_{k,m}} \mathbb E\big(c(\xi)^\top x(\xi)\big)\ \ \text{s.t.}\ \ \mathbb E\big([Ax(\xi)+s(\xi)-b(\xi)]\xi^\top\big)=0,\ s(\xi)\ge0\ \mathbb P\text{-a.s.}SPl:x∈Lk,n2​,s∈Lk,m2​min​E(c(ξ)⊤x(ξ))  s.t.  E([Ax(ξ)+s(ξ)−b(ξ)]ξ⊤)=0, s(ξ)≥0 P-a.s.

and problem (2.6),

min⁡X,S Tr⁡(MC⊤X)  s.t.  AX+S=B, ∃x∈Lk,n2:XM=E(x(ξ)ξ⊤), ∃s∈Lk,m2:SM=E(s(ξ)ξ⊤), s(ξ)≥0 P-a.s.,\min_{X,S}\ \operatorname{Tr}(MC^\top X)\ \ \text{s.t.}\ \ AX+S=B,\ \exists x\in\mathcal L^2_{k,n}: XM=\mathbb E(x(\xi)\xi^\top),\ \exists s\in\mathcal L^2_{k,m}: SM=\mathbb E(s(\xi)\xi^\top),\ s(\xi)\ge0\ \mathbb P\text{-a.s.},X,Smin​ Tr(MC⊤X)  s.t.  AX+S=B, ∃x∈Lk,n2​:XM=E(x(ξ)ξ⊤), ∃s∈Lk,m2​:SM=E(s(ξ)ξ⊤), s(ξ)≥0 P-a.s.,

have the same optimal value (in [−∞,+∞][-\infty,+\infty][−∞,+∞], with +∞+\infty+∞ for an infeasible problem).

This is the first step of the tractable reformulation of the dual approximation: the infinite-dimensional decision rules (x,s)(x,s)(x,s) are replaced by the finite-dimensional matrices (X,S)(X,S)(X,S) determined by them through (2.5), and only a moment-feasibility condition on SSS remains.

Preamble
import Mathlib
import Definitions.Def_PrimalDualLDR_FixedRecourse_Basic
import Definitions.Def_PrimalDualLDR_FixedRecourse_Setting
import Definitions.Def_PrimalDualLDR_FixedRecourse_Problems

open MeasureTheory Matrix
Formal statement
namespace PrimalDualLDR.FixedRecourse

/-- §2.4, (2.6), p. 7 (unnumbered): under the standing assumptions of §2, the dual linear-decision-rule
problem `SP^l` is equivalent to problem (2.6): their optimal values coincide. -/
theorem sec_2_4_eq_2_6 (σ : Setting) (hσ : σ.Standing) : σ.valSPl = σ.valLP26 := by sorry

end PrimalDualLDR.FixedRecourse
Source
Kuhn, Wiesemann, Georghiou, Primal and dual linear decision rules in stochastic and robust optimization, Optimization Online 2009/02/2218, §2.4, p. 7, (2.5)–(2.6) (unnumbered claim)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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