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.
On aircraft deconfliction by bilevel programming
Cerulli M.;
2019-01-01
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
