Solvability of the vector problem by the linear criteria convolution algorithm

Conditions are found under which a multicriteria problem with a finite set of vector estimates is solvable by means of the linear criteria convolution (LCC) algorithm, that is, any Pareto optimum for the problem can be obtained as an optimum solution to a one-criterion problem with an aggregated criterion defined as an LCC. Also, an algorithm is suggested that is polynomial in dimension and reduces any problem with minimax and minimin criteria to an equivalent vector problem with the same Pareto set solvable by the LCC algorithm.