This page is published in English.
Ranking
IV-TOPSIS - Interval-valued intuitionistic fuzzy extension of TOPSIS
Interval-valued intuitionistic fuzzy outranking/ranking - IVIFS (Atanassov 1989)
Jahanshahloo, G. R., Lotfi, F. H., Izadikhah, M.2006doi:10.1016/j.amc.2005.08.048 ↗
Overview
IV-TOPSIS extends crisp TOPSIS to bounded uncertainty represented as Interval Numbers IN: [L, U]. The Jahanshahloo-Lotfi-Izadikhah (2006) algorithm keeps both bounds throughout normalisation and weighting; the positive- and negative-ideal solutions are then assembled by taking max/min over the appropriate bound depending on whether each criterion is a benefit or a cost. Distances use the opposite bound (lower for d⁺ on benefits, upper for d⁻ on benefits, swapped for costs) so that the worst-case separation is measured. The final relative closeness C* is a crisp scalar in [0, 1] - no defuzzification step is needed.
- Output
- utility, higher is better
- Data
- Interval Intuitionistic Fuzzy, uncertainty tuples complete
- Weights
- Needs a weight source
- Size
- 2+ alternatives, 3-10 criteria works best
- Used for
- Interval MCDM, MAGDM under epistemic uncertainty, expert-driven evaluation with linguistic terms
How it works
- 1
IV-TOPSIS-base
- 2
IV-TOPSIS-base
- 3
IV-TOPSIS-base
- 4
IV-TOPSIS-base
- 5
IV-TOPSIS-base
Fits when / Look elsewhere when
Fits when
- •Preserves interval uncertainty through the pipeline rather than premature crispification at elicitation
- •Native group-decision support (multi-DM aggregation built into the pipeline)
Look elsewhere when
- •Crisp data sufficient - use base TOPSIS directly (avoid unnecessary uncertainty layer)
- •Aggregation operator (PFWA/PFOWA/etc.) not specified - output ambiguous
Assumptions to verify
- Decision matrix entries are valid Interval numbers/tuples
- Underlying crisp method's compensation assumption holds in uncertain space
- All decision-maker(s) and experts use the same linguistic/uncertainty scale
Limitations
- •Rank reversal known on alternative-set changes (ref: inherited from crisp base; cf. Belton-Gear 1983, Wang-Luo 2009)
Edge cases and pitfalls
Value-space violation: ensure all entries satisfy IN: L ≤ U before computation; a single inverted bound corrupts the column denominator.
Cost/benefit direction confusion: the bound used for the ideal swaps with the criterion direction. Mis-assigning min/max collapses IV-TOPSIS to a crisp variant on the wrong bound.
Treating [L, U] as a triangular fuzzy number: IV-TOPSIS uses interval (not TFN) arithmetic. There is no centroid step; if your data are TFNs use FUZZY-TOPSIS instead.
Works with
Commonly takes its weights from
How to cite
Jahanshahloo, G. R.; Lotfi, F. H.; Izadikhah, M. (2006). An algorithmic method to extend TOPSIS for decision-making problems with interval data. Applied Mathematics and Computation. https://doi.org/10.1016/j.amc.2005.08.048
System ID, as it appears in reports and the API
IV-TOPSIS