Ranking
Compromise Programming: Lp-metric distance to ideal solution
Zeleny, M. · 1973
Overview
Distance-based: Lp metric to Pareto-optimal ideal (parametric p). Output typically utility (higher value = preferred).
Strengths
- •Method-specific: Distance-based: Lp metric to Pareto-optimal ideal (parametric p)
Limitations
- •Assumes: Criteria preferences are independent (no synergistic interactions)
- •Assumes: Compensation is acceptable: high score on one criterion can offset low on another
- •Assumes: Decision matrix is complete (no missing values)
Method assistant
Grounded explanations: it explains the method, it does not compute.
Assumptions to verify
- •Criteria preferences are independent (no synergistic interactions)
- •Compensation is acceptable: high score on one criterion can offset low on another
- •Decision matrix is complete (no missing values)
When not to use
- •Criteria strongly correlated → consider DEMATEL/ANP for interdependence
- •Non-compensatory preferences → consider outranking (ELECTRE/PROMETHEE)
Edge cases
- •See F.steps and D.parameters for COMPROMISE-PROGRAMMING-specific edge handling. recommendation_metadata.assumptions_to_verify also lists boundary conditions.
Common pitfalls
- •Hatalı: 'COMPROMISE-PROGRAMMING bu varsayımı kontrol etmeden uygulamak'. Doğrusu: Criteria preferences are independent (no synergistic interactions)
- •Hatalı: 'COMPROMISE-PROGRAMMING bu varsayımı kontrol etmeden uygulamak'. Doğrusu: Compensation is acceptable: high score on one criterion can offset low on another
- •Hatalı: 'COMPROMISE-PROGRAMMING bu varsayımı kontrol etmeden uygulamak'. Doğrusu: Decision matrix is complete (no missing values)
- •Hatalı: COMPROMISE-PROGRAMMING'yi 'Criteria strongly correlated → consider DEMATEL/ANP for interdependence' durumunda kullanmak: recommendation_metadata.not_recommended_when alternatif öneriyor.
- •Hatalı: COMPROMISE-PROGRAMMING'yi 'Non-compensatory preferences → consider outranking (ELECTRE/PROMETHEE)' durumunda kullanmak: recommendation_metadata.not_recommended_when alternatif öneriyor.
Worked example
- 1.Adım 1 (F1): Validate inputs for compromise-programming. Formül: L_p(x)=\left[\sum_j w_j^p\frac{|f_j^*-f_j(x)|^p}{|f_j^*-f_j^\circ|^p}\right]^{1/p} Anchor: Zeleny 1973, (pending PDF page verification)
Commonly paired with
- •AHP + COMPROMISE-PROGRAMMING (high)
- •BWM + COMPROMISE-PROGRAMMING (high)
- •ENTROPY + COMPROMISE-PROGRAMMING (high)
- •CRITIC + COMPROMISE-PROGRAMMING (high)
- •SWARA + COMPROMISE-PROGRAMMING (high)
How to cite
Zeleny, M. (1973). Compromise programming. In: Multiple Criteria Decision Making (Cochrane & Zeleny, eds.), Univ. of South Carolina Press. https://doi.org/10.1007/978-3-642-80808-1