Stability analysis of a strictly efficient solution of a vector problem of Boolean programming in the metric $l_1$

We consider a vector (multicriteria) problem of Boolean programming where sub-criteria are projections of linear functions onto $\mathbf R_+$. We give a bound for variation of coefficients of such functions in the metric $l_1$ which preserves strict efficiency of the solution.
This research was supported by the State Program of Basic Research of Republic Byelarus ‘Mathematical Structures’ 29.