Abstract:
We study the solvability of the problem of searching for the lexicographic set of a vector (multicriterial) optimization problem in the class of algorithms of the linear convolution of criteria. We find necessary as well as sufficient conditions for such solvability. For the case of a two-criterion problem, we give a condition that is both necessary and sufficient for solvability.