IDEAS home Printed from https://ideas.repec.org/p/hal/wpaper/hal-03501718.html
   My bibliography  Save this paper

Assortment Optimization with Multi-Item Basket Purchase under the Multivariate MNL Model

Author

Listed:
  • Chengyi Lyu

    (Leeds School of Business [Boulder] - University of Colorado [Boulder])

  • Stefanus Jasin

    (Stephen M. Ross School of Business - University of Michigan [Ann Arbor] - University of Michigan System)

  • Sajjad Najafi

    (HEC Paris - Ecole des Hautes Etudes Commerciales)

  • Huanan Zhang

    (Leeds School of Business [Boulder] - University of Colorado [Boulder])

Abstract

Assortment selection is one of the most important decisions faced by retailers. Most existing papers in the literature assume that customers select at most one item out of the offered assortment. While this is valid in some cases, it contradicts practical observations in many shopping experiences, both in online and brick-and-mortar retail, where customers may buy a basket of products instead of a single item. In this paper we incorporate customers' multi-item purchase behavior into the assortment optimization problem. We consider both uncapacitated and capacitated assortment problems under the so-called Multivariate MNL (MVMNL) model, which is one of the most popular multivariate choice models used in the marketing and empirical literature. We first show that the traditional revenue-ordered assortment may not be optimal. Nonetheless, we show that under some mild conditions, a certain variant of this property holds (in the uncapacitated assortment problem) under the MVMNL model---that is, the optimal assortment consists of revenue-ordered local assortments in each group. Finding the optimal assortment is still computationally expensive as the revenue thresholds for different groups cannot be computed separately. We show that the optimization problem under MVMNL is NP-complete even in the setting where there is no interaction among the product categories. Motivated by this result, we develop FPTAS for several variants of (capacitated and uncapacitated) assortment problems under MVMNL. Our analysis reveals that disregarding customers' multi-item purchase behavior in assortment decisions can indeed have a significant negative impact on a retailer's profitability, demonstrating its practical importance in retail. In particular, we show that our proposed algorithm can improve a retailer's expected total revenues (compared to some benchmark policies that do not properly take into account the impact of customer's multi-item choice behavior in assortment decisions) by around 5-7% for the uncapacitated problems, and around 10-54% for the capacitated problems, both of which are quite significant.

Suggested Citation

  • Chengyi Lyu & Stefanus Jasin & Sajjad Najafi & Huanan Zhang, 2021. "Assortment Optimization with Multi-Item Basket Purchase under the Multivariate MNL Model," Working Papers hal-03501718, HAL.
  • Handle: RePEc:hal:wpaper:hal-03501718
    DOI: 10.2139/ssrn.3818886
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:wpaper:hal-03501718. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.