Technical Note—Approximation Schemes for Capacity-Constrained Assortment Optimization Under the Nested Logit Model

Danny Segev ()
Additional contact information
Danny Segev: Department of Statistics and Operations Research, Tel Aviv University, Tel Aviv 69978, Israel

Operations Research, 2022, vol. 70, issue 5, 2820-2836

Abstract: The main contribution of this paper resides in proposing a carefully crafted dynamic programming approach for capacitated assortment optimization under the nested logit model in its utmost generality. Specifically, we show that the optimal revenue can be efficiently approached within any degree of accuracy by synthesizing ideas related to continuous-state dynamic programming, state space discretization, and sensitivity analysis of modified revenue functions. These developments allow us to devise the first fully polynomial-time approximation scheme in this context, thus resolving fundamental open questions posed in previous papers.

Keywords: Revenue Management and Marketing Analytics; assortment optimization; approximation scheme; dynamic programming (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.2022.2336 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:70:y:2022:i:5:p:2820-2836

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().