IDEAS home Printed from https://ideas.repec.org/a/bla/popmgt/v31y2022i1p194-217.html
   My bibliography  Save this article

Robust Product Line Design by Protecting the Downside While Minding the Upside

Author

Listed:
  • Tan Wang
  • Genaro Gutierrez

Abstract

Many decisions must be made before relevant uncertainties are revealed; hence robustness approaches to decision making are often considered. There are two major approaches to robustness in the literature: (i) maximizing the value of the worst outcome and (ii) minimizing the maximum ex post regret of the decision. While the first approach seeks the best worst‐case outcome, it may result in substantial opportunity losses relative to the ex post optimal decision; this is particularly critical in new product design decisions as it leaves the leading firm exposed to a late entrant who designs its products after uncertainties are resolved. The second approach seeks to minimize these ex post opportunity losses, but it may expose the decision maker to greater downside risk, that is, lower outcome in the worst case. Most studies have examined one of these approaches in isolation; in contrast, in this study, we explore the trade‐offs between protecting upside regret and downside risk with a focus on a product line design (PLD) problem, which relies greatly on conjoint analysis data. The PLD problem may suffer from significant uncertainty in the partworth utilities which define the attribute‐level consumer preferences on a product for different population segments. Our numerical experiments, based on a real conjoint data set, show that neither robustness approaches dominates the other and hence our proposed approach uses both. We construct a Min‐Value vs. Max‐Relative‐Regret efficient frontier to narrow down the PLD choice and propose a metric to quantify the trade‐offs and finalize the selection.

Suggested Citation

  • 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.
  • Handle: RePEc:bla:popmgt:v:31:y:2022:i:1:p:194-217
    DOI: 10.1111/poms.13495
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/poms.13495
    Download Restriction: no

    File URL: https://libkey.io/10.1111/poms.13495?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. Suresh K. Nair & Lakshman S. Thakur & Kuang-Wei Wen, 1995. "Near Optimal Solutions for Product Line Design and Selection: Beam Search Heuristics," Management Science, INFORMS, vol. 41(5), pages 767-785, May.
    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. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    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. Junfeng Tian & Jinfeng Yue, 2014. "Bounds of Relative Regret Limit in p-Robust Supply Chain Network Design," Production and Operations Management, Production and Operations Management Society, vol. 23(10), pages 1811-1831, October.
    7. 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.
    8. Leyuan Shi & Sigurdur Ólafsson & Qun Chen, 2001. "An Optimization Framework for Product Design," Management Science, INFORMS, vol. 47(12), pages 1681-1692, December.
    9. Robert L. Smith, 1984. "Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions," Operations Research, INFORMS, vol. 32(6), pages 1296-1308, December.
    10. Dimitris Bertsimas & Velibor V. Mišić, 2017. "Robust Product Line Design," Operations Research, INFORMS, vol. 65(1), pages 19-37, February.
    11. P. V. (Sundar) Balakrishnan & Varghese S. Jacob, 1996. "Genetic Algorithms for Product Design," Management Science, INFORMS, vol. 42(8), pages 1105-1117, August.
    12. 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.
    13. Rajeev Kohli & R. Sukumar, 1990. "Heuristics for Product-Line Design Using Conjoint Analysis," Management Science, INFORMS, vol. 36(12), pages 1464-1478, December.
    14. 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.
    15. Yen-Ting Lin & Haoying Sun & Shouqiang Wang, 2020. "Designing Sustainable Products Under Coproduction Technology," Manufacturing & Service Operations Management, INFORMS, vol. 22(6), pages 1181-1198, November.
    16. Paul E. Green & Abba M. Krieger, 1985. "Models and Heuristics for Product Line Selection," Marketing Science, INFORMS, vol. 4(1), pages 1-19.
    17. Aissi, Hassene & Bazgan, Cristina & Vanderpooten, Daniel, 2009. "Min-max and min-max regret versions of combinatorial optimization problems: A survey," European Journal of Operational Research, Elsevier, vol. 197(2), pages 427-438, September.
    18. Veblen, Thorstein, 2009. "The Theory of the Leisure Class," OUP Catalogue, Oxford University Press, number 9780199552580 edited by Banta, Martha, Decembrie.
    19. Jeffrey D. Camm & James J. Cochran & David J. Curry & Sriram Kannan, 2006. "Conjoint Optimization: An Exact Branch-and-Bound Algorithm for the Share-of-Choice Problem," Management Science, INFORMS, vol. 52(3), pages 435-447, March.
    20. Dimitris Bertsimas & Allison O'Hair, 2013. "Learning Preferences Under Noise and Loss Aversion: An Optimization Approach," Operations Research, INFORMS, vol. 61(5), pages 1190-1199, October.
    21. Gregory Dobson & Shlomo Kalish, 1993. "Heuristics for Pricing and Positioning a Product-Line Using Conjoint and Cost Data," Management Science, INFORMS, vol. 39(2), pages 160-175, February.
    22. Tao Lu & Ying‐Ju Chen & Brian Tomlin & Yimin Wang, 2019. "Selling Co‐Products through a Distributor: The Impact on Product Line Design," Production and Operations Management, Production and Operations Management Society, vol. 28(4), pages 1010-1032, April.
    23. 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.
    24. Lian Qi & Leon Yang Chu & Rachel R. Chen, 2016. "Quality Provision with Heterogeneous Consumer Reservation Utilities," Production and Operations Management, Production and Operations Management Society, vol. 25(5), pages 883-901, May.
    25. Dimitris Bertsimas & Velibor V. Mišić, 2017. "Robust Product Line Design," Operations Research, INFORMS, vol. 65(1), pages 19-37, February.
    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. Maoqi Liu & Li Zheng & Changchun Liu & Zhi‐Hai Zhang, 2023. "From share of choice to buyers' welfare maximization: Bridging the gap through distributionally robust optimization," Production and Operations Management, Production and Operations Management Society, vol. 32(4), pages 1205-1222, April.
    2. Hezarkhani, Behzad & Demirel, Guven & Bouchery, Yann & Dora, Manoj, 2023. "Can “ugly veg” supply chains reduce food loss?," European Journal of Operational Research, Elsevier, vol. 309(1), pages 117-132.

    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. 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.
    2. Maoqi Liu & Li Zheng & Changchun Liu & Zhi‐Hai Zhang, 2023. "From share of choice to buyers' welfare maximization: Bridging the gap through distributionally robust optimization," Production and Operations Management, Production and Operations Management Society, vol. 32(4), pages 1205-1222, April.
    3. 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.
    4. Dimitris Bertsimas & Velibor V. Mišić, 2017. "Robust Product Line Design," Operations Research, INFORMS, vol. 65(1), pages 19-37, February.
    5. Dimitris Bertsimas & Velibor V. Mišić, 2017. "Robust Product Line Design," Operations Research, INFORMS, vol. 65(1), pages 19-37, February.
    6. Dimitris Bertsimas & Velibor V. Mišić, 2019. "Exact First-Choice Product Line Optimization," Operations Research, INFORMS, vol. 67(3), pages 651-670, May.
    7. Pantourakis, Michail & Tsafarakis, Stelios & Zervoudakis, Konstantinos & Altsitsiadis, Efthymios & Andronikidis, Andreas & Ntamadaki, Vasiliki, 2022. "Clonal selection algorithms for optimal product line design: A comparative study," European Journal of Operational Research, Elsevier, vol. 298(2), pages 585-595.
    8. 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.
    9. Wang, Xinfang (Jocelyn) & Curry, David J., 2012. "A robust approach to the share-of-choice product design problem," Omega, Elsevier, vol. 40(6), pages 818-826.
    10. Winfried Steiner & Harald Hruschka, 2002. "A Probabilistic One-Step Approach to the Optimal Product Line Design Problem Using Conjoint and Cost Data," Review of Marketing Science Working Papers 1-4-1003, Berkeley Electronic Press.
    11. G. E. Fruchter & A. Fligler & R. S. Winer, 2006. "Optimal Product Line Design: Genetic Algorithm Approach to Mitigate Cannibalization," Journal of Optimization Theory and Applications, Springer, vol. 131(2), pages 227-244, November.
    12. 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.
    13. Winfried J. Steiner & Harald Hruschka, 2002. "Produktliniengestaltung mit Genetischen Algorithmen," Schmalenbach Journal of Business Research, Springer, vol. 54(7), pages 575-601, November.
    14. Michalek, Jeremy J. & Ebbes, Peter & Adigüzel, Feray & Feinberg, Fred M. & Papalambros, Panos Y., 2011. "Enhancing marketing with engineering: Optimal product line design for heterogeneous markets," International Journal of Research in Marketing, Elsevier, vol. 28(1), pages 1-12.
    15. Tsafarakis, Stelios & Zervoudakis, Konstantinos & Andronikidis, Andreas & Altsitsiadis, Efthymios, 2020. "Fuzzy self-tuning differential evolution for optimal product line design," European Journal of Operational Research, Elsevier, vol. 287(3), pages 1161-1169.
    16. Cornelia Schön, 2010. "On the Optimal Product Line Selection Problem with Price Discrimination," Management Science, INFORMS, vol. 56(5), pages 896-902, May.
    17. Albritton, M. David & McMullen, Patrick R., 2007. "Optimal product design using a colony of virtual ants," European Journal of Operational Research, Elsevier, vol. 176(1), pages 498-520, January.
    18. 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.
    19. Day, Jamison M. & Venkataramanan, M.A., 2006. "Profitability in product line pricing and composition with manufacturing commonalities," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1782-1797, December.
    20. Jeffrey D. Camm & James J. Cochran & David J. Curry & Sriram Kannan, 2006. "Conjoint Optimization: An Exact Branch-and-Bound Algorithm for the Share-of-Choice Problem," Management Science, INFORMS, vol. 52(3), pages 435-447, March.

    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:bla:popmgt:v:31:y:2022:i:1:p:194-217. 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: Wiley Content Delivery (email available below). General contact details of provider: http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1937-5956 .

    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.