Sect. 5.3.2.1: the base-stock, posted-price policy — order up to y⁰(t) and price at p(t, d⁰(t)) below it; above it order nothing and set a rate at least d⁰(t), nondecreasing in the inventory
ProvedRevenueManagement.base_stock_posted_pricebase-stockdynamic-pricingoperations-researchposted-pricerevenue-managementsupermodularity
In the pricing-and-replenishment model under its assumptions, in period let maximize over all and , the problem (5.20) without the constraint . Then: (a) for every inventory , ordering up to and setting the rate (the posted price ) is optimal in (5.20); (b) for every it is optimal to order nothing, , with some rate , a price at most the posted price; (c) for , every optimal rate at with no order is matched by an optimal rate at with no order that is at least as large: the optimal rate is nondecreasing in the inventory. This is the book's statement with "higher" read weakly and without its interior-solution and lexicographic-selection conventions.
Preamble
import Definitions.Def_RevenueManagement_dynamicPricing
Formal statement
namespace RevenueManagement
variable {Ω : Type*} [MeasurableSpace Ω]
theorem base_stock_posted_price (M : ReplPricing Ω) (hM : M.IsModel) (t : ℕ) (ht : 1 ≤ t)
(htT : t ≤ M.T) (y0 d0 : ℝ) (hd0 : d0 ∈ Set.Icc 0 M.dbar)
(h0 : ∀ y d, d ∈ Set.Icc 0 M.dbar → M.objective t y d ≤ M.objective t y0 d0) :
(∀ x, x ≤ y0 → M.IsOptimal t x y0 d0) ∧
(∀ x, y0 ≤ x → ∃ d, d0 ≤ d ∧ M.IsOptimal t x x d) ∧
(∀ x x' d, y0 ≤ x → x ≤ x' → M.IsOptimal t x x d →
∃ d', d ≤ d' ∧ M.IsOptimal t x' x' d') := by sorry
end RevenueManagement
Source
Kalyan T. Talluri and Garrett J. van Ryzin, The Theory and Practice of Revenue Management, Kluwer/Springer 2004, DOI 10.1007/b139000, pp. 213-214, Sect. 5.3.2.1 (the base-stock, posted-price policy and its footnote; Federgruen and Heching 1999 for the complete proof)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.