IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v24y2022i2p1220-1240.html

Omnichannel Assortment Optimization Under the Multinomial Logit Model with a Features Tree

Author

Listed:
  • Venus Lo

    (Department of Management Sciences, City University of Hong Kong, Kowloon, Hong Kong S.A.R.;)

  • Huseyin Topaloglu

    (School of Operations Research and Information Engineering, Cornell Tech, New York, New York 10011)

Abstract

Problem definition : We consider the assortment optimization problem of a retailer that operates a physical store and an online store. The products that can be offered are described by their features. Customers purchase among the products that are offered in their preferred store. However, customers who purchase from the online store can first test out products offered in the physical store. These customers revise their preferences for online products based on the features that are shared with the in-store products. The full assortment is offered online, and the goal is to select an assortment for the physical store to maximize the retailer’s total expected revenue. Academic/practical relevance : The physical store’s assortment affects preferences for online products. Unlike traditional assortment optimization, the physical store’s assortment influences revenue from both stores. Methodology : We introduce a features tree to organize products by features. The nonleaf vertices on the tree correspond to features, and the leaf vertices correspond to products. The ancestors of a leaf correspond to features of the product. Customers choose among the products within their store’s assortment according to the multinomial logit model. We consider two settings; either all customers purchase online after viewing products in the physical store, or we have a mix of customers purchasing from each store. Results : When all customers purchase online, we give an efficient algorithm to find the optimal assortment to display in the physical store. With a mix of customers, the problem becomes NP-hard, and we give a fully polynomial-time approximation scheme. We numerically demonstrate that we can closely approximate the case where products have arbitrary combinations of features without a tree structure and that our fully polynomial-time approximation scheme performs remarkably well. Managerial implications : We characterize conditions under which it is optimal to display expensive products with underrated features and expose inexpensive products with overrated features.

Suggested Citation

  • Venus Lo & Huseyin Topaloglu, 2022. "Omnichannel Assortment Optimization Under the Multinomial Logit Model with a Features Tree," Manufacturing & Service Operations Management, INFORMS, vol. 24(2), pages 1220-1240, March.
  • Handle: RePEc:inm:ormsom:v:24:y:2022:i:2:p:1220-1240
    DOI: 10.1287/msom.2021.1001
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2021.1001
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.2021.1001?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Juan José Miranda Bront & Isabel Méndez-Díaz & Gustavo Vulcano, 2009. "A Column Generation Algorithm for Choice-Based Network Revenue Management," Operations Research, INFORMS, vol. 57(3), pages 769-784, June.
    2. Paat Rusmevichientong & David Shmoys & Chaoxu Tong & Huseyin Topaloglu, 2014. "Assortment Optimization under the Multinomial Logit Model with Random Choice Parameters," Production and Operations Management, Production and Operations Management Society, vol. 23(11), pages 2023-2039, November.
    3. Daria Dzyabura & Srikanth Jagabathula, 2018. "Offline Assortment Optimization in the Presence of an Online Channel," Management Science, INFORMS, vol. 64(6), pages 2767-2786, June.
    4. Guang Li & Paat Rusmevichientong & Huseyin Topaloglu, 2015. "The d -Level Nested Logit Model: Assortment and Price Optimization Problems," Operations Research, INFORMS, vol. 63(2), pages 325-342, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chenxu Ke & Lijian Lu & Ruxian Wang, 2025. "Efficient Frontier and Applications in Product Offering and Pricing," Manufacturing & Service Operations Management, INFORMS, vol. 27(2), pages 389-407, March.
    2. Yufeng Cao & Paat Rusmevichientong & Huseyin Topaloglu, 2023. "Revenue Management Under a Mixture of Independent Demand and Multinomial Logit Models," Operations Research, INFORMS, vol. 71(2), pages 603-625, March.
    3. Vasilyev, Andrey & Maier, Sebastian & Seifert, Ralf W., 2025. "Optimizing omnichannel assortments and inventory provisions under the multichannel attraction model," European Journal of Operational Research, Elsevier, vol. 324(3), pages 799-813.
    4. Hassanzadeh, Alborz & Martínez-de-Albéniz, Victor, 2026. "Positioning of omnichannel inventories to protect revenue," International Journal of Production Economics, Elsevier, vol. 291(C).
    5. Yicheng Liu & Xiao Alison Chen & Yan Liu & Zizhuo Wang, 2025. "Simultaneous vs. Sequential: Optimal Assortment Recommendation in Multistore Retailing," Manufacturing & Service Operations Management, INFORMS, vol. 27(3), pages 825-842, May.
    6. Yuyang Tan & Hao Gong & Chunxiang Guo, 2025. "Bi-Objective Optimization of Product Selection and Ranking Considering Sequential Search," SAGE Open, , vol. 15(3), pages 21582440251, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Flores, Alvaro & Berbeglia, Gerardo & Van Hentenryck, Pascal, 2019. "Assortment optimization under the Sequential Multinomial Logit Model," European Journal of Operational Research, Elsevier, vol. 273(3), pages 1052-1064.
    2. Mika Sumida & Guillermo Gallego & Paat Rusmevichientong & Huseyin Topaloglu & James Davis, 2021. "Revenue-Utility Tradeoff in Assortment Optimization Under the Multinomial Logit Model with Totally Unimodular Constraints," Management Science, INFORMS, vol. 67(5), pages 2845-2869, May.
    3. Yicheng Liu & Xiao Alison Chen & Yan Liu & Zizhuo Wang, 2025. "Simultaneous vs. Sequential: Optimal Assortment Recommendation in Multistore Retailing," Manufacturing & Service Operations Management, INFORMS, vol. 27(3), pages 825-842, May.
    4. Dimitris Bertsimas & Velibor V. Mišić, 2019. "Exact First-Choice Product Line Optimization," Operations Research, INFORMS, vol. 67(3), pages 651-670, May.
    5. Ali Aouad & Vivek Farias & Retsef Levi, 2021. "Assortment Optimization Under Consider-Then-Choose Choice Models," Management Science, INFORMS, vol. 67(6), pages 3368-3386, June.
    6. Fernando Bernstein & Yuan Guo, 2023. "Managing Customer Search: Assortment Planning for a Subscription Box Service," Manufacturing & Service Operations Management, INFORMS, vol. 25(5), pages 1623-1642, September.
    7. Ali Aouad & Danny Segev, 2021. "Display Optimization for Vertically Differentiated Locations Under Multinomial Logit Preferences," Management Science, INFORMS, vol. 67(6), pages 3519-3550, June.
    8. Meng Qi & Ho‐Yin Mak & Zuo‐Jun Max Shen, 2020. "Data‐driven research in retail operations—A review," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(8), pages 595-616, December.
    9. Jacob B. Feldman & Huseyin Topaloglu, 2017. "Revenue Management Under the Markov Chain Choice Model," Operations Research, INFORMS, vol. 65(5), pages 1322-1342, October.
    10. Antoine Désir & Vineet Goyal & Jiawei Zhang, 2022. "Technical Note—Capacitated Assortment Optimization: Hardness and Approximation," Operations Research, INFORMS, vol. 70(2), pages 893-904, March.
    11. Çömez-Dolgan, Nagihan & Moussawi-Haidar, Lama & Jaber, Mohamad Y. & Cephe, Ecem, 2022. "Capacitated assortment planning of a multi-location system under transshipments," International Journal of Production Economics, Elsevier, vol. 251(C).
    12. Çömez-Dolgan, Nagihan & Dağ, Hilal & Fescioglu-Unver, Nilgun & Şen, Alper, 2023. "Multi-plant manufacturing assortment planning in the presence of transshipments," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1033-1050.
    13. Strauss, Arne K. & Klein, Robert & Steinhardt, Claudius, 2018. "A review of choice-based revenue management: Theory and methods," European Journal of Operational Research, Elsevier, vol. 271(2), pages 375-387.
    14. Peng Shi, 2022. "Optimal Priority-Based Allocation Mechanisms," Management Science, INFORMS, vol. 68(1), pages 171-188, January.
    15. Yufeng Cao & Paat Rusmevichientong & Huseyin Topaloglu, 2023. "Revenue Management Under a Mixture of Independent Demand and Multinomial Logit Models," Operations Research, INFORMS, vol. 71(2), pages 603-625, March.
    16. Zhang, Le & Azadeh, Shadi Sharif & Jiang, Hai, 2025. "Exact and heuristic algorithms for cardinality-constrained assortment optimization problem under the cross-nested logit model," European Journal of Operational Research, Elsevier, vol. 324(1), pages 183-199.
    17. Daria Dzyabura & Srikanth Jagabathula, 2018. "Offline Assortment Optimization in the Presence of an Online Channel," Management Science, INFORMS, vol. 64(6), pages 2767-2786, June.
    18. Guang Li & Paat Rusmevichientong & Huseyin Topaloglu, 2015. "The d -Level Nested Logit Model: Assortment and Price Optimization Problems," Operations Research, INFORMS, vol. 63(2), pages 325-342, April.
    19. Yuyang Tan & Hao Gong & Chunxiang Guo, 2025. "Bi-Objective Optimization of Product Selection and Ranking Considering Sequential Search," SAGE Open, , vol. 15(3), pages 21582440251, August.
    20. Ruxian Wang & Zizhuo Wang, 2017. "Consumer Choice Models with Endogenous Network Effects," Management Science, INFORMS, vol. 63(11), pages 3944-3960, November.

    More about this item

    Keywords

    ;
    ;
    ;

    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:inm:ormsom:v:24:y:2022:i:2:p:1220-1240. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.