ORESTE: Organisation, Rangement Et Synthèse de données rElaTionnEllEs

Overview

Outranking (weak order aggregation via Besson rank). Output typically utility (higher value = preferred).

Strengths

• •Method-specific: Outranking (weak order aggregation via Besson rank)

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)

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 ORESTE-specific edge handling. recommendation_metadata.assumptions_to_verify also lists boundary conditions.

Common pitfalls

• •Hatalı: 'ORESTE bu varsayımı kontrol etmeden uygulamak'. Doğrusu: Criteria preferences are independent (no synergistic interactions)
• •Hatalı: 'ORESTE bu varsayımı kontrol etmeden uygulamak'. Doğrusu: Compensation is acceptable: high score on one criterion can offset low on another
• •Hatalı: 'ORESTE bu varsayımı kontrol etmeden uygulamak'. Doğrusu: Decision matrix is complete (no missing values)
• •Hatalı: ORESTE'yi 'Criteria strongly correlated → consider DEMATEL/ANP for interdependence' durumunda kullanmak: recommendation_metadata.not_recommended_when alternatif öneriyor.
• •Hatalı: ORESTE'yi 'Non-compensatory preferences → consider outranking (ELECTRE/PROMETHEE)' durumunda kullanmak: recommendation_metadata.not_recommended_when alternatif öneriyor.

Worked example

1. 1.Adım 1 (F1): Step 1: Rank alternatives per criterion (ordinal input only). Formül: r_{ij} = \text{rank of }A_{i}\text{ on criterion }j Anchor: Pastijn-Leysen 1989, p.118 Eq.(1)
2. 2.Adım 2 (F2): Step 2: Aggregated position D(a,c_j) using Besson rank averaging with criterion rank r(c_j). Formül: D(A_{i},c_{j}) = \big(\tfrac{1}{2}(r_{ij}^{R}+r(c_{j})^{R})\big)^{1/R},\ R=\text{Minkowski exponent} Anchor: Pastijn-Leysen 1989, p.119 Eq.(2)
3. 3.Adım 3 (F3): Step 3: Global aggregated score S(A_i) = Σ_j R(D(A_i, c_j)) (rank of positions). Formül: S(A_{i}) = \sum_{j=1}^{n} R\big(D(A_{i},c_{j})\big) Anchor: Pastijn-Leysen 1989, p.120 Eq.(3)
4. 4.Adım 4 (F4): Step 4: Ascending ranking by S(A_i) (lower is better). Formül: \text{rank}(A_{i})\propto S(A_{i}) Anchor: Pastijn-Leysen 1989, p.121

Commonly paired with

• •AHP + ORESTE (high)
• •BWM + ORESTE (high)
• •ENTROPY + ORESTE (high)
• •CRITIC + ORESTE (high)
• •SWARA + ORESTE (high)

How to cite