(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)
ProvedRobustMNL.Dynamic.dynamic_robust_rewritedynamic-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization
In the robust capacity-allocation model, let and . Then the Bellman equation can be rewritten through the marginal value of capacity :
This form displays one period of the dynamic problem as a static robust assortment problem with revenues , plus the value of keeping the capacity.
Formalization Note 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 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.