Stability and Regularization of Vector Problems of Integer Linear Programming

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.