Proof of Theorem 2, p. 37 — weak duality between the inner LP (C-18) and the constraints (11b)
ProvedDDMomentDRO.Type2.weak_duality_C18distributionally-robustlinear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1weak-duality
Fix a state , support points , next-stage values , a mean and a matrix . Let , that is, , , and . Let , and satisfy (11b):
Then
This is the weak half of the LP duality that the proof of Theorem 2 uses: the dual variables attached to the three equality constraints (C-18b)–(C-18d) give upper bounds on the inner maximization (C-18a).
Formalization Note , written (Aᵀ * B).trace. The membership includes (C-18e), which (10) as printed omits; without it the inequality fails.
Preamble
import Mathlib import Definitions.Def_DDMomentDRO_Type2_Setting
Formal statement
namespace DDMomentDRO.Type2
open Matrix
theorem weak_duality_C18 {I J K : ℕ}
(Qn : (Fin I → ℝ) → Fin K → ℝ) (ξ : Fin K → Fin J → ℝ)
(μ : (Fin I → ℝ) → Fin J → ℝ) (Sig : (Fin I → ℝ) → Matrix (Fin J) (Fin J) ℝ)
(x : Fin I → ℝ) (p : Fin K → ℝ) (hp : p ∈ amb2 ξ μ Sig x)
(s : ℝ) (u : Fin J → ℝ) (Y : Matrix (Fin J) (Fin J) ℝ)
(hdual : ∀ k, Qn x k ≤ s + u ⬝ᵥ ξ k + ((vecMulVec (ξ k - μ x) (ξ k - μ x))ᵀ * Y).trace) :
∑ k, p k * Qn x k ≤ s + u ⬝ᵥ μ x + ((Sig x)ᵀ * Y).trace := by sorry
end DDMomentDRO.Type2
Source
Yu & Shen, Multistage distributionally robust mixed-integer programming with decision-dependent moment-based ambiguity sets, arXiv:2002.12518v3, p. 37, proof of Theorem 2, (C-18)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.