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.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
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.
Sources
- Srinivasan, V., Shocker, A. D. (1973). Linear programming techniques for multidimensional analysis of preferences. Psychometrika DOI: 10.1007/BF02291658 ↗
How to cite this page
ScholarGate. (2026, June 2). LINear programming technique for Multidimensional Analysis of Preference. ScholarGate. https://scholargate.app/en/decision-making/linmap
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- AHPDecision-making↔ compare
- ANPDecision-making↔ compare
- BWMDecision-making↔ compare
- BWM-BAYESIANDecision-making↔ compare
- CCSDDecision-making↔ compare
- CILOSDecision-making↔ compare
- CIMASDecision-making↔ compare
- CRITICDecision-making↔ compare