Sensitivity Analysis for Bottleneck Assignment Problems

Abstract

In assignment problems, decision makers are often interested in not only the optimal assignment, but also the sensitivity of the optimal assignment to perturbations in the assignment weights. Typically, only perturbations to individual assignment weights are considered. We present a novel extension of the traditional sensitivity analysis by allowing for simultaneous variations in all assignment weights. Focusing on the bottleneck assignment problem, we provide two different methods of quantifying the sensitivity of the optimal assignment, and present algorithms for each. Numerical examples as well as a discussion of the complexity for all algorithms are provided.

Temporal Logic Planning for Minimum-Time Positioning of Multiple Threat-Seduction Decoys

“…To quantify the difference in cost of a bottleneck optimal assignment to the next best assignment when a particular edge is discarded, we consider the notion of robustness margin defined in [18] that is related to the concept of allowable perturbation introduced in [33].…”