Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.1, p. 10 — a problem of the form (3.13)/(3.14) with finite optimal value has an optimal solution

Proved
ShapiroSDDP.Convergence.attainment

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

attainmentcutting-planelinear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let A∈Rm×nA\in\mathbb R^{m\times n}A∈Rm×n, h∈Rmh\in\mathbb R^mh∈Rm, c∈Rnc\in\mathbb R^nc∈Rn, and let CCC be a finite set of affine functions y↦α+β⊤yy\mapsto\alpha+\beta^\top yy↦α+β⊤y. Consider the linear program

min⁡y∈Rn, θ∈R c⊤y+θs.t.Ay=h,  y≥0,  θ≥α+β⊤y  for all (α,β)∈C,\min_{y\in\mathbb R^n,\ \theta\in\mathbb R}\ c^\top y+\theta\quad\text{s.t.}\quad Ay=h,\ \ y\ge0,\ \ \theta\ge\alpha+\beta^\top y\ \text{ for all }(\alpha,\beta)\in C,y∈Rn, θ∈Rmin​ c⊤y+θs.t.Ay=h,  y≥0,  θ≥α+β⊤y  for all (α,β)∈C,

which is problem (3.13) or (3.14) written with the epigraph variable θ\thetaθ of the convex piecewise linear approximation Q(y)=max⁡(α,β)∈C(α+β⊤y)\mathfrak Q(y)=\max_{(\alpha,\beta)\in C}(\alpha+\beta^\top y)Q(y)=max(α,β)∈C​(α+β⊤y). If this problem has a finite optimal value, that is, it is feasible and its objective is bounded below on the feasible set, then it has an optimal solution (y∗,θ∗)(y^*,\theta^*)(y∗,θ∗).

This is the step that turns assumption (A1) into the existence of the forward decisions (3.13)–(3.14) used by the algorithm.

Formalization Note "Finite optimal value" is stated as feasibility plus a lower bound on the objective, not through an infimum.

Preamble
import Mathlib
import Definitions.Def_ShapiroSDDP_Convergence_Model
import Definitions.Def_ShapiroSDDP_Convergence_SDDP
Formal statement
namespace ShapiroSDDP.Convergence

/-- §3.1, p. 10: a linear program of the form (3.13)/(3.14), i.e. minimize `cᵀ y + θ` subject to
`A y = h`, `y ≥ 0` and `θ ≥ α + βᵀ y` for each cut `(α, β)` of a finite set `C`, that has a finite
optimal value (feasible, objective bounded below) has an optimal solution. -/
theorem attainment {n m : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (h : Fin m → ℝ)
    (C : Finset (ℝ × (Fin n → ℝ))) (c : Fin n → ℝ) (hfin : CutLPFinite A h C c) :
    ∃ p, IsCutLPOpt A h C c p := by sorry

end ShapiroSDDP.Convergence
Source
Shapiro, Analysis of Stochastic Dual Dynamic Programming Method, Optimization Online 2009/12/2509, p. 10, §3.1, after (A1)
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