Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, p. 9 — due to (B1), the master optimal value z̄ is a lower bound on the optimal value of (6)

Proved
LogicBenders.Generic.master_lower_bound

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

benders-decompositionlogic-based-benderslower-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1valid-cuts

Let problem (6) be given by S⊆Dx×DyS \subseteq D_x \times D_yS⊆Dx​×Dy​ and fff. Let β(0),…,β(k):Dy→[−∞,+∞]\beta^{(0)}, \dots, \beta^{(k)} : D_y \to [-\infty,+\infty]β(0),…,β(k):Dy​→[−∞,+∞] be bounding functions each satisfying (B1): f(x,y)≥β(j)(y)f(x,y) \ge \beta^{(j)}(y)f(x,y)≥β(j)(y) for every feasible (x,y)(x,y)(x,y) of (6). If (z,yˉ)(z,\bar y)(z,yˉ​) is an optimal solution, with optimal value zzz, of the master problem (9) with these cuts,

min⁡ zs.t.z≥β(j)(y), j=0,…,k,y∈Dy,\min\ z \quad \text{s.t.}\quad z \ge \beta^{(j)}(y),\ j = 0,\dots,k,\quad y \in D_y,min zs.t.z≥β(j)(y), j=0,…,k,y∈Dy​,

then

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

This is the lower-bound half of the proof of Theorem 1: the master relaxes (6), because every valid cut is satisfied by every feasible solution of (6).

Formalization Note. A master optimum means z=max⁡j≤kβ(j)(yˉ)<+∞z = \max_{j \le k} \beta^{(j)}(\bar y) < +\inftyz=maxj≤k​β(j)(yˉ​)<+∞ and z≤max⁡j≤kβ(j)(y)z \le \max_{j\le k}\beta^{(j)}(y)z≤maxj≤k​β(j)(y) for every yyy; the value z=−∞z = -\inftyz=−∞ (an unbounded master) is allowed. Cuts are numbered from 000.

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

theorem master_lower_bound {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) :
    z ≤ optVal S f := by sorry

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