Proof of Theorem 4, (EC.4) — the instance (EC.4) of 𝒫 has optimal value 0
ProvedKAdaptability.ConstrGap.ec4_optimal_value_zerointeger-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization
Let and consider the instance (EC.4) of the two-stage robust binary program : no first-stage decision, , zero objective, second-stage constraints and (), and uncertainty set (augmented by to make the right-hand side linear). Then
In words: for every realization of the parameter some binary recourse decision is feasible, so the fully adaptive problem attains the value of its objective. This is the first half of the proof of Theorem 4.
Formalization Note The value is the general optimal value of KAdaptability.ConstrGap.Values evaluated at the instance inst Q, computed in EReal; an infeasible second stage would contribute .
Preamble
import Mathlib import Definitions.Def_KAdaptability_ConstrGap_Problem import Definitions.Def_KAdaptability_ConstrGap_Values import Definitions.Def_KAdaptability_ConstrGap_Instance open Matrix
Formal statement
namespace KAdaptability.ConstrGap /-- Proof of Theorem 4, p. ec5: the two-stage robust binary program (EC.4) — the instance `inst nQ` of 𝒫 — has optimal value `0`. -/ theorem ec4_optimal_value_zero (nQ : ℕ) : (inst nQ).optP = 0 := by sorry end KAdaptability.ConstrGap
Source
Hanasusanto, Kuhn, Wiesemann, K-Adaptability in Two-Stage Robust Binary Programming, preprint, Optimization Online 2014/03/4294 (revision of 2015-03-30), p. ec5 (PDF p. 39), Proof of Theorem 4, (EC.4)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.