Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 584 — the dual (6) is reformulated as the semidefinite program (8)

Proved
MinimaxSLP.ObjSDP.dual6_eq_dual8

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

dualityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1semidefinite-programming

Let WWW, TTT, hhh satisfy Assumption 3 ({π:W′π≤q}≠∅\{\pi : W'\pi\le q\}\neq\emptyset{π:W′π≤q}=∅ for every q∈Rdq\in\mathbb R^dq∈Rd), let αk≥0\alpha_k\ge 0αk​≥0 for all kkk, and let xxx have a nonempty recourse set X(x)X(x)X(x). Then the set of objective values Q⋅Y+μ′y+y0Q\cdot Y+\mu'y+y_0Q⋅Y+μ′y+y0​ over the feasible points of the dual (6) equals the set of objective values over the feasible points of

min⁡Y,y,y0,wk Q⋅Y+μ′y+y0s.t.(Y12(y−αkwk)12(y−αkwk)′y0−βk)⪰0,  Wwk+Tx=h,  wk≥0,k=1,…,K.(8)\min_{Y,y,y_0,w_k}\ Q\cdot Y+\mu'y+y_0\quad\text{s.t.}\quad \begin{pmatrix}Y & \tfrac12(y-\alpha_k w_k)\\ \tfrac12(y-\alpha_k w_k)' & y_0-\beta_k\end{pmatrix}\succeq 0,\ \ Ww_k+Tx=h,\ \ w_k\ge 0,\quad k=1,\dots,K. \tag{8}Y,y,y0​,wk​min​ Q⋅Y+μ′y+y0​s.t.(Y21​(y−αk​wk​)′​21​(y−αk​wk​)y0​−βk​​)⪰0,  Wwk​+Tx=h,  wk​≥0,k=1,…,K.(8)

In particular ZD(x)Z_D(x)ZD​(x) equals the optimal value of (8), and one is attained exactly when the other is.

This is the reformulation of the second-stage dual as a polynomial-sized semidefinite program; optimizing over xxx as well gives (7).

Formalization Note The identity is stated for the sets of objective values (which gives the equality of the infima ZD and ZD8 as a second conjunct), so it holds without any assumption on the moments (μ,Q)(\mu,Q)(μ,Q).

Preamble
import Mathlib
import Definitions.Def_MomentDRO_Conf_Setting
import Definitions.Def_MinimaxSLP_ObjSDP_Model

open MeasureTheory Matrix
Formal statement
namespace MinimaxSLP.ObjSDP

/-- p. 584: the dual (6) can be reformulated as the semidefinite program (8). The two programs
have the same set of objective values, hence the same optimal value `Z_D(x)`, attained in one iff
attained in the other. -/
theorem dual6_eq_dual8 {n r d K : ℕ} [NeZero K]
    (W : Matrix (Fin r) (Fin d) ℝ) (T : Matrix (Fin r) (Fin n) ℝ) (h : Fin r → ℝ)
    (α β : Fin K → ℝ) (hα : ∀ k, 0 ≤ α k)
    (μ : Fin d → ℝ) (Q : Matrix (Fin d) (Fin d) ℝ)
    (hA3 : ∀ q : Fin d → ℝ, ∃ π : Fin r → ℝ, Wᵀ *ᵥ π ≤ q)
    (x : Fin n → ℝ) (hrec : (recourseSet W T h x).Nonempty) :
    dualValues6 W T h α β μ Q x = dualValues8 W T h α β μ Q x ∧
      ZD W T h α β μ Q x = ZD8 W T h α β μ Q x := by sorry

end MinimaxSLP.ObjSDP
Source
Bertsimas, Doan, Natarajan & Teo, Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion, Math. Oper. Res. 35(3), 2010, p. 584, (8)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me