Proof of Theorem 2.2, p. 586 — if with then
ProvedMinimaxSLP.ObjExtremal.scaled_weak_dualitydualitylinear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be such that , and assume Assumption 3. Let , and with , i.e. is a dual feasible solution of the second-stage problem . Then
In the proof of Theorem 2.2 this is applied to each block of an optimal solution of (9), whose constraint is .
Preamble
import Mathlib import Definitions.Def_MomentDRO_Conf_Setting import Definitions.Def_MinimaxSLP_ObjExtremal_Model open MeasureTheory Matrix Filter Topology
Formal statement
namespace MinimaxSLP.ObjExtremal
/-- Proof of Theorem 2.2 (p. 586): if `p` is dual feasible for `𝒬(α v, x)`, i.e.
`W′p ≤ α v`, with `α ≥ 0`, then `α 𝒬(v, x) ≥ (h − T x)′p`. -/
theorem scaled_weak_duality {n r d : ℕ}
(W : Matrix (Fin r) (Fin d) ℝ) (T : Matrix (Fin r) (Fin n) ℝ) (h : Fin r → ℝ)
(hA3 : ∀ q : Fin d → ℝ, ∃ π : Fin r → ℝ, Wᵀ *ᵥ π ≤ q)
(x : Fin n → ℝ) (hrec : (MinimaxSLP.ObjSDP.recourseSet W T h x).Nonempty)
(a : ℝ) (ha : 0 ≤ a) (v : Fin d → ℝ) (π : Fin r → ℝ) (hπ : Wᵀ *ᵥ π ≤ a • v) :
(h - T *ᵥ x) ⬝ᵥ π ≤ a * MinimaxSLP.ObjSDP.Qval W T h v x := by sorry
end MinimaxSLP.ObjExtremal
Source
Bertsimas, Doan, Natarajan & Teo, Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion, Math. Oper. Res. 35(3), 2010, p. 586, proof of Theorem 2.2
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.