In this paper, we consider a personalized assortment planning problem under inventory constraints, where the type of each arriving customer is defined by a primary item of interest. As long as that item is in stock, the customer adds it to her shopping cart, at which point the retailer can...

We present an efficient dynamic programming algorithm to determine the optimal assortment and inventory levels in a single-period problem with stockout-based substitution. In our model, total customer demand is random and comprises of a fixed proportion of customers of different types. Customer...