On a measure of quasistability of a certain vector linearly combinatorial Boolean problem

We consider a multicriterion problem of finding the Pareto set in the case when linear forms (functions) are minimized both on a set of substitutions and on a set of Boolean vectors. We obtain a formula for the radius of that type of the problem stability (with respect to perturbations of parameters of a vector criterion) that guarantees the preservation of all Pareto optimal solutions of the initial problem and allows the occurrence of new ones.