Theorem 5.4 — for hypercube uncertainty,
ProvedRobustPower.Hypercube.theorem_5_4_robust_eq_adaptConsider the two-stage mixed integer problems (5.6)–(5.7) in which the constraint matrices, the right-hand side and the second-stage cost are all uncertain: scenario has data , , and , and the first-stage cost is . The integer coordinates , of the two stages are arbitrary.
Suppose the uncertainty set is a hypercube:
for some , , where . Then
For box uncertainty, even in the constraint matrix, adapting the second-stage decision to the realized scenario gains nothing over a single static decision.
Formalization Note and are extended-real infima (no optimal solution is assumed; both are when infeasible). The hypercube hypothesis is an equality: the realized data are the whole box, not a subset of it.
import Definitions.Def_RobustPower_Hypercube_DataBox import Definitions.Def_RobustPower_Hypercube_Problems
namespace RobustPower.Hypercube
/-- Theorem 5.4 (p. 31): if the uncertainty set
`U = {(A(ω), B(ω), b(ω), d(ω)) | ω ∈ Ω}` is a hypercube in `ℝ^N`,
`N = m n₁ + m n₂ + m + n₂`, then `z_Rob(A,B,b,d) = z_Adapt(A,B,b,d)`. -/
theorem theorem_5_4_robust_eq_adapt
{m n₁ n₂ : ℕ} {Ω : Type*}
(A : Ω → Matrix (Fin m) (Fin n₁) ℝ)
(B : Ω → Matrix (Fin m) (Fin n₂) ℝ)
(b : Ω → Fin m → ℝ)
(I₁ : Set (Fin n₁)) (I₂ : Set (Fin n₂))
(c : Fin n₁ → ℝ) (d : Ω → Fin n₂ → ℝ)
(hc : 0 ≤ c) (hd : ∀ ω, 0 ≤ d ω)
(hU : IsHypercube (uncertaintySet A B b d)) :
zRob A B b I₁ I₂ c d = zAdapt A B b I₁ I₂ c d := by sorry
end RobustPower.Hypercube
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.