A new algorithm is used to test and describe the set of all possible solutions for any linear model of an empirical ordering derived from techniques such as additive conjoint measurement, unfolding theory, general Fechnerian scaling, and ordinal multiple regression. The algorithm is computationally faster and numerically superior to previous algorithms. (Author)