Eq. (3), p. 28 — Z_1(n) = r_1{nP[D_1 ≥ n] + Σ_{j<n} jP[D_1 = j]}
ProvedLowerFareFirst.Critical.eq3_Z1_closed_formairline-revenue-managementdynamic-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Consider the seat management model with lower fare classes booking first: fare classes with fares , integer-valued demands on a probability space, and the optimal expected revenue with empty seats when only classes may book, under the standing assumptions of §1.
When only the highest class may book, the optimal expected revenue is given in closed form: for every ,
The right-hand side is : with a single class every request is accepted while seats remain. Equation (3) is the base case of the paper's induction and yields the marginal seat value (4).
Preamble
import Mathlib import Definitions.Def_LowerFareFirst_Critical_Model
Formal statement
namespace LowerFareFirst.Critical
open MeasureTheory
theorem eq3_Z1_closed_form {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω)
(D : ℕ → Ω → ℕ) (r : ℕ → ℝ) (c : ℕ)
(hM : IsSeatModel μ D r c) :
∀ n : ℕ, Z μ D r 1 n =
r 1 * ((n : ℝ) * probGe μ D 1 n + ∑ j ∈ Finset.range n, (j : ℝ) * probEq μ D 1 j) := by sorry
end LowerFareFirst.Critical
Source
Wollmer (1992), Operations Research 40(1), §2, Eq. (3), p. 28
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.