Global Sensitivity Analysis for the Linear Assignment Problem
E Michael, TA Wood, C Manzie, I Shames
Proceedings of the American Control Conference | IEEE | Published : 2020
In this paper, the following question is addressed: given a linear assignment problem, how much can the all of the individual assignment weights be perturbed without changing the optimal assignment? The extension of results involving perturbations in just one edge or one row/column are presented. Algorithms for the derivation of these bounds are provided. We also show how these bounds may be used to prevent assignment churning in a multi-vehicle guidance scenario.