Eqs. (5.8)–(5.10) — on a hypercube the worst corner is a scenario
ProvedRobustPower.Hypercube.eq_5_8_5_10_worst_scenariop2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimizationuncertainty-sets
Let be a scenario set with data , and suppose the uncertainty set is a hypercube. Then there is a scenario whose data are entrywise the worst possible:
for all ; that is, , , and entrywise for every .
This is where the hypercube assumption enters the proof of Theorem 5.4: for a general uncertainty set the entrywise extremes need not be realized by a single scenario.
Preamble
import Definitions.Def_RobustPower_Hypercube_DataBox
Formal statement
namespace RobustPower.Hypercube
/-- Equations (5.8)–(5.10) (pp. 31–32): if the uncertainty set is a hypercube, the
data `vec(Ā, B̄, b̄, d̄)` made of the entrywise minima of `A(ω)`, `B(ω)` and the
entrywise maxima of `b(ω)`, `d(ω)` over `ω ∈ Ω` is realized by a scenario `ω̄`. -/
theorem eq_5_8_5_10_worst_scenario
{m n₁ n₂ : ℕ} {Ω : Type*}
(A : Ω → Matrix (Fin m) (Fin n₁) ℝ)
(B : Ω → Matrix (Fin m) (Fin n₂) ℝ)
(b : Ω → Fin m → ℝ) (d : Ω → Fin n₂ → ℝ)
(hU : IsHypercube (uncertaintySet A B b d)) :
∃ ωbar : Ω,
(∀ ω i j, A ωbar i j ≤ A ω i j) ∧
(∀ ω i j, B ωbar i j ≤ B ω i j) ∧
(∀ ω i, b ω i ≤ b ωbar i) ∧
(∀ ω j, d ω j ≤ d ωbar j) := by sorry
end RobustPower.Hypercube
Source
Bertsimas & Goyal, On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems, authors' manuscript (MIT DSpace) of Math. Oper. Res. DOI 10.1287/moor.1090.0440, pp. 31–32, Eqs. (5.8)–(5.10) and the sentence following them
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.