Algorithm and program for graphical selection of the Pareto set in a point array

In this paper, we consider the main algorithmic difficulties of constructing a Pareto set associated with the configuration of an array of points. On the basis of the coordinate approach «maximin» the author's algorithm of construction is made, taking into account these difficulties. The program is written in Python. The program was graphically tested on a specific example: a sample with a minimum total price and high «quality» (Harrinkton desirability) was extracted from a set of acoustic detectors. Using combinatorial reasoning, the dimension of the search space is reduced.