Stability analysis of the Pareto optimal solutions for some vector Boolean optimization problem

In this article we consider the Boolean optimization problem of finding the set of Pareto optimal solutions. The vector objectives are the positive cuts of linear functions to the non-negative semi-axis. Initial data are subject to perturbations, measured by the l1-norm in the parameter space of the problem. We present the formula expressing the extreme level (stability radius) of such perturbations, for which a particular solution remains Pareto optimal.