Remark 9, p. 19 — closed-form separation: if (24) exceeds t, the point u built from λ lies in 𝒰^{FB}_ε and violates uᵀv ≤ t
ProvedDataDrivenRO.FwdBwd.remark_9p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimizationseparation-oracle
Let and in , , with , and with , i.e. is below the right-hand side of (24). Put
Then and : the inequality is a valid constraint for the robust problem that the current point violates.
This gives a closed-form separation oracle for the constraint .
Formalization Note The hypothesis "" is written with the right-hand side of (24), equal to by Theorem 6. The hypothesis is added: with it is exactly the case , where the page's formula for is defined.
Preamble
import Mathlib import Definitions.Def_DataDrivenRO_FwdBwd_Setting
Formal statement
namespace DataDrivenRO.FwdBwd
theorem remark_9 {d : ℕ} (mb mf sf sb : Fin d → ℝ) (hm : ∀ i, mb i ≤ mf i)
(hsf : ∀ i, 0 < sf i) (hsb : ∀ i, 0 < sb i) (ε : ℝ) (hε0 : 0 < ε) (hε1 : ε < 1)
(v : Fin d → ℝ) (hv : v ≠ 0) (t : ℝ) (ht : t < fbValue mb mf sf sb ε v) :
let lam : ℝ := Real.sqrt ((∑ i, if 0 < v i then v i ^ 2 * sf i ^ 2 else v i ^ 2 * sb i ^ 2) /
(2 * Real.log (1 / ε)))
let u : Fin d → ℝ := fun i =>
if 0 < v i then mf i + v i * sf i ^ 2 / lam else mb i + v i * sb i ^ 2 / lam
u ∈ UFB mb mf sf sb ε ∧ t < u ⬝ᵥ v := by sorry
end DataDrivenRO.FwdBwd
Source
Bertsimas, Gupta & Kallus, Data-Driven Robust Optimization, arXiv:1401.0212v2, Remark 9, p. 19; proof of Theorem 6, last sentence, p. ec5
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.