Proof of Proposition 2 — strong duality for (22)–(23): (23) has an optimal solution with value
ProvedWorstCaseCVaR.Box.strong_dualitydualitylinear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let and suppose the linear program (22),
is feasible. Then its dual (23),
has an optimal solution, and every optimal solution satisfies
This is the strong duality step of the proof of Proposition 2: it lets the worst-case constraint (18) be replaced by the explicit linear constraints (26)–(28).
Preamble
import Mathlib import Definitions.Def_WorstCaseCVaR_Box_DualPair open Matrix
Formal statement
namespace WorstCaseCVaR.Box
/-- Proof of Proposition 2, p. 1167: strong duality for the pair (22)–(23). If (22) is
feasible, then (23) has an optimal solution, and the optimal value of (23) equals `γ*(u)`. -/
theorem strong_duality {S : ℕ} (ηlo ηhi u : Fin S → ℝ)
(hfeas : (lp22Feasible ηlo ηhi).Nonempty) :
(∃ d, IsOptimal23 ηlo ηhi u d) ∧
∀ d, IsOptimal23 ηlo ηhi u d → lp23Obj ηlo ηhi d = gammaStar ηlo ηhi u := by sorry
end WorstCaseCVaR.Box
Source
Zhu & Fukushima, Worst-Case Conditional Value-at-Risk with Application to Robust Portfolio Management, Oper. Res. 57(5), 2009, p. 1167, proof of Proposition 2
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.