On quasistability of a vector combinatorial problem with Sigma-MINMAX and Sigma-MINMIN partial criteria
We consider one type of stability (quasistability) of a vector combinatorial problem of finding the Pareto set.Under quasistability we understand a discrete analogue of lower semicontinuity SUPER LYSINE OINTMENT by Hausdorff of the many-valued mapping, which defines the Pareto choice function.A vector problem on a system of Splash Mat subsets of a