Planning a Defense That Minimizes a Resource Deficit in the Worst-Case Scenario of Supply Network Destruction

Research output: Contribution to journalArticlepeer-review

Abstract

We consider same model of planning the defense of edges of a supply network. Thevertices of the network represent the consumers and the providers of a resource, while the edgesallow us to transmit the resource without delays and capacity constraints. The Defender commitsa bounded budget to protect some of the edges, aiming to minimize the damage that is causedby the destruction of the unprotected edges. To measure the damage, we apply the value of thetotal resource deficit caused by the worst-case scenario of partial network destruction. TheDefender’s problem falls into the family of “Defender–Attacker” problems that are formalized asthe minimax mixed-integer programming problems. To find an optimal Defender’s solution, wesuggest some two cut generation schemes based on a reformulation of the problem asa mixed-integer problem with exponentially many constraints.

Original languageEnglish
Pages (from-to)416-429
Number of pages14
JournalJournal of Applied and Industrial Mathematics
Volume14
Issue number3
DOIs
Publication statusPublished - 1 Aug 2020

Keywords

  • cut generation
  • total deficit
  • “Defender–Attacker” problem

Fingerprint Dive into the research topics of 'Planning a Defense That Minimizes a Resource Deficit in the Worst-Case Scenario of Supply Network Destruction'. Together they form a unique fingerprint.

Cite this