Maximal and supremal tolerances in multiobjective linear programming

► We consider stability of efficiency in multiobjective linear programming problems. ► We compute maximal tolerances for perturbations of objective function coefficients. ► We show that the problem is NP-hard, the method is exponential in the worst case. ► We extend the united tolerance to individual tolerances.