Abstract
We present a bilevel programming formulation for the aircraft deconfliction problem with multiple lower-level subproblems. We propose two reformulation based on the KKT conditions and the dual of the lower-level subproblems. Finally, we compare the results obtained implementing these formulations using global optimization solvers.
| Original language | English |
|---|---|
| Pages | 25-28 |
| Number of pages | 4 |
| Publication status | Published - 1 Jan 2019 |
| Event | 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2019 - Enschede, Netherlands Duration: 1 Jul 2019 → 3 Jul 2019 |
Conference
| Conference | 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2019 |
|---|---|
| Country/Territory | Netherlands |
| City | Enschede |
| Period | 1/07/19 → 3/07/19 |