Technical Note—Assortment Optimization with Small Consideration Sets
Jacob Feldman, Alice Paul, Huseyin Topaloglu
Operations Research · 2019 · Volume 67 · Issue 5
Abstract
We study a customer choice model that captures purchasing behavior when there is a limit on the number of times that a customer will substitute among the offered products. Under this model, we assume each customer is characterized by a ranked preference list of products and, upon arrival, will purchase the highest ranking offered product. Because we restrict ourselves to settings in which customers consider a limited number of products, we assume that these rankings contain at most k products. We call this model the k -product nonparametric choice model. We focus on the assortment optimization problem under this choice model. In this problem, the retailer wants to find the revenue-maximizing set of products to offer when the buying process of each customer is governed by the k -product nonparametric choice model. First, we show that the assortment problem is strongly NP-hard even for k = 2. Motivated by this result, we develop a linear programming–based randomized rounding algorithm that gives the best known approximation guarantee. We tighten the approximation guarantee further when each preference list contains at most two products and consider the case in which there is a limit on the number of products that can be offered to the customers.
Keywords
assortment optimization, customer choice models, linear programming, approximation algorithms
Enable JavaScript for citation tools and additional paper interactions.