Eqs. (5.11)–(5.13) — the adaptive decision at is robust feasible
ProvedRobustPower.Hypercube.eq_5_11_5_13_corner_rob_feasibleadaptive-optimizationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization
In the setting of (5.6)–(5.7), let be a scenario with , and entrywise for every . If is feasible for , then the static pair is feasible for : for every ,
No sign is assumed on , or ; the nonnegativity of and comes from the decision domains.
Preamble
import Definitions.Def_RobustPower_Hypercube_Problems
Formal statement
namespace RobustPower.Hypercube
/-- Inequalities (5.11)–(5.13) (p. 32): let `ω̄` be a scenario whose `A(ω̄)`, `B(ω̄)`
are entrywise minimal and whose `b(ω̄)` is entrywise maximal over `Ω`. For every
feasible solution `(x, y(·))` of `Π_Adapt(A,B,b,d)`, the static pair `(x, y(ω̄))` is
feasible for `Π_Rob(A,B,b,d)`. -/
theorem eq_5_11_5_13_corner_rob_feasible
{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₂))
(ωbar : Ω)
(hA : ∀ ω i j, A ωbar i j ≤ A ω i j)
(hB : ∀ ω i j, B ωbar i j ≤ B ω i j)
(hb : ∀ ω i, b ω i ≤ b ωbar i)
(x : Fin n₁ → ℝ) (y : Ω → Fin n₂ → ℝ)
(hxy : adaptFeasible A B b I₁ I₂ x y) :
robFeasible A B b I₁ I₂ x (y ωbar) := 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. 32, Eqs. (5.11)–(5.13)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.