IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v60y2013i5p395-412.html
   My bibliography  Save this article

A three‐stage procurement optimization problem under uncertainty

Author

Listed:
  • Mike Prince
  • J. Cole Smith
  • Joseph Geunes

Abstract

This article examines a problem faced by a firm procuring a material input or good from a set of suppliers. The cost to procure the material from any given supplier is concave in the amount ordered from the supplier, up to a supplier‐specific capacity limit. This NP‐hard problem is further complicated by the observation that capacities are often uncertain in practice, due for instance to production shortages at the suppliers, or competition from other firms. We accommodate this uncertainty in a worst‐case (robust) fashion by modeling an adversarial entity (which we call the “follower”) with a limited procurement budget. The follower reduces supplier capacity to maximize the minimum cost required for our firm to procure its required goods. To guard against uncertainty, the firm can “protect” any supplier at a cost (e.g., by signing a contract with the supplier that guarantees supply availability, or investing in machine upgrades that guarantee the supplier's ability to produce goods at a desired level), ensuring that the anticipated capacity of that supplier will indeed be available. The problem we consider is thus a three‐stage game in which the firm first chooses which suppliers' capacities to protect, the follower acts next to reduce capacity from unprotected suppliers, and the firm then satisfies its demand using the remaining capacity. We formulate a three‐stage mixed‐integer program that is well‐suited to decomposition techniques and develop an effective cutting‐plane algorithm for its solution. The corresponding algorithmic approach solves a sequence of scaled and relaxed problem instances, which enables solving problems having much larger data values when compared to standard techniques. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013

Suggested Citation

  • Mike Prince & J. Cole Smith & Joseph Geunes, 2013. "A three‐stage procurement optimization problem under uncertainty," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(5), pages 395-412, August.
  • Handle: RePEc:wly:navres:v:60:y:2013:i:5:p:395-412
    DOI: 10.1002/nav.21541
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21541
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nav.21541?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. Narendra Agrawal & Steven Nahmias, 1997. "Rationalization Of The Supplier Base In The Presence Of Yield Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 6(3), pages 291-308, September.
    2. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    3. Robert J. Dolan, 1987. "Quantity Discounts: Managerial Issues and Research Opportunities," Marketing Science, INFORMS, vol. 6(1), pages 1-22.
    4. Paola Cappanera & Maria Paola Scaparra, 2011. "Optimal Allocation of Protective Resources in Shortest-Path Networks," Transportation Science, INFORMS, vol. 45(1), pages 64-80, February.
    5. J. Cole Smith & Churlzu Lim & Aydın Alptekinoğlu, 2009. "New product introduction against a predator: A bilevel mixed‐integer programming approach," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(8), pages 714-729, December.
    6. J. Cole Smith & Churlzu Lim, 2008. "Algorithms for Network Interdiction and Fortification Games," Springer Optimization and Its Applications, in: Altannar Chinchuluun & Panos M. Pardalos & Athanasios Migdalas & Leonidas Pitsoulis (ed.), Pareto Optimality, Game Theory And Equilibria, pages 609-644, Springer.
    7. Fernando Bernstein & Awi Federgruen, 2003. "Pricing and Replenishment Strategies in a Distribution System with Competing Retailers," Operations Research, INFORMS, vol. 51(3), pages 409-426, June.
    8. Pittman, Russell W., 1984. "Predatory investment U.S. vs. IBM," International Journal of Industrial Organization, Elsevier, vol. 2(4), pages 341-365, December.
    9. Minner, Stefan, 2003. "Multiple-supplier inventory models in supply chain management: A review," International Journal of Production Economics, Elsevier, vol. 81(1), pages 265-279, January.
    10. Z. Kevin Weng, 1995. "Channel Coordination and Quantity Discounts," Management Science, INFORMS, vol. 41(9), pages 1509-1522, September.
    11. Charles A. Ingene & Mark E. Parry, 1995. "Channel Coordination When Retailers Compete," Marketing Science, INFORMS, vol. 14(4), pages 360-377.
    12. ,, 2000. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 16(2), pages 287-299, April.
    13. Chauhan, Satyaveer Singh & Proth, Jean-Marie, 2003. "The concave cost supply problem," European Journal of Operational Research, Elsevier, vol. 148(2), pages 374-383, July.
    14. A. L. Soyster, 1973. "Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming," Operations Research, INFORMS, vol. 21(5), pages 1154-1157, October.
    15. Gerald Brown & Matthew Carlyle & Javier Salmerón & Kevin Wood, 2006. "Defending Critical Infrastructure," Interfaces, INFORMS, vol. 36(6), pages 530-544, December.
    16. Ruiz-Torres, Alex J. & Mahmoodi, Farzad, 2007. "The optimal number of suppliers considering the costs of individual supplier failures," Omega, Elsevier, vol. 35(1), pages 104-115, February.
    17. Burke, Gerard J. & Carrillo, Janice & Vakharia, Asoo J., 2008. "Heuristics for sourcing from multiple suppliers with alternative quantity discounts," European Journal of Operational Research, Elsevier, vol. 186(1), pages 317-329, April.
    18. Berger, Paul D. & Gerstenfeld, Arthur & Zeng, Amy Z., 2004. "How many suppliers are best? A decision-analysis approach," Omega, Elsevier, vol. 32(1), pages 9-15, February.
    19. M. Florian & J. K. Lenstra & A. H. G. Rinnooy Kan, 1980. "Deterministic Production Planning: Algorithms and Complexity," Management Science, INFORMS, vol. 26(7), pages 669-679, July.
    20. repec:inm:ormnsc:v:30:y:1984:i:12:p:1524-1539(2 is not listed on IDEAS
    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. Juan S. Borrero & Leonardo Lozano, 2021. "Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1570-1589, October.
    2. Leonardo Lozano & J. Cole Smith, 2017. "A Backward Sampling Framework for Interdiction Problems with Fortification," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 123-139, February.

    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. Pritee Ray & Mamata Jenamani, 2016. "Sourcing decision under disruption risk with supply and demand uncertainty: A newsvendor approach," Annals of Operations Research, Springer, vol. 237(1), pages 237-262, February.
    2. Meena, P.L. & Sarmah, S.P., 2013. "Multiple sourcing under supplier failure risk and quantity discount: A genetic algorithm approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 84-97.
    3. Pritee Ray & Mamata Jenamani, 2016. "Sourcing decision under disruption risk with supply and demand uncertainty: A newsvendor approach," Annals of Operations Research, Springer, vol. 237(1), pages 237-262, February.
    4. Leonardo Lozano & J. Cole Smith, 2017. "A Backward Sampling Framework for Interdiction Problems with Fortification," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 123-139, February.
    5. Song, Dong-Ping & Dong, Jing-Xin & Xu, Jingjing, 2014. "Integrated inventory management and supplier base reduction in a supply chain with multiple uncertainties," European Journal of Operational Research, Elsevier, vol. 232(3), pages 522-536.
    6. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    7. Stefan Mišković, 2017. "A VNS-LP algorithm for the robust dynamic maximal covering location problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 1011-1033, October.
    8. Antonio G. Martín & Manuel Díaz-Madroñero & Josefa Mula, 2020. "Master production schedule using robust optimization approaches in an automobile second-tier supplier," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 143-166, March.
    9. Faiza Hamdi & Ahmed Ghorbel & Faouzi Masmoudi & Lionel Dupont, 2018. "Optimization of a supply portfolio in the context of supply chain risk management: literature review," Journal of Intelligent Manufacturing, Springer, vol. 29(4), pages 763-788, April.
    10. Roberto Gomes de Mattos & Fabricio Oliveira & Adriana Leiras & Abdon Baptista de Paula Filho & Paulo Gonçalves, 2019. "Robust optimization of the insecticide-treated bed nets procurement and distribution planning under uncertainty for malaria prevention and control," Annals of Operations Research, Springer, vol. 283(1), pages 1045-1078, December.
    11. Noah Lim & Teck-Hua Ho, 2007. "Designing Price Contracts for Boundedly Rational Customers: Does the Number of Blocks Matter?," Marketing Science, INFORMS, vol. 26(3), pages 312-326, 05-06.
    12. Ali Ekici & Baṣak Altan & Okan Örsan Özener, 2016. "Pricing decisions in a strategic single retailer/dual suppliers setting under order size constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 54(7), pages 1887-1898, April.
    13. Claire Nicolas & Stéphane Tchung-Ming & Emmanuel Hache, 2016. "Energy transition in transportation under cost uncertainty, an assessment based on robust optimization," Working Papers hal-02475943, HAL.
    14. Krumke, Sven O. & Schmidt, Eva & Streicher, Manuel, 2019. "Robust multicovers with budgeted uncertainty," European Journal of Operational Research, Elsevier, vol. 274(3), pages 845-857.
    15. Ghazaleh Ahmadi & Reza Tavakkoli-Moghaddam & Armand Baboli & Mehdi Najafi, 2022. "A decision support model for robust allocation and routing of search and rescue resources after earthquake: a case study," Operational Research, Springer, vol. 22(2), pages 1039-1081, April.
    16. Nam, Seong-Hyun & Vitton, John & Kurata, Hisashi, 2011. "Robust supply base management: Determining the optimal number of suppliers utilized by contractors," International Journal of Production Economics, Elsevier, vol. 134(2), pages 333-343, December.
    17. Heydari, Mohammadhossein & Sullivan, Kelly M., 2019. "Robust allocation of testing resources in reliability growth," Reliability Engineering and System Safety, Elsevier, vol. 192(C).
    18. Leitner, Markus & Ljubić, Ivana & Monaci, Michele & Sinnl, Markus & Tanınmış, Kübra, 2023. "An exact method for binary fortification games," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1026-1039.
    19. Alan L. Erera & Juan C. Morales & Martin Savelsbergh, 2009. "Robust Optimization for Empty Repositioning Problems," Operations Research, INFORMS, vol. 57(2), pages 468-483, April.
    20. Oğuz Solyalı & Jean-François Cordeau & Gilbert Laporte, 2012. "Robust Inventory Routing Under Demand Uncertainty," Transportation Science, INFORMS, vol. 46(3), pages 327-340, August.

    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:wly:navres:v:60:y:2013:i:5:p:395-412. 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: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.