On quasi-stability of the vector Boolean problem of minimizing absolute deviations of linear functions from zero

Abstract

We consider a multi-criterion Boolean programming problem with partial criteria of the kind MIN MODUL of linear functions. We investigate such type of stability which can be understood as a discrete analogue of the Hausdorff lower semi-continuity. A formula of the quasi-stability radius is obtained.

Keywords

• Dvector Boolean programming problem
• Pareto set
• quasi-stability
• quasi-stability radius