IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v60y2022i2p766-782.html
   My bibliography  Save this article

Balancing cybersecurity in a supply chain under direct and indirect cyber risks

Author

Listed:
  • Tadeusz Sawik

Abstract

Cybersecurity is an essential requirement for the sustainability of global supply chains. In this paper, a stochastic programming formulation is presented for optimisation of cybersecurity investment and selection of security controls to mitigate and balance the impact of direct and indirect (propagated) cyber risks in a multi-tier supply chain. Using a network transformation combined with the first-order Taylor series approximation of natural logarithm to linearise the nonlinear constraints, a nonlinear stochastic combinatorial optimisation 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 supply chain node to balance the cybersecurity over the entire supply chain. The minmax objective functions are applied to minimise either the maximum breach probability or the maximum loss of supply chain nodes. Alternatively, maxmin objectives are used to maximise either the minimum non-breach probability or the minimum saving of loss. The proposed integrated modelling 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 and discussed.

Suggested Citation

  • Tadeusz Sawik, 2022. "Balancing cybersecurity in a supply chain under direct and indirect cyber risks," International Journal of Production Research, Taylor & Francis Journals, vol. 60(2), pages 766-782, January.
  • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:2:p:766-782
    DOI: 10.1080/00207543.2021.1914356
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2021.1914356
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2021.1914356?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Tingting Zou & Changyu Wang, 2022. "Adaptive Relative Reflection Harris Hawks Optimization for Global Optimization," Mathematics, MDPI, vol. 10(7), pages 1-19, April.

    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:taf:tprsxx:v:60:y:2022:i:2:p:766-782. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.