An elementary proof of Paelinck's theorem on the convex hull of ranked criterion weights

Abstract

Paelinck's theorem provides a simple characterization of the set of possible criterion weights when only the rank order of the criteria is known. Methods for multi-criteria analysis based on this theorem are sometimes able to identify a preferred alternative without numerical estimates of these weights. We provide a new, elementary proof of the theorem.