On aircraft deconfliction by bilevel programming
Résumé
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.
Domaines
Recherche opérationnelle [math.OC]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...