In this article we consider the problem of finding the Pareto set, and also the problem of
lexicographic optimization. We study several types of stability, understood as preservation of
certain properties of the efficient solution set under" small" changes of input data. The
borders of such changes are ascertained. Necessary and sufficient conditions of stability are
specified. A regularizing operator is proposed for transferring a probably unstable problem
to a series of stable ones.

1. SE Bukhtoyarov, VA Emelichev,“Parametrizatsiya printsipa optimalnosti (“ot Pareto do
Sleitera”) i ustoichivost mnogokriterialnykh traektornykh zadach”, Diskretn. analiz i issled.
oper., ser. 2, ser. 2, 10: 2 (2003), 3–18 mathnet mathscinet2. VA Emelichev, KG
Kuz'min,“Stability analysis of a strictly efficient solution of a vector problem of Boolean
programming in the metric $ l_1 $”, Discrete Math. Appl., 14: 5 (2004), 521–526 mathnet
crossref crossref mathscinet zmath