Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, p. 9 — the subproblem value at any trial ȳ is an upper bound on the optimal value of (6)

Proved
LogicBenders.Generic.subVal_upper_bound

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

benders-decompositionlogic-based-bendersp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1upper-bound

Let S⊆Dx×DyS \subseteq D_x \times D_yS⊆Dx​×Dy​ and f:Dx×Dy→Rf : D_x \times D_y \to \mathbb Rf:Dx​×Dy​→R define problem (6), min⁡f(x,y)\min f(x,y)minf(x,y) over (x,y)∈S(x,y) \in S(x,y)∈S. For any trial value yˉ∈Dy\bar y \in D_yyˉ​∈Dy​, the optimal value of the subproblem (7) obtained by fixing y=yˉy = \bar yy=yˉ​ is at least the optimal value of (6):

inf⁡(x,y)∈Sf(x,y)  ≤  inf⁡x : (x,yˉ)∈Sf(x,yˉ).\inf_{(x,y) \in S} f(x,y) \;\le\; \inf_{x\,:\,(x,\bar y) \in S} f(x,\bar y).(x,y)∈Sinf​f(x,y)≤x:(x,yˉ​)∈Sinf​f(x,yˉ​).

In the proof of Theorem 1 this is the remark that β∗\beta^*β∗, the optimal value of the last subproblem, is an upper bound on the optimal value of (6).

Formalization Note. Both values are taken in [−∞,+∞][-\infty,+\infty][−∞,+∞]; when the subproblem is infeasible its value is +∞+\infty+∞ and the inequality is immediate.

Preamble
import Mathlib
import Definitions.Def_LogicBenders_Generic_Setting
Formal statement
namespace LogicBenders.Generic

theorem subVal_upper_bound {X Y : Type*} (S : Set (X × Y)) (f : X → Y → ℝ) (yb : Y) :
    optVal S f ≤ subVal S f yb := by sorry

end LogicBenders.Generic
Source
Hooker & Ottosson, Logic-based Benders decomposition, revised manuscript (Nov. 2000), p. 9, proof of Theorem 1, fourth sentence
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