Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2025-01-05T14:11:05.776Z Has data issue: false hasContentIssue false
  • English
  • Français

A New Solution to the Problem of Finding All Numerical Solutions to Ordered Metric Structures

Published online by Cambridge University Press:  01 January 2025

Paul E. Lehner  and
Elliot Noma
Paul E. Lehner*
Affiliation:
The University of Michigan
Elliot Noma
Affiliation:
The University of Michigan
*
Requests for reprints should be sent to Paul E. Lehner, Department of Psychology, 580 Union Drive, University of Michigan, Ann Arbor, MI, 48109.
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Keywords

ordered metric structuresconvex coneadditive conjoint measurementunfolding theoryFechnerian scaling
Type
Notes and Comments
Information
Psychometrika , Volume 45 , Issue 1 , March 1980 , pp. 135 - 137
Copyright
Copyright © 1980 The Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

This research was supported in part by NIGMS grant GM-01231 to the University of Michigan. Authors’ names are in alphabetic order.

References

Reference Note

Mattheiss, T. H., Rubin, D. S. A survey and comparison of methods for finding all vertices of convex polyhedral sets, 1977, Chapel Hill: Curriculum in Operations Research, University of North Carolina at Chapel Hill.Google Scholar

References

Chernikova, N. V. Algorithm for finding a general formula for the nonnegative solutions of a system of linear inequalities. U.S.S.R. Computational Mathematics and Mathematical Physics, 1965, 5, 228–233.CrossRefGoogle Scholar
Coombs, C. H. A theory of data, 1964, New York: Wiley.Google Scholar
Goode, F. M. An algorithm for the additive conjoint measurement of finite data matrices. American Psychologist, 1964, 19, 579–579.Google Scholar
McClelland, G. H. & Coombs, C. H. ORDMET, A general algorithm for constructing all numerical solutions to ordered metric structures. Psychometrika, 1975, 40, 269–290.CrossRefGoogle Scholar
Motzkin, T. S., Raiffa, H., Thompson, G. L., & Thrall, R. M. The double description method. In Kuhn, H. W., & Tucker, A. W. (Eds.), Contributions to the Theory of Games, II. Annals of Mathematics Study, No. 28, 1953, Princeton, N.J.: Princeton University Press.Google Scholar
Murty, K. G. Linear and combinatorial programming, 1976, New York: Wiley.Google Scholar
Phillips, J. P. N. A note on the representation of ordered metric scaling. British Journal of Mathematical and Statistical Psychology, 1971, 24, 239–250.CrossRefGoogle Scholar
Wetz, R. J. B. & Witzgall, C. Algorithms for frames and linearity of cones. Journal of Research of the National Bureau of Standards, 1967, 71, 1–7.Google Scholar