Methods · Outranking
PROMETHEE (Preference Ranking Organisation Method for Enrichment of Evaluations)
PROMETHEE is a family of outranking methods that compare alternatives not against a hypothetical ideal but against each other. It grades "how much better" on every criterion with a preference function, comparing alternatives pairwise, and combines these comparisons into positive and negative flows to yield a partial or a full ranking.
Base method's data type: Classical
What Is the Method?
PROMETHEE is an outranking method for when you already hold a decision table, weighing the alternatives pairwise against each other. Unlike TOPSIS or VIKOR, it does not construct a hypothetical ideal alternative; it compares the real alternatives directly against one another. The family's shared output, for every alternative, is three things: a positive flow showing how far it outranks the others, a negative flow showing how far it is outranked, and a net flow formed from the difference between the two. The method was proposed by Brans and Vincke in 1985. The same team split it, in 1986, into two ranking forms: PROMETHEE I, which gives only a partial outranking relation, and PROMETHEE II, which yields a full ranking based on the net flow. This base PROMETHEE entry in DecisionMind works on net-flow logic and produces a full ranking; it does not produce weights, it takes them from outside. It is one of the most heavily cited outranking families in the multi-criteria decision literature, applied widely in multi-stakeholder fields such as supplier selection, project and investment ranking, environmental assessment, and energy planning.
The Philosophy Behind It
The PROMETHEE family's starting point is to derive the definition of a "good alternative" not from a hypothetical reference point but from real rivals. The method takes every pair of alternatives and uses the difference on each criterion not in raw form but passed through a preference function. The preference function answers, criterion by criterion, the question "is a difference of this size a genuine preference, or measurement noise." In its simplest form, even the smallest difference counts as a full preference. In threshold forms, anything below a given difference is treated as indifference and anything above another as full preference, rising linearly in between. These filtered preferences are combined with the criterion weights to give, for every pair, a single figure: how much a is preferred to b. Each alternative's degree of outranking the others is then summed; this is called the positive flow. Its degree of being outranked by the others is summed separately; this is called the negative flow.
The family's philosophical divide begins exactly here. The positive and negative flows do not always point to the same ranking. An alternative can outrank most of its rivals, giving it a high positive flow, and at the same time be outranked by several rivals, giving it a high negative flow too. PROMETHEE I keeps these two flows separate and compares only those pairs where both point in the same direction. Where the two conflict, that pair is treated as "incomparable" and is not placed relative to one another in the ranking. This is an honest but incomplete result: the method falls silent where it cannot rank confidently with the information it has. PROMETHEE II resolves this dilemma by combining the positive and negative flows into a single net flow. Every pair becomes comparable, at the cost of losing the "incomparable" option. This base PROMETHEE entry in DecisionMind works on net-flow logic and always produces a full ranking. This means the result is a full ranking rather than a partial outranking, and so shares the same computational logic as PROMETHEE II.
How It Works
The method proceeds through five steps.
First, choosing the preference function. A preference function, and, where relevant, threshold values (an indifference threshold q, a preference threshold p), are set for every criterion. This choice depends on how precisely the criterion is measured. For a sharply measured criterion, price, say, the simplest function can count every difference. For subjective or noisy scoring, a threshold function can treat small differences as meaningless. Where none is specified, DecisionMind assumes the simplest (absolute) function.
Second, the pairwise preference degree. For every criterion, the difference is calculated for every pair of alternatives; for a "higher is better" criterion, b's value is subtracted from a's, and the reverse for a "lower is better" criterion. This difference is converted into a degree between 0 and 1 by the chosen preference function.
Third, the overall preference index. The preference degree on each criterion is multiplied by that criterion's weight and summed; this gives, for every pair, a single figure: how much a is preferred to b.
Fourth, positive and negative flow. An alternative's average preference degree against every other alternative gives its positive flow. The other alternatives' average preference degree against it gives its negative flow.
Fifth, net flow and ranking. The net flow is the negative flow subtracted from the positive flow. In this base PROMETHEE entry, DecisionMind ranks alternatives from largest to smallest net flow; this is PROMETHEE II's full-ranking logic. Where PROMETHEE I's partial outranking relation is wanted, the positive and negative flows' separate rankings are compared, and pairs where they conflict are left incomparable. This is a separate way of reading the result, not the computational step this card describes.
The formulas behind each step, the intermediate tables and the citation formats are given on the DecisionMind method page; this card carries no formulas.
How to Read the Output
The net flow is a value between −1 and +1; a larger value is better. It should be read together with the positive and negative flows, not on its own. A high positive flow shows that an alternative outranks most of its rivals; a low negative flow shows that it is outranked by few of them. Whether an alternative comes out ahead because it "wins a lot" or because it "loses little" should be stated separately in the report. The net flow is not the same thing as PROMETHEE I's partial outranking relation: in the net flow every alternative finds a place, whereas in PROMETHEE I some pairs may be deliberately left unranked. The net flow cannot be compared with the result of a different method, the way TOPSIS's closeness score cannot; it is meaningful only for this alternative set and these preference functions.
Thus instead of writing:
"According to PROMETHEE, A2 is the best alternative"
the report should read:
"With the preference functions and weights chosen, A2 is the alternative most clearly preferred in the pairwise comparisons (Φ = 0.33); this result is sensitive to the type of preference function and to the weights"
Data Type and Inputs
PROMETHEE works with crisp data, one number per cell. The criterion scale need not be only ratio or interval; it may also be ordinal. You need alternatives in rows, criteria in columns, one number per cell; direction information for every criterion; weights summing to 1; and a preference-function type for every criterion. Where a function type is not specified, DecisionMind assumes the simplest type. Threshold functions also require threshold values. It does not produce weights, it asks for them; they can be drawn from sources such as AHP, BWM, CRITIC or Entropy. DecisionMind holds eighteen members in this family, including base PROMETHEE and PROMETHEE II, alongside various extensions for different types of uncertainty. A minimum of two alternatives and two criteria is required; three to fifteen alternatives and three to twelve criteria work comfortably. Beyond thirty alternatives, the number of pairwise comparisons grows quadratically and the computational burden becomes noticeable.
When to Use It, When Not To
PROMETHEE is a suitable choice if your criteria can be measured numerically or on an ordinal scale, pairwise-comparison logic helps your work, and you want to define a different "how much of a difference matters" threshold per criterion. Its typical fields are supplier selection, project and investment ranking, environmental assessment, and energy planning; it is especially preferred in multi-stakeholder decisions where thresholds are open to debate.
There are three situations where it should not be used. First, where the number of alternatives is very large; beyond fifty, the cost of pairwise comparison rises quickly. Second, where a simple, fully compensatory aggregation suffices; here TOPSIS or WASPAS is a lighter tool. Third, where the decision needs to be not a definitive full ranking but an honest partial relation, that is, where it is not essential that no pair be left "incomparable"; here PROMETHEE I's partial reading, or the ELECTRE family, should be considered.
Pairwise-comparison logic and a full ranking are wanted → PROMETHEE
Honestly leaving some pairs "incomparable" is acceptable → PROMETHEE I's partial reading
Computational burden matters for an alternative set beyond fifty → a lighter ranking method (TOPSIS, SAW)
Not a ranking but elimination or a core set is needed → the ELECTRE family
The data is fuzzy, grey or intuitionistic rather than crisp → the relevant extension in the family
Strengths
The PROMETHEE family's clear strength is the flexibility of choosing a different preference function per criterion; a sharply measured criterion is not judged with the same rigidity as subjective scoring. Second, it works directly between alternatives without constructing an ideal or anti-ideal point; the result reads "relative to real rivals." Third, keeping the positive and negative flows separate makes visible why an alternative comes out ahead, whether it wins a lot or loses little. Fourth, because the family offers both a partial (PROMETHEE I) and a full (PROMETHEE II) reading, it can give the decision-maker two different answers to the question "how confidently can I speak here." This flexibility explains why the family is one of the most heavily cited outranking methods in the literature, with the widest base of application (Behzadian, Kazemzadeh, Albadvi and Aghdasi, 2010).
Weaknesses
Its limitations arise from the same flexibility. First, rank reversal is a known problem: the ranking can change when an alternative is added or removed (Mareschal, De Smet and Nemery, 2008). Second, the choice of preference function and thresholds (p, q) directly affects the result. These choices do not emerge from the data on their own; they require the analyst's or decision-maker's judgement and look arbitrary if left unjustified. Third, the computational burden grows with the square of the number of alternatives; this is costly for large sets. Fourth, because this base PROMETHEE entry produces a full ranking via the net flow, it does not on its own display the honesty PROMETHEE I can offer in saying "these two alternatives are genuinely incomparable"; the user must raise this question separately.
Common Mistakes
The most common mistake is applying the simplest (absolute) preference function without justification to a continuously scaled criterion (price, duration, say) and treating even small measurement differences as full preferences. This processes measurement noise as though it were a genuine preference. A second mistake is reporting the net flow alone without showing the positive and negative flows; this hides why an alternative came out ahead. A third mistake is adding an alternative once the analysis is finished and being surprised the ranking changes (rank reversal); the alternative set must be fixed before the analysis. A fourth mistake is setting threshold values (p, q) without ever determining them or consulting anyone; these values require domain-expert judgement. A fifth mistake is reading the net flow as a percentage or a probability.
The governing principle is this:
The net flow is a product of the preference functions, thresholds and weights chosen; when these choices change, the ranking can change too, and the report must state plainly which functions and which thresholds were used.
Cases
Each case opens with a decision table, describes in words what the method does to it, and shows how to read the result. The first case is an illustrative validation example; the remaining cases are illustrative constructions.
1. HR: A hiring evaluation among three job candidates (illustrative example)
A company's human resources unit must choose among three finalist candidates. Three criteria apply: a technical-competence score, a communication-skills score, and a work-experience score; all three are "higher is better" and were scored by an interview panel on a 1–5 scale. The unit has given all three criteria equal weight (0.33 each) and used the simplest preference function on every criterion, under which even the smallest difference counts as a full preference.
| Candidate | Technical competence | Communication | Experience |
|---|---|---|---|
| A1 | 4 | 3 | 2 |
| A2 | 2 | 5 | 4 |
| A3 | 3 | 4 | 3 |
| Direction | higher is better | higher is better | higher is better |
| Weight | 0.33 | 0.33 | 0.33 |
For every pairwise comparison, the method looks, on every criterion, at which candidate scores higher; because the function is the simplest type, even the smallest difference counts as a full preference. These preferences are combined with the equal weights to calculate each candidate's positive flow (how far it outranks the others) and negative flow (how far it is outranked).
| Candidate | Φ⁺ (positive) | Φ⁻ (negative) | Φ (net flow) | Rank |
|---|---|---|---|---|
| A2 | 0.667 | 0.333 | 0.333 | 1 |
| A3 | 0.500 | 0.500 | 0.000 | 2 |
| A1 | 0.333 | 0.667 | -0.333 | 3 |
The result reads as follows. A2 has the lowest technical-competence score, yet it ranks first. This is because it has the highest scores on communication and experience; the equal-weight structure counts this advantage on two criteria for more than its weakness on technical competence. A3 comes second: best on no criterion, but worst on none either. A1 comes third, the only candidate with a negative net flow: best on technical competence, but worst on communication and experience.
The unit hesitates here: would the result change if technical competence were given a higher weight? When the weights are redistributed to 0.70 for technical competence and 0.15 each for communication and experience (calculated independently by running the same algorithm in Python), the net flows come out at +0.40 for A1, 0.00 for A3 and −0.40 for A2, and the ranking reverses completely. This shows how sensitive the gap between the three candidates is to which criterion is given how much weight. The unit must defend in the report why the weight distribution was set as it was.
In the report: "With equal weights given to the criteria, A2 is the candidate most clearly preferred in the pairwise comparisons (Φ = 0.33). When the weight is shifted to technical competence, the ranking reverses completely; the weight distribution must therefore be separately approved by the hiring committee."
Source: this case is DecisionMind's validation example for the PROMETHEE engine. The matrix, weights and expected net-flow values (recorded in the manifest as A1/A2/A3 and C1/C2/C3) were constructed as a small example that can be calculated by hand; it is not a table from Brans, Vincke and Mareschal's (1986) article. The figures for the weight-change scenario were independently recalculated by this card's author using the same algorithm.
2. Sport: A sports club's selection of a new head-coach candidate
A professional sports club's board must choose among three coaching candidates. Three criteria apply: a past-success score, a player-development reference score, and a team-fit interview score; all three are "higher is better." The board has given past success the highest weight, with less weight allocated to the other two criteria. Because past success can be measured, the simplest preference function has been used for it, and a threshold function for the interview score, being subjective.
The method compares the three candidates pairwise, calculates the preference degree on each criterion, and finds the net flows. Suppose the candidate with the highest past success also scores lowest on the team-fit interview, yet still comes first in net flow, because the weight on past success exceeds the combined weight of the other two criteria. The candidate with the highest player-development score comes second, and the candidate who did best in interview comes third.
The board hesitates here: the risk that a coach who scores low on team fit will cause problems in the dressing room does not show up in the net flow, because this criterion carries a low weight. The board should not decide without raising this weight and recalculating. Furthermore, the threshold value in the interview score's threshold preference function, that is, which score gap counts as "significant," can change the result, and this choice must be justified in the report.
In the report: "With the high weight given to past success, the most successful candidate comes out clearly ahead; because the weight on team fit is kept low, this criterion's share is limited, and the ranking could change if that weight were raised."
3. Disaster management: A provincial disaster coordination centre's choice of temporary shelter site
A provincial disaster and emergency coordination centre must choose among three candidate sites for post-earthquake temporary shelter. Four criteria apply: capacity (the number of people who can be housed), distance to the city centre, a ground-stability score, and an infrastructure (water and electricity) access score. Capacity, ground stability and infrastructure access are "higher is better"; distance is "lower is better." The centre has given the highest weight to ground stability and used a threshold preference function on every criterion.
The method compares the three sites. Suppose the site with the highest capacity is also the site furthest from the city centre, and it still comes second in net flow. The site with the highest ground stability, despite middling capacity, comes first.
The centre hesitates here: the threshold on the distance criterion, that is, which kilometre gap counts as "significant," directly affects emergency-response time. If the threshold is set low, the advantage of a distant but stable-ground site could weaken. This shows that choosing the threshold is itself a crisis-management decision, and one that can change the result.
In the report: "With the weight given to ground stability, the site with the most stable ground comes out clearly ahead; how robust this advantage is in terms of emergency-response time should be separately tested if the distance threshold is changed."
4. What Not to Do
Had the experience criterion in the same candidate table been mistakenly marked "lower is better," the least experienced candidate would have been treated as advantaged on this criterion, and the result would become meaningless through a direction error. A second error is adding a fourth candidate once the analysis is finished and being surprised the ranking changes (rank reversal); the alternative set must be fixed before the analysis. A third error is reporting A2's net flow of 0.33 as "33 per cent better"; the net flow only ranks these three candidates relative to one another, and is neither a percentage nor a probability.
Extensions: for different data types
PROMETHEE has 17 extensions in the library. Same decision logic, different data type: if your data is not a classical number, read the relevant data type card, then open that member.
Classical5
- PROMETHEE I - Preference Ranking Organisation METHod for Enrichment Evaluations I (partial ranking)Academy card →
- PROMETHEE II - Preference Ranking Organisation Method for Enrichment of Evaluations II1985 ↗
- PROMETHEE III - Preference Ranking Organisation METHod for Enrichment Evaluations III (interval ranking)Academy card →
- PROMETHEE V - PROMETHEE with Integer Programming ConstraintsAcademy card →
- PROMETHEE VI - Walking Weights SensitivityAcademy card →
Sources
For the formulas behind each step, the intermediate tables and citation formats, see the DecisionMind method page: decisionmind.app/library/promethee
Brans, J. P., & Vincke, Ph. (1985). A preference ranking organisation method (The PROMETHEE method for multiple criteria decision-making). Management Science, 31(6), 647–656. DOI: 10.1287/mnsc.31.6.647
Brans, J. P., Vincke, P., & Mareschal, B. (1986). How to select and how to rank projects: The PROMETHEE method. European Journal of Operational Research, 24(2), 228–238. DOI: 10.1016/0377-2217(86)90044-5
Brans, J. P., & Mareschal, B. (2005). PROMETHEE methods. In Multiple Criteria Decision Analysis: State of the Art Surveys (International Series in Operations Research & Management Science, Vol. 78). Springer. DOI: 10.1007/0-387-23081-5_5
Mareschal, B., De Smet, Y., & Nemery, P. (2008). Rank reversal in the PROMETHEE II method: Some new results. 2008 IEEE International Conference on Industrial Engineering and Engineering Management, 959–963. DOI: 10.1109/ieem.2008.4738012
Behzadian, M., Kazemzadeh, R. B., Albadvi, A., & Aghdasi, M. (2010). PROMETHEE: A comprehensive literature review on methodologies and applications. European Journal of Operational Research, 200(1), 198–215. DOI: 10.1016/j.ejor.2009.01.021