On the calculation of stability radius for multi‐objective combinatorial optimization problems by inverse optimization

This paper deals with stability analysis in multi‐objective combinatorial optimization problems. The stability radius of an efficient solution is defined as the maximal adjustment of the problem parameters such that this solution remains efficient. An algorithm based on inverse optimization is proposed to compute it. The adjustment is limited to the coefficients of the objective functions and measured by the Chebyshev norm. This approach is applied to randomly generated instances of the bi‐objective knapsack problem and computational results are reported. Several illustrative examples are analyzed.