Lexicographic optima in the multicriteria discrete optimization problem

It is shown that any lexicographic optimum in vector optimization problems on a finite set of admissible solutions can be obtained by a classical technique, the linear convolution of criteria.