On the Complexity of Robust Bilevel Optimization With Uncertain Follower's Objective
From MaRDI portal
Publication:6367913
DOI10.1016/J.ORL.2021.07.009zbMath1525.90392arXiv2105.08378MaRDI QIDQ6367913
Felix Hommelsheim, Christoph Buchheim, Dorothee Henke
Publication date: 18 May 2021
Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Hierarchical games (including Stackelberg games) (91A65)
This page was built for publication: On the Complexity of Robust Bilevel Optimization With Uncertain Follower's Objective