On the stability radius of a vector problem of linear Boolean programming

We consider a multicriteria Boolean programming problem with linear partial criteria. We give lower and upper attainable bounds of the radius of stability of the Pareto set in the case where both the coefficients of the vector criterion and the elements of the constraint matrix are subject to independent disturbances.
This research was supported by the Foundation for Basic Research of Republic Byelarus, grant $\Phi$97–266.