Publication: On complexity of finding strong-weak solutions in bilevel linear programming
On complexity of finding strong-weak solutions in bilevel linear programming
Date
Date
Date
Citations
Lagos, T., & Prokopyev, O. A. (2023). On complexity of finding strong-weak solutions in bilevel linear programming. Operations Research Letters, 51(6), 612–617. https://doi.org/10.1016/j.orl.2023.09.011
Abstract
Abstract
Abstract
We consider bilevel linear programs (BLPs) that model hierarchical decision-making settings with two independent decision-makers (DMs), referred to as a leader (an upper-level DM) and a follower (a lower-level DM). BLPs are strongly NP-hard. In general, the follower's rational reaction (i.e., a set that contains optimal solutions of the lower-level problem for a given leader's decision) is not a singleton. If we assume that, for a given leader's decision, the follower always selects a solution from the rational reaction set that is mo
Metrics
Citations
Additional indexing
Creators (Authors)
- Lagos, Tomás
Volume
Volume
Volume
Number
Number
Number
Page range/Item number
Page range/Item number
Page range/Item number
Page end
Page end
Page end
Item Type
Item Type
Item Type
In collections
Scope
Scope
Scope
Language
Language
Language
Publication date
Publication date
Publication date
Date available
Date available
Date available
ISSN or e-ISSN
ISSN or e-ISSN
ISSN or e-ISSN
OA Status
OA Status
OA Status
Publisher DOI
Metrics
Citations
Citations
Lagos, T., & Prokopyev, O. A. (2023). On complexity of finding strong-weak solutions in bilevel linear programming. Operations Research Letters, 51(6), 612–617. https://doi.org/10.1016/j.orl.2023.09.011
