LINear programming technique for Multidimensional Analysis of Preference
LINMAP (LINear programming technique for Multidimensional Analysis of Preference) is a ranking multi-criteria decision-making (MCDM) method introduced by Srinivasan, V., Shocker, A. D. in 1973. It turns a decision matrix of alternatives scored on multiple criteria into a structured, reproducible result.
Key highlights
- Follows a transparent, reproducible computational procedure that can be audited step by step.
- Handles multiple criteria of differing scales and units within a single decision matrix.
Intuition
This section is available to Pro members. Upgrade to Pro
How it works
This section is available to Pro members. Upgrade to Pro
When to use it
LINMAP infers both criterion weights and an ideal point from pairwise preference judgements. It requires no explicit weight elicitation. The closer an alternative is to the inferred ideal (lower D), the better. If the LP is inconsistent (Σ s > 0), some judgements are violated — examine which pairs are most inconsistent.
Strengths & limitations
- Follows a transparent, reproducible computational procedure that can be audited step by step.
- Handles multiple criteria of differing scales and units within a single decision matrix.
- Assumes full compensation — a strong score on one criterion can offset a weak score on another.
Common pitfalls
This section is available to Pro members. Upgrade to Pro
Sources
- 1.Srinivasan, V., Shocker, A. D. (1973). Linear programming techniques for multidimensional analysis of preferences. Psychometrika
You have read it. What now?
Cite this page
ScholarGate. (2026, June 2). LINMAP. ScholarGate. https://scholargate.app/decision-making/linmap