The stability radius of an efficient solution in minimax Boolean programming problem

Abstract

We consider a vector minimax Boolean programming problem. The problem consists in finding the set of Pareto optimal solutions. When the problem's parameters vary then the optimal solution of the problem obtained for some initial parameters may appear non-optimal. We calculate the maximal perturbation of pa- rameters which preseves the optimality of a given solution of the problem. The formula for the stability radius of the given Pareto optimal solution was obtained.