On Methods for Rectifying Ordinal Inconsistency in Pairwise Comparison Matrices

A pairwise comparison matrix (PCM) is essential to the analytical hierarchy process. Ordinal inconsistency, an intransitive preference structure, in a PCM can cause different prioritization methods to obtain different preference rankings. After demonstrating the insufficiency of a recent heuristic algorithm by Siraj et al. [EJOR 216 (2012) 420–428] and reviewing existing methods for detecting and rectifying ordinal inconsistency, this note shows that the problem can be solved using a simple 0–1 programming model