Compromise Programming — Lp-metric distance to ideal solution
COMPROMISE-PROGRAMMING (Compromise Programming — Lp-metric distance to ideal solution) is a ranking multi-criteria decision-making (MCDM) method introduced by Zeleny, M. 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
Compromise Programming — Lp-metric distance to ideal solution
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
- Zeleny, M. (1973). Compromise programming. In: Multiple Criteria Decision Making (Cochrane & Zeleny, eds.), Univ. of South Carolina Press link ↗
How to cite this page
ScholarGate. (2026, June 2). Compromise Programming — Lp-metric distance to ideal solution. ScholarGate. https://scholargate.app/en/decision-making/compromise-programming
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