Methods of searching for the Kemeny median for non-strict and partial orderings of alternatives

This article describes an approximate algorithm for finding the Kemeny median for a set of non-strict orderings of alternatives. The study was carried out for choosing alternatives involving making an informed decision on the completion of the analysis and generalization of incoming information and reaching a threshold value for the decision criterion. The article offers a justification for choosing solutions to multi-criteria tasks in planning and management from an existing set of alternatives using expert assessments. Two algorithms for searching for the Kemeny median are proposed in the presence of non-strict and partial orderings in the initial profile and in the presence of alternatives that have not been evaluated by experts. The article discusses constructing the Kemeny median according to the algorithm using a numerical example. The article shows the validity of using the approximate algorithm to solve the express algorithm in comparison with the traditional exact algorithm. It is separately noted that in the case of several solutions, the algorithm guarantees finding an option that is close enough to an expert ordering of the expert assessment profile under consideration.