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

Total Unduplicated Reach and Frequency Optimization at Procter & Gamble

Author

Listed:
  • Jeffrey D. Camm

    (School of Business, Wake Forest University, Winston-Salem, North Carolina 27109)

  • Jeremy Christman

    (Oral Care Business Unit, The Procter & Gamble Company, Cincinnati, Ohio 45040)

  • A. Narayanan

    (Advanced Consumer Modeling & Statistics Department, The Procter & Gamble Company, Cincinnati, Ohio 45217; School of Business, University of Cincinnati, Cincinnati, Ohio 45221)

Abstract

The Procter & Gamble Company (P&G) is a consumer goods corporation that employs over 90,000 people and has operations in roughly 80 countries worldwide. Products in P&G’s 10-category portfolio of products are sold in over 180 countries. The Consumer Research Analytics group at P&G empowers internal clients by using analytics to ensure that the products in P&G’s portfolio of products are not just well received by consumers but become the products of choice for the maximum number of consumers, thereby maximizing P&G’s market share. One of the most frequently used analytical approaches for managing a product line is Total Unduplicated Reach and Frequency analysis. We replaced the previous enumerative approach with integer programming coupled with cuts to the unit hypercube to dramatically speed up the analysis. As a result, P&G achieved higher utilization of its system, improvements to existing products, and more thorough analyses for product line planning and other applications.

Suggested Citation

  • Jeffrey D. Camm & Jeremy Christman & A. Narayanan, 2022. "Total Unduplicated Reach and Frequency Optimization at Procter & Gamble," Interfaces, INFORMS, vol. 52(2), pages 149-157, March.
    • Handle: RePEc:inm:orinte:v:52:y:2022:i:2:p:149-157
    DOI: 10.1287/inte.2021.1096
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.2021.1096
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.2021.1096?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. Richard Church & Charles R. Velle, 1974. "The Maximal Covering Location Problem," Papers in Regional Science, Wiley Blackwell, vol. 32(1), pages 101-118, January.
    2. Jeffrey D. Camm, 2014. "ASP, The Art and Science of Practice: A (Very) Short Course in Suboptimization," Interfaces, INFORMS, vol. 44(4), pages 428-431, August.
    3. Brian T. Downs & Jeffrey D. Camm, 1996. "An exact algorithm for the maximal covering problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(3), pages 435-461, April.
    4. Tuomas Sandholm & David Levine & Michael Concordia & Paul Martyn & Rick Hughes & Jim Jacobs & Dennis Begg, 2006. "Changing the Game in Strategic Sourcing at Procter & Gamble: Expressive Competition Enabled by Optimization," Interfaces, INFORMS, vol. 36(1), pages 55-68, February.
    5. F. Robert Dwyer & James R. Evans, 1981. "A Branch and Bound Algorithm for the List Selection Problem in Direct Mail Advertising," Management Science, INFORMS, vol. 27(6), pages 658-667, June.
    6. Ingrid Farasyn & Salal Humair & Joel I. Kahn & John J. Neale & Oscar Rosen & John Ruark & William Tarlton & Wim Van de Velde & Glenn Wegryn & Sean P. Willems, 2011. "Inventory Optimization at Procter & Gamble: Achieving Real Benefits Through User Adoption of Inventory Tools," Interfaces, INFORMS, vol. 41(1), pages 66-78, February.
    Full references (including those not matched with items on IDEAS)

    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. Alan T. Murray, 2016. "Maximal Coverage Location Problem," International Regional Science Review, , vol. 39(1), pages 5-27, January.
    2. Chen, Liang & Chen, Sheng-Jie & Chen, Wei-Kun & Dai, Yu-Hong & Quan, Tao & Chen, Juan, 2023. "Efficient presolving methods for solving maximal covering and partial set covering location problems," European Journal of Operational Research, Elsevier, vol. 311(1), pages 73-87.
    3. James J. Cochran & Martin S. Levy & Jeffrey D. Camm, 2010. "Bayesian coverage optimization models," Journal of Combinatorial Optimization, Springer, vol. 19(2), pages 158-173, February.
    4. Brian T. Downs & Jeffrey D. Camm, 1996. "An exact algorithm for the maximal covering problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(3), pages 435-461, April.
    5. Galvao, Roberto D. & Gonzalo Acosta Espejo, Luis & Boffey, Brian, 2000. "A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem," European Journal of Operational Research, Elsevier, vol. 124(2), pages 377-389, July.
    6. Cordeau, Jean-François & Furini, Fabio & Ljubić, Ivana, 2019. "Benders decomposition for very large scale partial set covering and maximal covering location problems," European Journal of Operational Research, Elsevier, vol. 275(3), pages 882-896.
    7. He, Zhou & Fan, Bo & Cheng, T.C.E. & Wang, Shou-Yang & Tan, Chin-Hon, 2016. "A mean-shift algorithm for large-scale planar maximal covering location problems," European Journal of Operational Research, Elsevier, vol. 250(1), pages 65-76.
    8. Mahmutoğulları, Özlem & Yaman, Hande, 2023. "Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty," European Journal of Operational Research, Elsevier, vol. 306(1), pages 173-188.
    9. Tammy Drezner & Zvi Drezner, 2019. "Cooperative Cover of Uniform Demand," Networks and Spatial Economics, Springer, vol. 19(3), pages 819-831, September.
    10. Dries R. Goossens & Sander Onderstal & Jan Pijnacker & Frits C. R. Spieksma, 2014. "Solids: A Combinatorial Auction for Real Estate," Interfaces, INFORMS, vol. 44(4), pages 351-363, August.
    11. Shaw, Lipika & Das, Soumen Kumar & Roy, Sankar Kumar, 2022. "Location-allocation problem for resource distribution under uncertainty in disaster relief operations," Socio-Economic Planning Sciences, Elsevier, vol. 82(PA).
    12. Muñoz, Juan Carlos & Molina, Diego, 2009. "A multi-unit tender award process: The case of Transantiago," European Journal of Operational Research, Elsevier, vol. 197(1), pages 307-311, August.
    13. Huizhu Wang & Jianqin Zhou, 2023. "Location of Railway Emergency Rescue Spots Based on a Near-Full Covering Problem: From a Perspective of Diverse Scenarios," Sustainability, MDPI, vol. 15(8), pages 1-16, April.
    14. Eliş, Haluk & Tansel, Barbaros & Oğuz, Osman & Güney, Mesut & Kian, Ramez, 2021. "On guarding real terrains: The terrain guarding and the blocking path problems," Omega, Elsevier, vol. 102(C).
    15. Jeffrey D. Camm & Susan K. Norman & Stephen Polasky & Andrew R. Solow, 2002. "Nature Reserve Site Selection to Maximize Expected Species Covered," Operations Research, INFORMS, vol. 50(6), pages 946-955, December.
    16. Daoqin Tong & Alan T. Murray, 2009. "Maximising coverage of spatial demand for service," Papers in Regional Science, Wiley Blackwell, vol. 88(1), pages 85-97, March.
    17. Fernando Bernstein & Yang Li & Kevin Shang, 2016. "A Simple Heuristic for Joint Inventory and Pricing Models with Lead Time and Backorders," Management Science, INFORMS, vol. 62(8), pages 2358-2373, August.
    18. Zhang, Ying & Snyder, Lawrence V. & Ralphs, Ted K. & Xue, Zhaojie, 2016. "The competitive facility location problem under disruption risks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 453-473.
    19. Bertsimas, Dimitris & Ng, Yeesian, 2019. "Robust and stochastic formulations for ambulance deployment and dispatch," European Journal of Operational Research, Elsevier, vol. 279(2), pages 557-571.
    20. Sang Won Kim & Marcelo Olivares & Gabriel Y. Weintraub, 2014. "Measuring the Performance of Large-Scale Combinatorial Auctions: A Structural Estimation Approach," Management Science, INFORMS, vol. 60(5), pages 1180-1201, May.

    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:52:y:2022:i:2:p:149-157. 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.