Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(Dynamic Robust), p. 16, second line — J_t(x) = max_S min_v Σ φ_i(S, v)(r_i − ΔJ_{t+1}(x)) + J_{t+1}(x)

Proved
RobustMNL.Dynamic.dynamic_robust_rewrite

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

dynamic-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization

In the robust capacity-allocation model, let 1≤t≤T1 \le t \le T1≤t≤T and x≥1x \ge 1x≥1. Then the Bellman equation can be rewritten through the marginal value of capacity ΔJt+1(x)=Jt+1(x)−Jt+1(x−1)\Delta J_{t+1}(x) = J_{t+1}(x) - J_{t+1}(x-1)ΔJt+1​(x)=Jt+1​(x)−Jt+1​(x−1):

Jt(x)=max⁡St⊆A min⁡vt∈Vt{∑i∈Stϕi(St,vt) (ri−ΔJt+1(x))}+Jt+1(x).J_t(x) = \max_{S_t \subseteq \mathcal A}\ \min_{v_t \in \mathcal V_t} \Big\{ \sum_{i\in S_t} \phi_i(S_t, v_t)\,\big(r_i - \Delta J_{t+1}(x)\big) \Big\} + J_{t+1}(x).Jt​(x)=St​⊆Amax​ vt​∈Vt​min​{i∈St​∑​ϕi​(St​,vt​)(ri​−ΔJt+1​(x))}+Jt+1​(x).

This form displays one period of the dynamic problem as a static robust assortment problem with revenues ri−ΔJt+1(x)r_i - \Delta J_{t+1}(x)ri​−ΔJt+1​(x), plus the value of keeping the capacity.

Formalization Note JJJ is defined by the first line of (Dynamic Robust); this statement is its second line. The minimum is a real infimum over V t, compact, nonempty and positive by the standing hypothesis; the maximum is over all 2n2^n2n assortments.

Preamble
import Mathlib
import Definitions.Def_RobustMNL_Dynamic_ValueFunction
Formal statement
namespace RobustMNL.Dynamic

theorem dynamic_robust_rewrite {n : ℕ} (T : ℕ) (V : ℕ → Set (ℝ × (Fin n → ℝ)))
    (r : Fin n → ℝ) (hV : IsUncertaintySeq T V) (t x : ℕ) (ht : 1 ≤ t) (htT : t ≤ T) (hx : 1 ≤ x) :
    J T V r t x =
      (Finset.univ : Finset (Finset (Fin n))).sup' Finset.univ_nonempty
          (fun S => sInf ((fun p => ∑ i ∈ S, choiceProb S p i *
              (r i - marginalValue T V r (t + 1) x)) '' V t))
        + J T V r (t + 1) x := by sorry

end RobustMNL.Dynamic
Source
Rusmevichientong, Topaloglu, Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model, Operations Research (2012), doi:10.1287/opre.1120.1063, authors' manuscript of 20 Sep 2011, (Dynamic Robust), second line, p. 16
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