Stability analysis for a parameterized multicriteria Boolean linear programming problem

A multicriteria boolean programming problem with linear cost functions in which initial coefficients of the cost functions are subject to perturbations is considered. For any optimal alternative, with respect to parameterized principle of optimality “from Condorcet to Pareto”, an appropriate measure of the quality is introduced. This measure corresponds to the so-called stability function defined earlier for optimal solutions of a generic multicriteria combinatorial optimization problem with Pareto and lexicographic optimality principles. Various properties of such function are studied and maximum norm of perturbations for which an optimal solution preserves its optimality is calculated.