An algorithm for solving a class of discrete multicriterion problems

An algorithm is given for solving problems of multicriterion discrete optimization; it is based on the use of the minimum function when partial criteria are convoluted. In the case of monotonic constraints, the algorithm guarantees that a complete inspection isavoided.