Proof of Proposition 2 — a feasible point of (16)–(20) plus an optimal solution of (23) is feasible to (24)–(30)
ProvedWorstCaseCVaR.Box.feasible_16_to_24cvarlinear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization
Let , scenarios , a set , , and box data be given. If is feasible to (16)–(20) with and is an optimal solution of the linear program (23) with this , then is feasible to (24)–(30); in particular
This is the feasibility half of the converse direction of Proposition 2.
Preamble
import Mathlib import Definitions.Def_WorstCaseCVaR_Box_Problems open Matrix
Formal statement
namespace WorstCaseCVaR.Box
/-- Proof of Proposition 2, pp. 1167–1168: if `(x, u, α, θ)` is feasible to (16)–(20) with
`𝒫_π = 𝒫_π^B` and `(z, ξ, ω)` is an optimal solution to (23) with this `u`, then
`(x, u, z, ξ, ω, α, θ)` is feasible to (24)–(30). -/
theorem feasible_16_to_24 {n m S : ℕ} (f : (Fin n → ℝ) → (Fin m → ℝ) → ℝ)
(ys : Fin S → Fin m → ℝ) (𝒳 : Set (Fin n → ℝ)) (β : ℝ) (hβ0 : 0 < β) (hβ1 : β < 1)
(π0 ηlo ηhi : Fin S → ℝ) :
∀ p ∈ feas16 f ys 𝒳 β π0 ηlo ηhi, ∀ d, IsOptimal23 ηlo ηhi p.u d →
p.withDual d ∈ feas24 f ys 𝒳 β π0 ηlo ηhi := 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, pp. 1167–1168, proof of Proposition 2
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.