IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-3-031-57927-1_9.html
   My bibliography  Save this book chapter

Supply Chain Cybersecurity: Direct and Indirect Cyber Risks

In: Stochastic Programming in Supply Chain Risk Management

Author

Listed:
  • Tadeusz Sawik

    (University of Kraków
    Reykjavik University
    Indian Institute of Management)

Abstract

In this chapter, a stochastic MIP (mixed integer programming) model is presented for optimization of cybersecurity investment and selection of security controls to mitigate the impact of direct and indirect (propagated) cyber risks in a supply chain. Using a recursive network transformation to compute the reduced vulnerabilities of secured supply chain nodes and the first-order Taylor series approximation of natural logarithm to linearize the nonlinear constraints, a nonlinear stochastic combinatorial optimization model is approximated by its linear equivalent. The problem objective is to determine an optimal cybersecurity investment under limited budget and portfolio of security controls for each node to balance the cybersecurity across the entire supply chain. The minmax objective functions are applied to minimize either the maximum breach probability or the maximum loss of supply chain nodes. Alternatively, maxmin objectives are used to maximize the minimum non-breach probability or the minimum savings of loss. The proposed solution approach is illustrated with results of computational study, and a comparison of approximated and exact solution values is presented. The decision-making insights are provided at the end of this chapter.

Suggested Citation

  • Tadeusz Sawik, 2024. "Supply Chain Cybersecurity: Direct and Indirect Cyber Risks," International Series in Operations Research & Management Science, in: Stochastic Programming in Supply Chain Risk Management, chapter 0, pages 293-322, Springer.
    • Handle: RePEc:spr:isochp:978-3-031-57927-1_9
    DOI: 10.1007/978-3-031-57927-1_9
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:isochp:978-3-031-57927-1_9. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.