On the stability of the Pareto optimum of a vector Boolean programming problem

We present bounds for the possible disturbances of the input parameters of a vector problem of linear Boolean programming which preserve the Pareto optimality of the solution.
This research was supported by the Byelorussian Republican Foundation for Basic Research, grant $\Phi$ 97–266.