  In several multiobjective decision problems Pairwise Comparison Matrices
(PCM) are applied to evaluate the decision variants. The problem that arises
very often is the inconsistency of a given PCM. In such a situation it is
important to approximate the PCM with a consistent one. The most common way is
to minimize the Euclidean distance between the matrices. In the paper we
consider the problem of minimizing the maximum distance. After applying the
logarithmic transformation we are able to formulate the obtained subproblem as
a Shortest Path Problem and solve it more efficiently. We analyze and
completely characterize the form of the set of optimal solutions and provide an
algorithm that results in a unique, Pareto-efficient solution.

Optimization and Control