Das Suchergebnis hat sich seit Ihrer Suchanfrage verändert. Eventuell werden Dokumente in anderer Reihenfolge angezeigt.
  • Treffer 7 von 56
Zurück zur Trefferliste

An Exact Method for Nonlinear Network Flow Interdiction Problems

Status der Einreichung:under review
  • We study network flow interdiction problems with nonlinear and nonconvex flow models. The resulting model is a max-min bilevel optimization problem in which the follower's problem is nonlinear and nonconvex. In this game, the leader attacks a limited number of arcs with the goal to maximize the load shed and the follower aims at minimizing the load shed by solving a transport problem in the interdicted network. We develop an exact algorithm consisting of lower and upper bounding schemes that computes an optimal interdiction under the assumption that the interdicted network remains weakly connected. The main challenge consists of computing valid upper bounds for the maximal load shed, whereas lower bounds can directly be derived from the follower's problem. To compute an upper bound, we propose solving a specific bilevel problem, which is derived from restricting the flexibility of the follower when adjusting the load flow. This bilevel problem still has a nonlinear and nonconvex follower's problem, for which we then prove necessary and sufficient optimality conditions. Consequently, we obtain equivalent single-level reformulations of the specific bilevel model to compute upper bounds. Our numerical results show the applicability of this exact approach using the example of gas networks.

Volltext Dateien herunterladen

Metadaten exportieren

Metadaten
Verfasserangaben:Martin Schmidt, Johannes Thürauf
Dokumentart:Preprint
Sprache:Englisch
Datum der Veröffentlichung (online):19.10.2022
Datum der Freischaltung:21.10.2022
Freies Schlagwort / Tag:Bilevel Optimization; Interdiction Games; Mixed-Integer Nonlinear Optimization; Potential-Based Flows
Seitenzahl:28
Institute:Universität Trier
Teilprojekte:A05
B08
Lizenz (Deutsch):License LogoCreative Commons - CC BY - Namensnennung 4.0 International