Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, p. 9 — when the algorithm terminates at a master optimum (z̄, ȳ), the subproblem dual value β* equals z̄

Proved
LogicBenders.Generic.beta_star_eq_zbar

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

benders-decompositioninference-dualitylogic-based-bendersp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1termination

Let problem (6) be given by SSS and fff, let β(0),…,β(k)\beta^{(0)},\dots,\beta^{(k)}β(0),…,β(k) be bounding functions satisfying (B1), and let (zˉ,yˉ)(\bar z,\bar y)(zˉ,yˉ​) be an optimal solution, with value zˉ\bar zzˉ, of the master problem (9) with these cuts. Suppose the generic Benders algorithm terminates at yˉ\bar yyˉ​, i.e. the While test of Figure 1 fails: the subproblem dual (8) at yˉ\bar yyˉ​ has no feasible solution β>zˉ\beta > \bar zβ>zˉ. Then the optimal value β∗\beta^*β∗ of the subproblem dual (8), and the optimal value of the subproblem (7), both equal zˉ\bar zzˉ:

β∗  =  sup⁡{β:(x,yˉ)∈S→Dxf(x,yˉ)≥β}  =  zˉ  =  inf⁡(x,yˉ)∈Sf(x,yˉ).\beta^* \;=\; \sup\{\beta : (x,\bar y)\in S \xrightarrow{D_x} f(x,\bar y)\ge\beta\} \;=\; \bar z \;=\; \inf_{(x,\bar y)\in S} f(x,\bar y).β∗=sup{β:(x,yˉ​)∈SDx​​f(x,yˉ​)≥β}=zˉ=(x,yˉ​)∈Sinf​f(x,yˉ​).

This is the step "because the algorithm terminated with a finite solution, β∗=zˉ\beta^* = \bar zβ∗=zˉ" of the proof of Theorem 1.

Formalization Note. The page assumes the master solution is finite; the equality holds without that assumption (including zˉ=−∞\bar z = -\inftyzˉ=−∞), so the hypothesis is dropped and the statement is stronger. Both the dual value β∗\beta^*β∗ (the page's quantity) and the primal subproblem value are stated.

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

theorem beta_star_eq_zbar {X Y : Type*} (S : Set (X × Y)) (f : X → Y → ℝ)
    (cut : ℕ → Y → EReal) (k : ℕ) (hB1 : ∀ j ≤ k, ValidCut S f (cut j))
    (z : EReal) (yb : Y) (h : IsMasterOptimal cut k z yb)
    (hstop : ¬ ∃ β : EReal, IsDualFeasible S f yb β ∧ z < β) :
    subDualVal S f yb = z ∧ subVal S f yb = z := by sorry

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