p. 31 display —
ProvedRobustPower.Hypercube.p31_adapt_le_robadaptive-optimizationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization
In the setting of (5.6)–(5.7), with and for every scenario, the adaptive optimum never exceeds the robust optimum:
No assumption on the uncertainty set is needed. This is the first half of the proof of Theorem 5.4.
Preamble
import Definitions.Def_RobustPower_Hypercube_Problems
Formal statement
namespace RobustPower.Hypercube
/-- First half of the proof of Theorem 5.4 (p. 31): a static solution `(x, y)` of
`Π_Rob(A,B,b,d)` used in every scenario is feasible for `Π_Adapt(A,B,b,d)` with the
same cost, so `z_Adapt(A,B,b,d) ≤ z_Rob(A,B,b,d)`. No assumption on the uncertainty set. -/
theorem p31_adapt_le_rob
{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 ω) :
zAdapt A B b I₁ I₂ c d ≤ zRob A B b I₁ I₂ c d := 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, p. 31, proof of Theorem 5.4, first display
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.