Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1 — scenario price duality gives a lower bound

Proved
PHLowerBound.TwoStage.proposition_1

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

lagrangian-dualitylower-boundmixed-integer-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-programming

Let X(ξ)X(\xi)X(ξ) be the scenario feasible set of a finite-support two-stage SMIP. Assume the SMIP has an attained finite optimum z∗z^*z∗ and every X(ξ)X(\xi)X(ξ) is nonempty. For prices w(ξ)∈Rn1w(\xi)\in\mathbb R^{n_1}w(ξ)∈Rn1​ satisfying ∑ξpξw(ξ)=0\sum_\xi p_\xi w(\xi)=0∑ξ​pξ​w(ξ)=0, set

Dξ(w(ξ))=inf⁡(x,y)∈X(ξ)(c⊤x+g(ξ)⊤y+w(ξ)⊤x),D(w)=∑ξ∈ΞpξDξ(w(ξ)).D_\xi(w(\xi))=\inf_{(x,y)\in X(\xi)}\bigl(c^\top x+g(\xi)^\top y+w(\xi)^\top x\bigr),\qquad D(w)=\sum_{\xi\in\Xi}p_\xi D_\xi(w(\xi)).Dξ​(w(ξ))=(x,y)∈X(ξ)inf​(c⊤x+g(ξ)⊤y+w(ξ)⊤x),D(w)=ξ∈Ξ∑​pξ​Dξ​(w(ξ)).

Then D(w)≤z∗D(w)\le z^*D(w)≤z∗. This gives a certified lower bound from independent scenario optimization problems.

Formalization Note The paper's finite-support probabilities are positive and sum to one. The minima are represented by extended-real infima, preserving the value −∞-\infty−∞ when a subproblem is unbounded below. Optimal attainment is the paper's standing assumption of §3.1.

Preamble
import Mathlib
import Definitions.Def_PHLowerBound_TwoStage_Setting
Formal statement
namespace PHLowerBound.TwoStage

attribute [local instance] Classical.decEq

theorem proposition_1 {Ξ : Type*} [Fintype Ξ]
    {n₁ p₁ n₂ p₂ m₁ m₂ : ℕ} (P : SMIP Ξ n₁ p₁ n₂ p₂ m₁ m₂)
    (hX : ∀ ξ, (P.X ξ).Nonempty) (hopt : P.HasOptimalSolution)
    (w : Ξ → Fin n₁ → ℝ) (hw : ∑ ξ, P.p ξ • w ξ = 0) :
    P.D w ≤ P.zStar := by sorry

end PHLowerBound.TwoStage
Source
Gade et al., Obtaining Lower Bounds from the Progressive Hedging Algorithm for Stochastic Mixed-Integer Programs, author manuscript SAND2013-9195J (OSTI 1310314), p. 6, Proposition 1, (18)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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