Sensitivity Analysis for Bottleneck Assignment Problems

DOI10.1016/J.EJOR.2022.02.037MaRDI QIDQ6364378arXivFDO

Authors Elad Michael, Tony A. Wood, Chris Manzie, Iman Shames

Publication date 1 April 2021

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Sensitivity, stability, parametric optimization (90C31)

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.

This page was built for publication: Sensitivity Analysis for Bottleneck Assignment Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6364378)