Proof of Theorem 1, p. 9 — because all Benders cuts are valid, infeasibility of the master problem implies that (6) is infeasible
ProvedLogicBenders.Generic.infeasible_of_master_infeasiblebenders-decompositioninfeasibilitylogic-based-bendersp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1valid-cuts
Let problem (6) be given by and , and let be bounding functions satisfying (B1). If the master problem (9) with these cuts is infeasible, that is,
then (6) is infeasible: .
This is the second clause of the proof of Theorem 1.
Preamble
import Mathlib import Definitions.Def_LogicBenders_Generic_Setting
Formal statement
namespace LogicBenders.Generic
theorem infeasible_of_master_infeasible {X Y : Type*} (S : Set (X × Y)) (f : X → Y → ℝ)
(cut : ℕ → Y → EReal) (k : ℕ) (hB1 : ∀ j ≤ k, ValidCut S f (cut j))
(h : MasterInfeasible cut k) :
S = ∅ := by sorry
end LogicBenders.Generic
Source
Hooker & Ottosson, Logic-based Benders decomposition, revised manuscript (Nov. 2000), p. 9, proof of Theorem 1, second paragraph
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.