Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.4 — ΠRob(b)\Pi_{\mathrm{Rob}}(b)ΠRob​(b) is the deterministic problem with the worst right-hand side

Proved
RobustPower.Hypercube.theorem_2_4_robust_eq_deterministic

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

mixed-integer-optimizationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization

Let A∈Rm×n1A\in\mathbb R^{m\times n_1}A∈Rm×n1​, B∈Rm×n2B\in\mathbb R^{m\times n_2}B∈Rm×n2​, c∈R+n1c\in\mathbb R^{n_1}_+c∈R+n1​​, d∈R+n2d\in\mathbb R^{n_2}_+d∈R+n2​​, let I1I_1I1​ be the integer coordinates of the first stage, and let the second-stage variables be continuous (p2=0p_2=0p2​=0). Let Ω\OmegaΩ be a nonempty scenario set with right-hand sides b(ω)∈R+mb(\omega)\in\mathbb R^m_+b(ω)∈R+m​ that are bounded above, and let

bjh=sup⁡ω∈Ωbj(ω),j=1,…,m.b^h_j=\sup_{\omega\in\Omega} b_j(\omega),\qquad j=1,\dots,m.bjh​=ω∈Ωsup​bj​(ω),j=1,…,m.

Then:

  1. a pair (x,y)(x,y)(x,y) is feasible for the robust problem ΠRob(b)\Pi_{\mathrm{Rob}}(b)ΠRob​(b) (1.2) if and only if it is feasible for the deterministic problem Π\PiΠ: Ax+By≥bhAx+By\ge b^hAx+By≥bh, x∈R+n1−p1×Z+p1x\in\mathbb R^{n_1-p_1}_+\times\mathbb Z^{p_1}_+x∈R+n1​−p1​​×Z+p1​​, y∈R+n2y\in\mathbb R^{n_2}_+y∈R+n2​​;
  2. consequently zRob(b)=z(Π)z_{\mathrm{Rob}}(b)=z(\Pi)zRob​(b)=z(Π).

The robust problem, with one constraint block per scenario, is thus a single mixed integer program whose size does not depend on the uncertainty set. The same worst-scenario principle, applied to all the data at once, drives Theorem 5.4.

Formalization Note Values are extended-real infima, so the equality also covers infeasible problems. The paper's max⁡\maxmax is a supremum here; boundedness above of the right-hand sides replaces its attainment, so the statement contains the paper's case.

Preamble
import Definitions.Def_RobustPower_Hypercube_RhsProblems
Formal statement
namespace RobustPower.Hypercube

/-- Theorem 2.4 (p. 17): with `bʰ` the coordinatewise maximum of the right-hand
sides, a pair `(x, y)` is feasible for `Π_Rob(b)` exactly when it is feasible for
the deterministic problem `Π` with right-hand side `bʰ`, and `z_Rob(b) = z(Π)`.
The second-stage variables are continuous (`p₂ = 0`, `I₂ = ∅`), as in `Π` on the page. -/
theorem theorem_2_4_robust_eq_deterministic
    {m n₁ n₂ : ℕ} {Ω : Type*} [Nonempty Ω]
    (A : Matrix (Fin m) (Fin n₁) ℝ) (B : Matrix (Fin m) (Fin n₂) ℝ)
    (b : Ω → Fin m → ℝ) (I₁ : Set (Fin n₁))
    (c : Fin n₁ → ℝ) (d : Fin n₂ → ℝ)
    (hc : 0 ≤ c) (hd : 0 ≤ d) (hb : ∀ ω, 0 ≤ b ω)
    (hbdd : BddAbove (Set.range b)) :
    (∀ (x : Fin n₁ → ℝ) (y : Fin n₂ → ℝ),
      robFeasibleRhs A B b I₁ ∅ x y ↔ detFeasible A B (worstRhs b) I₁ ∅ x y) ∧
    zRobRhs A B b I₁ ∅ c d = zDet A B (worstRhs b) I₁ ∅ c d := by sorry

end RobustPower.Hypercube
Source
Bertsimas & Goyal, On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems, authors' manuscript (MIT DSpace) of Math. Oper. Res. DOI 10.1287/moor.1090.0440, p. 17, Theorem 2.4
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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