The revenue of an assortment equals the revenue of its price assignment
ProvedRevenueOrdered.UDPmin.rev_eq_revenue_priceOfassortment-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pricingreduction
In the assortment instance built from a instance with at least one consumer (Theorem 4.6), for every assortment ,
where , and is a price above every valuation when contains no pair with first coordinate .
Consequently the optimum of the assortment instance is at most that of the pricing instance.
Formalization Note The paper's price is the real (Remark, p. 18).
Preamble
import Mathlib import Definitions.Def_RevenueOrdered_UDPmin_Model import Definitions.Def_RevenueOrdered_UDPmin_Pricing import Definitions.Def_RevenueOrdered_UDPmin_Reduction
Formal statement
namespace RevenueOrdered.UDPmin
/-- The revenue of an assortment `S` of the Theorem 4.6 instance equals the revenue of its price
assignment `p_S` (Berbeglia–Joret, arXiv:1606.01371v3, §4.5.1, proof of Theorem 4.6, p. 19). -/
theorem rev_eq_revenue_priceOf {X M : Type*} [Fintype X] [DecidableEq X] [Fintype M] [Nonempty M]
(I : Instance X M) (S : Finset (RedProd I)) :
RevenueOrdered.Tightness.rev (redP I) (redRev I) S = revenue I (priceOf I S) := by sorry
end RevenueOrdered.UDPmin
Source
Berbeglia & Joret, Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments, arXiv:1606.01371v3, §4.5.1, proof of Theorem 4.6, p. 19
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.