The main contribution of this paper is to develop new techniques in approximate dynamic programming, along with the notions of rounded distributions and inventory filtering, to devise a quasi-PTAS for the capacitated assortment planning problem, recently studied by Goyal et al. (Oper Res 64(1):219–235, 2016). Motivated by real-life applications, their nested preference lists model stands as the only setting in dynamic assortment optimization where provably ϵ-optimal inventory levels can be efficiently computed. However, these findings crucially depend on certain distributional assumptions, leaving the general problem wide open in terms of approximability prior to this work. In addition to proposing the first rigorous approach for handling the nested preference lists model in its utmost generality, from a technical perspective, we augment the existing literature on dynamic programming with a number of promising ideas. These are novel algorithmic tools for efficiently keeping approximate distributions as part of the state description, while losing very little information and while accumulating only small approximation errors throughout the overall computation. From a conceptual perspective, at the cost of losing an ϵ-factor in optimality, we show how to dramatically improve on the truly exponential nature of standard dynamic programs, which seem essential for the purpose of computing optimal inventory levels.
Bibliographical notePublisher Copyright:
© 2018, Springer Science+Business Media, LLC, part of Springer Nature.
- Approximation scheme
- Assortment planning
- Dynamic programming
- Inventory management
- Rounded distributions
ASJC Scopus subject areas
- Computer Science (all)
- Computer Science Applications
- Applied Mathematics