Conditions of solvability of vector problems using linear convolution of criteria (Q1968512)

The paper is dedicated to vector minimum problems over finite admissible sets. The scalarization of this problem via convex combination of the criteria is called here Linear Convolution of Criteria (LCC). There are examples of vector problems, where there exist Pareto-minima that are not optimal for any LCC scalarized problem. The paper stated a criterion for the solvability of finite vector minimum problems via LCC scalarization. Futher an algorithm is presented for the reduction of so called problems of MINMAX-type and MINMIN-type to an equivalent vector minimum problem solvable using LCC. This scheme covers many well-known problems of optimization on graphs.