Assortment optimization over time

作者：Davis James M^*; Topaloglu Huseyin; Williamson David P

来源：Operations Research Letters, 2015, 43(6): 608-611.

DOI：10.1016/j.orl.2015.08.007

• Choice models
• Revenue management
• Approximation algorithms
• Assortment optimization

In this note we introduce the problem of assortment optimization over time. We have a sequence of time steps and can introduce one new product per time step. Once introduced a product cannot be removed. The goal is to determine which products to introduce so as to maximize revenue over all time steps under some choice model. Given a 1/alpha-approximation algorithm for the capacitated assortment optimization problem we give a 1/2 alpha-approximation algorithm for this problem.

• 出版日期2015-11