Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/323571 
Year of Publication: 
2024
Citation: 
[Journal:] Optimization Letters [ISSN:] 1862-4480 [Volume:] 19 [Issue:] 3 [Publisher:] Springer [Place:] Berlin, Heidelberg [Year:] 2024 [Pages:] 689-697
Publisher: 
Springer, Berlin, Heidelberg
Abstract: 
It is well-known that coupling constraints in linear bilevel optimization can lead to disconnected feasible sets, which is not possible without coupling constraints. However, there is no difference between linear bilevel problems with and without coupling constraints w.r.t. their complexity-theoretical hardness. In this note, we prove that, although there is a clear difference between these two classes of problems in terms of their feasible sets, the classes are equivalent on the level of optimal solutions. To this end, given a general linear bilevel problem with coupling constraints, we derive a respective problem without coupling constraints and prove that it has the same optimal solutions (when projected back to the original variable space).
Subjects: 
Bilevel optimization
Coupling constraints
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Document Version: 
Published Version

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.