On stability of an efficient solution of a vector Boolean problem of maximisation of absolute values of linear functions

We consider a vector (multicriteria) problem of Boolean programming in the case where the partial criteria are the absolute values of linear functions. We study the limit level of disturbances of the coefficients of criterion functions in the space with metrics $l_\infty$ which preserves the Pareto optimality of the solution. We obtain a necessary and sufficient condition for the stability radius of such a solution to be infinite.