[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v67y2019i3p651-670.html
   My bibliography  Save this article

Exact First-Choice Product Line Optimization

Author

Listed:
  • Dimitris Bertsimas

    (Sloan School of Management and Operations Research Center, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139)

  • Velibor V. Mišić

    (Anderson School of Management, University of California, Los Angeles, Los Angeles, California 90095)

Abstract
Which products should a firm offer based on its customers’ preferences? This is the question posed in the problem of product line design, a well-studied and notoriously difficult problem that is central in marketing science. In “Exact First-Choice Product Line Optimization” by Dimitris Bertsimas and Velibor V. Mišić, the authors propose a new approach for solving this problem when segments of customers choose products according to a ranking. They propose a new mixed-integer optimization model of the problem, which they show to be tighter than prior formulations, and a solution approach based on Benders decomposition, which exploits the surprising fact that the subproblem can be solved efficiently for both integer and fractional master solutions. A well-known product line instance based on a conjoint data set of over 3,000 products and 300 respondents, which required a week of computation time to solve in prior work, is solved by the authors’ approach in just over 10 minutes.

Suggested Citation

  • Dimitris Bertsimas & Velibor V. Mišić, 2019. "Exact First-Choice Product Line Optimization," Operations Research, INFORMS, vol. 67(3), pages 651-670, May.
    • Handle: RePEc:inm:oropre:v:67:y:2019:i:3:p:651-670
    DOI: 10.1287/opre.2018.1825
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/opre.2018.1825
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2018.1825?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. Kraus, Ursula G. & Yano, Candace Arai, 2003. "Product line selection and pricing under a share-of-surplus choice model," European Journal of Operational Research, Elsevier, vol. 150(3), pages 653-671, November.
    2. Jean-François Cordeau & Goran Stojković & François Soumis & Jacques Desrosiers, 2001. "Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling," Transportation Science, INFORMS, vol. 35(4), pages 375-388, November.
    3. Olivier Toubia & Duncan I. Simester & John R. Hauser & Ely Dahan, 2003. "Fast Polyhedral Adaptive Conjoint Estimation," Marketing Science, INFORMS, vol. 22(3), pages 273-303.
    4. Rajeev Kohli & Khaled Boughanmi & Vikram Kohli, 2019. "Randomized Algorithms for Lexicographic Inference," Operations Research, INFORMS, vol. 67(2), pages 357-375, March.
    5. Alexandre Belloni & Robert Freund & Matthew Selove & Duncan Simester, 2008. "Optimizing Product Line Designs: Efficient Methods and Comparisons," Management Science, INFORMS, vol. 54(9), pages 1544-1552, September.
    6. Dorothee Honhon & Sreelata Jonnalagedda & Xiajun Amy Pan, 2012. "Optimal Algorithms for Assortment Selection Under Ranking-Based Consumer Choice Models," Manufacturing & Service Operations Management, INFORMS, vol. 14(2), pages 279-289, April.
    7. Jacob B. Feldman & Huseyin Topaloglu, 2017. "Revenue Management Under the Markov Chain Choice Model," Operations Research, INFORMS, vol. 65(5), pages 1322-1342, October.
    8. Gregory Dobson & Shlomo Kalish, 1988. "Positioning and Pricing a Product Line," Marketing Science, INFORMS, vol. 7(2), pages 107-125.
    9. 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.
    10. Jose Blanchet & Guillermo Gallego & Vineet Goyal, 2016. "A Markov Chain Approximation to Choice Modeling," Operations Research, INFORMS, vol. 64(4), pages 886-905, August.
    11. Michael Yee & Ely Dahan & John R. Hauser & James Orlin, 2007. "Greedoid-Based Noncompensatory Inference," Marketing Science, INFORMS, vol. 26(4), pages 532-549, 07-08.
    12. 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.
    13. Paat Rusmevichientong & Huseyin Topaloglu, 2012. "Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model," Operations Research, INFORMS, vol. 60(4), pages 865-882, August.
    14. Vivek F. Farias & Srikanth Jagabathula & Devavrat Shah, 2013. "A Nonparametric Approach to Modeling Choice with Limited Data," Management Science, INFORMS, vol. 59(2), pages 305-322, December.
    15. Ivan Contreras & Jean-François Cordeau & Gilbert Laporte, 2011. "Benders Decomposition for Large-Scale Uncapacitated Hub Location," Operations Research, INFORMS, vol. 59(6), pages 1477-1490, December.
    16. Kyle D. Chen & Warren H. Hausman, 2000. "Technical Note: Mathematical Properties of the Optimal Product Line Selection Problem Using Choice-Based Conjoint Analysis," Management Science, INFORMS, vol. 46(2), pages 327-332, February.
    17. Miles Lubin & Iain Dunning, 2015. "Computing in Operations Research Using Julia," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 238-248, May.
    18. Kalyan Talluri & Garrett van Ryzin, 2004. "Revenue Management Under a General Discrete Choice Model of Consumer Behavior," Management Science, INFORMS, vol. 50(1), pages 15-33, January.
    19. James M. Davis & Guillermo Gallego & Huseyin Topaloglu, 2014. "Assortment Optimization Under Variants of the Nested Logit Model," Operations Research, INFORMS, vol. 62(2), pages 250-273, April.
    20. Rajeev Kohli & R. Sukumar, 1990. "Heuristics for Product-Line Design Using Conjoint Analysis," Management Science, INFORMS, vol. 36(12), pages 1464-1478, December.
    21. Garrett van Ryzin & Gustavo Vulcano, 2015. "A Market Discovery Algorithm to Estimate a General Class of Nonparametric Choice Models," Management Science, INFORMS, vol. 61(2), pages 281-300, February.
    22. A. M. Geoffrion & G. W. Graves, 1974. "Multicommodity Distribution System Design by Benders Decomposition," Management Science, INFORMS, vol. 20(5), pages 822-844, January.
    23. Kohli, Rajeev & Krishnamurti, Ramesh, 1989. "Optimal product design using conjoint analysis: Computational complexity and algorithms," European Journal of Operational Research, Elsevier, vol. 40(2), pages 186-195, May.
    24. Paul E. Green & Abba M. Krieger, 1985. "Models and Heuristics for Product Line Selection," Marketing Science, INFORMS, vol. 4(1), pages 1-19.
    25. Rajeev Kohli & Ramesh Krishnamurti, 1987. "A Heuristic Approach to Product Design," Management Science, INFORMS, vol. 33(12), pages 1523-1533, December.
    26. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
    27. Rajeev Kohli & Kamel Jedidi, 2015. "Error Theory for Elimination by Aspects," Operations Research, INFORMS, vol. 63(3), pages 512-526, June.
    28. 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.
    29. Richard D. McBride & Fred S. Zufryden, 1988. "An Integer Programming Approach to the Optimal Product Line Selection Problem," Marketing Science, INFORMS, vol. 7(2), pages 126-140.
    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. Xi Chen & Chao Shi & Yining Wang & Yuan Zhou, 2021. "Dynamic Assortment Planning Under Nested Logit Models," Production and Operations Management, Production and Operations Management Society, vol. 30(1), pages 85-102, January.
    2. Bechler, Georg & Steinhardt, Claudius & Mackert, Jochen & Klein, Robert, 2021. "Product line optimization in the presence of preferences for compromise alternatives," European Journal of Operational Research, Elsevier, vol. 288(3), pages 902-917.
    3. Yi-Chun Akchen & Dmitry Mitrofanov, 2023. "Consider or Choose? The Role and Power of Consideration Sets," Papers 2302.04354, arXiv.org, revised Jun 2024.
    4. Andrade, Xavier & Guimarães, Luís & Figueira, Gonçalo, 2021. "Product line selection of fast-moving consumer goods," Omega, Elsevier, vol. 102(C).
    5. Tulabandhula, Theja & Sinha, Deeksha & Karra, Saketh, 2022. "Optimizing revenue while showing relevant assortments at scale," European Journal of Operational Research, Elsevier, vol. 300(2), pages 561-570.
    6. Kris Johnson Ferreira & Joel Goh, 2021. "Assortment Rotation and the Value of Concealment," Management Science, INFORMS, vol. 67(3), pages 1489-1507, March.
    7. Chen, Yajing & Wu, Zhimin & Wang, Yunlong, 2024. "Omnichannel product selection and shelf space planning optimization," Omega, Elsevier, vol. 127(C).
    8. Domínguez, Concepción & Labbé, Martine & Marín, Alfredo, 2021. "The rank pricing problem with ties," European Journal of Operational Research, Elsevier, vol. 294(2), pages 492-506.

    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. 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.
    2. 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.
    3. Dimitris Bertsimas & Velibor V. Mišić, 2017. "Robust Product Line Design," Operations Research, INFORMS, vol. 65(1), pages 19-37, February.
    4. Dimitris Bertsimas & Velibor V. Mišić, 2017. "Robust Product Line Design," Operations Research, INFORMS, vol. 65(1), pages 19-37, February.
    5. Kameng Nip & Zhenbo Wang & Zizhuo Wang, 2021. "Assortment Optimization under a Single Transition Choice Model," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2122-2142, July.
    6. Hongmin Li & Scott Webster & Gwangjae Yu, 2020. "Product Design Under Multinomial Logit Choices: Optimization of Quality and Prices in an Evolving Product Line," Manufacturing & Service Operations Management, INFORMS, vol. 22(5), pages 1011-1025, September.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. Tan Wang & Genaro Gutierrez, 2022. "Robust Product Line Design by Protecting the Downside While Minding the Upside," Production and Operations Management, Production and Operations Management Society, vol. 31(1), pages 194-217, January.
    12. Ali Aouad & Retsef Levi & Danny Segev, 2019. "Approximation Algorithms for Dynamic Assortment Optimization Models," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 487-511, May.
    13. Xinfang (Jocelyn) Wang & Jeffrey D. Camm & David J. Curry, 2009. "A Branch-and-Price Approach to the Share-of-Choice Product Line Design Problem," Management Science, INFORMS, vol. 55(10), pages 1718-1728, October.
    14. Schön, Cornelia, 2010. "On the product line selection problem under attraction choice models of consumer behavior," European Journal of Operational Research, Elsevier, vol. 206(1), pages 260-264, October.
    15. Jacob Feldman & Alice Paul & Huseyin Topaloglu, 2019. "Technical Note—Assortment Optimization with Small Consideration Sets," Operations Research, INFORMS, vol. 67(5), pages 1283-1299, September.
    16. Alexandre Belloni & Robert Freund & Matthew Selove & Duncan Simester, 2008. "Optimizing Product Line Designs: Efficient Methods and Comparisons," Management Science, INFORMS, vol. 54(9), pages 1544-1552, September.
    17. Rajeev Kohli & Khaled Boughanmi & Vikram Kohli, 2019. "Randomized Algorithms for Lexicographic Inference," Operations Research, INFORMS, vol. 67(2), pages 357-375, March.
    18. Julia Heger & Robert Klein, 2024. "Assortment optimization: a systematic literature review," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(4), pages 1099-1161, December.
    19. Çö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).
    20. Mehrani, Saharnaz & Sefair, Jorge A., 2022. "Robust assortment optimization under sequential product unavailability," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1027-1043.

    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:oropre:v:67:y:2019:i:3:p:651-670. 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.