IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v40y2010i1p17-32.html
   My bibliography  Save this article

HP Transforms Product Portfolio Management with Operations Research

Author

Listed:
  • Julie Ward

    (Hewlett-Packard Labs, Palo Alto, fCalifornia 94304)

  • Bin Zhang

    (Hewlett-Packard Labs, Palo Alto, fCalifornia 94304)

  • Shailendra Jain

    (Hewlett-Packard Labs, Palo Alto, fCalifornia 94304)

  • Chris Fry

    (Strategic Management Solutions, Redwood Shores, California 94065)

  • Thomas Olavson

    (Hewlett-Packard SPaM, Palo Alto, California 94304)

  • Holger Mishal

    (Hewlett-Packard Personal Systems Group, Cupertino, California 95014)

  • Jason Amaral

    (Emeraldwise LLC, Woodside, California 94062)

  • Dirk Beyer

    (M-Factor, Inc., San Mateo, California 94404)

  • Ann Brecht

    (Hewlett-Packard Technology Solutions Group, Fort Collins, Colorado 80528)

  • Brian Cargille

    (Hewlett-Packard SPaM, Palo Alto, California 94304)

  • Russ Chadinha

    (Hewlett-Packard Personal Systems Group, Houston, Texas 77070)

  • Kathy Chou

    (Hewlett-Packard Personal Systems Group, Cupertino, California 95014)

  • Gavin DeNyse

    (Hewlett-Packard SPaM, Portland, Oregon 97221)

  • Qi Feng

    (McCombs School of Business, University of Texas at Austin, Austin, Texas 78712)

  • Cookie Padovani

    (Hewlett-Packard Technology Solutions Group, Roseville, California 95747)

  • Sesh Raj

    (DSApps, Inc., Sunnyvale, California 94087)

  • Kurt Sunderbruch

    (Hewlett-Packard Technology Solutions Group, Roseville, California 95747)

  • Robert Tarjan

    (Hewlett-Packard Labs, Palo Alto, California 94304, and Department of Computer Science, Princeton University, Princeton, New Jersey 08540)

  • Krishna Venkatraman

    (Intuit, Mountain View, California 94043)

  • Joseph Woods

    (Hewlett-Packard Technology Solutions Group, Roseville, California 95747)

  • Jing Zhou

    (Belk College of Business, University of North Carolina at Charlotte, Charlotte, North Carolina 28223)

Abstract

Hewlett-Packard (HP) offers many innovative products to meet diverse customer needs. The breadth of its product offering has helped the company achieve unparalleled market reach; however, it has come with significant costs and challenges. By offering multiple similar products, a manufacturer increases its overall demand volatility, reduces forecast accuracy, and can adversely affect revenue and costs across the entire product life cycle. At HP, these impacts included increases in inventory-driven costs and order-cycle time; liabilities to channel partners; and costs of operations, research and development, marketing, and administration. Furthermore, complexity in HP's product lines confused customers, sales representatives, and channel partners, sometimes driving business to competitors. HP developed two powerful operations research-based solutions for managing product variety. The first, a framework for screening new products, uses custom-built return-on-investment (ROI) calculators to evaluate each proposed new product before introduction; those that do not meet a threshold ROI level are targeted for exclusion from the proposed lineup. The second, HP's Revenue Coverage Optimization (RCO) tool, which is based on a fast, new maximum-flow algorithm, is used to manage product variety after introduction. By identifying a core portfolio of products that are important to order coverage, RCO enables HP businesses to increase operational focus on their most critical products. These tools have enabled HP to increase its profits across business units by more than $500 million since 2005. Moreover, HP has streamlined its product offerings, improved execution, achieved faster delivery, lowered overhead, and increased customer satisfaction and market share.

Suggested Citation

  • Julie Ward & Bin Zhang & Shailendra Jain & Chris Fry & Thomas Olavson & Holger Mishal & Jason Amaral & Dirk Beyer & Ann Brecht & Brian Cargille & Russ Chadinha & Kathy Chou & Gavin DeNyse & Qi Feng & , 2010. "HP Transforms Product Portfolio Management with Operations Research," Interfaces, INFORMS, vol. 40(1), pages 17-32, February.
  • Handle: RePEc:inm:orinte:v:40:y:2010:i:1:p:17-32
    DOI: 10.1287/inte.1090.0476
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.1090.0476
    Download Restriction: no

    File URL: https://libkey.io/10.1287/inte.1090.0476?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. J. M. W. Rhys, 1970. "A Selection Problem of Shared Fixed Costs and Network Flows," Management Science, INFORMS, vol. 17(3), pages 200-207, November.
    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. Haijian Si & Stylianos Kavadias & Christoph Loch, 2022. "Managing innovation portfolios: From project selection to portfolio design," Production and Operations Management, Production and Operations Management Society, vol. 31(12), pages 4572-4588, December.
    2. Souza, Gilvan C., 2014. "Supply chain analytics," Business Horizons, Elsevier, vol. 57(5), pages 595-605.
    3. Saurabh Bansal & Yaroslav Rosokha, 2018. "Impact of Compound and Reduced Specification on Valuation of Projects with Multiple Risks," Decision Analysis, INFORMS, vol. 15(1), pages 27-46, March.
    4. Arto Tolonen & Hanna Kropsu-Vehkapera & Harri Haapasalo, 2013. "Product Portfolio Management: Current Challenges and Preconditions," Diversity, Technology, and Innovation for Operational Competitiveness: Proceedings of the 2013 International Conference on Technology Innovation and Industrial Management,, ToKnowPress.
    5. Patxi J. Bernales & Yongtao Guan & Harihara Prasad Natarajan & Patricia Souza Gimenez & Mario Xavier Alvarez Tajes, 2017. "Less Is More: Harnessing Product Substitution Information to Rationalize SKUs at Intcomex," Interfaces, INFORMS, vol. 47(3), pages 230-243, June.
    6. Vidya Mani & Douglas J. Thomas & Saurabh Bansal, 2022. "Estimating Substitution and Basket Effects in Retail Stores: Implications for Assortment Planning," Management Science, INFORMS, vol. 68(7), pages 5002-5024, July.

    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. Rolf H. Möhring & Andreas S. Schulz & Frederik Stork & Marc Uetz, 2003. "Solving Project Scheduling Problems by Minimum Cut Computations," Management Science, INFORMS, vol. 49(3), pages 330-350, March.
    2. Warren P. Adams & Julie Bowers Lassiter & Hanif D. Sherali, 1998. "Persistency in 0-1 Polynomial Programming," Mathematics of Operations Research, INFORMS, vol. 23(2), pages 359-389, May.
    3. Dorit S. Hochbaum & Anna Chen, 2000. "Performance Analysis and Best Implementations of Old and New Algorithms for the Open-Pit Mining Problem," Operations Research, INFORMS, vol. 48(6), pages 894-914, December.
    4. Arbib, Claudio & Servilio, Mara & Archetti, Claudia & Speranza, M. Grazia, 2014. "The directed profitable location Rural Postman Problem," European Journal of Operational Research, Elsevier, vol. 236(3), pages 811-819.
    5. Gary Kochenberger & Jin-Kao Hao & Fred Glover & Mark Lewis & Zhipeng Lü & Haibo Wang & Yang Wang, 2014. "The unconstrained binary quadratic programming problem: a survey," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 58-81, July.
    6. Ali Koç & David P. Morton, 2015. "Prioritization via Stochastic Optimization," Management Science, INFORMS, vol. 61(3), pages 586-603, March.
    7. Hezhi Luo & Xiaodi Bai & Jiming Peng, 2019. "Enhancing Semidefinite Relaxation for Quadratically Constrained Quadratic Programming via Penalty Methods," Journal of Optimization Theory and Applications, Springer, vol. 180(3), pages 964-992, March.
    8. Chunli Liu & Jianjun Gao, 2015. "A polynomial case of convex integer quadratic programming problems with box integer constraints," Journal of Global Optimization, Springer, vol. 62(4), pages 661-674, August.
    9. Jesus Cunha & Luidi Simonetti & Abilio Lucena, 2016. "Lagrangian heuristics for the Quadratic Knapsack Problem," Computational Optimization and Applications, Springer, vol. 63(1), pages 97-120, January.
    10. Renato de Matta & Vernon Ning Hsu & Timothy J. Lowe, 1999. "Capacitated selection problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(1), pages 19-37, February.
    11. W. David Pisinger & Anders Bo Rasmussen & Rune Sandvik, 2007. "Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction," INFORMS Journal on Computing, INFORMS, vol. 19(2), pages 280-290, May.
    12. Gabriel Lopez Zenarosa & Oleg A. Prokopyev & Eduardo L. Pasiliao, 2021. "On exact solution approaches for bilevel quadratic 0–1 knapsack problem," Annals of Operations Research, Springer, vol. 298(1), pages 555-572, March.
    13. José R. Correa & Andreas S. Schulz, 2005. "Single-Machine Scheduling with Precedence Constraints," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 1005-1021, November.
    14. Olszewski, Wojciech & Vohra, Rakesh, 2014. "Selecting a discrete portfolio," Journal of Mathematical Economics, Elsevier, vol. 55(C), pages 69-73.
    15. Alberto Caprara & David Pisinger & Paolo Toth, 1999. "Exact Solution of the Quadratic Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 125-137, May.
    16. Britta Schulze & Michael Stiglmayr & Luís Paquete & Carlos M. Fonseca & David Willems & Stefan Ruzika, 2020. "On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(1), pages 107-132, August.
    17. Sourour Elloumi & Amélie Lambert & Arnaud Lazare, 2021. "Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation," Journal of Global Optimization, Springer, vol. 80(2), pages 231-248, June.
    18. Dorit S. Hochbaum, 2004. "50th Anniversary Article: Selection, Provisioning, Shared Fixed Costs, Maximum Closure, and Implications on Algorithmic Methods Today," Management Science, INFORMS, vol. 50(6), pages 709-723, June.
    19. Queyranne, M. & Wolsey, L.A., 2015. "Modeling poset convex subsets," LIDAM Discussion Papers CORE 2015049, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    20. Z. Y. Wu & Y. J. Yang & F. S. Bai & M. Mammadov, 2011. "Global Optimality Conditions and Optimization Methods for Quadratic Knapsack Problems," Journal of Optimization Theory and Applications, Springer, vol. 151(2), pages 241-259, November.

    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:orinte:v:40:y:2010:i:1:p:17-32. 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.