Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/313686 
Year of Publication: 
2024
Citation: 
[Journal:] International Transactions in Operational Research [ISSN:] 1475-3995 [Volume:] 32 [Issue:] 3 [Publisher:] Wiley Periodicals, Inc. [Place:] Hoboken, NJ [Year:] 2024 [Pages:] 1227-1250
Publisher: 
Wiley Periodicals, Inc., Hoboken, NJ
Abstract: 
In this tutorial, we consider single‐leader‐multi‐follower games in which the models of the lower‐level players have polyhedral feasible sets and convex objective functions. This situation allows for classic Karush–Kuhn–Tucker reformulations of the separate lower‐level problems, which lead to challenging single‐level reformulations of Mathematical Programing with Complementarity Constraints (MPCC) type. The main contribution of this tutorial is to present a ready‐to‐use reformulation of this MPCC using special‐ordered‐sets of type 1 (SOS1) conditions. These conditions are readily available in all modern mixed‐integer linear optimization solvers that solve the single‐leader‐multi‐follower problem to optimality. After formally stating the problem class under consideration as well as deriving its reformulations, we present explicit Python code that shows how these techniques can be realized using the solver Gurobi . Finally, we also show the effect of the SOS1‐based reformulation using the real‐world example of industrial eco‐park modeling.
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by-nc-nd 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.