MCDMDecision-makingRankingMath steps
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.
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
Compromise Programming — Lp-metric distance to ideal solution
Strengths & limitations
Strengths
- 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.
Limitations
- Assumes full compensation — a strong score on one criterion can offset a weak score on another.
Sources
- 1.Zeleny, M. (1973). Compromise programming. In: Multiple Criteria Decision Making (Cochrane & Zeleny, eds.), Univ. of South Carolina Press
You have read it. What now?
Cite this page
ScholarGate. (2026, June 2). COMPROMISE-PROGRAMMING. ScholarGate. https://scholargate.app/decision-making/compromise-programming