Extension card · Classical
PROMETHEE I (Brans, Vincke & Mareschal, 1986)
This is the form within the PROMETHEE family that keeps the incoming and outgoing flows separate rather than merging them into a single net flow, and honestly leaves some pairs of alternatives "incomparable." Its output is not a complete ranking but a partial dominance relation.
Base method
PROMETHEE →
Philosophy, mechanics, strengths and weaknesses are on the base method card; this card describes only the difference.
Data type (family)
Classical →
What this data type is, when to use it, how to write it in a cell: the family's full account is here.
What Changes from the Base Method?
One thing changes: how the flows are combined. The cells, the scale, the preference function and the weighting are identical to base PROMETHEE.
Result and defuzzification. Base PROMETHEE in DecisionMind subtracts the outgoing flow (φ⁻) from the incoming flow (φ⁺) to produce a single net flow (φ) and builds a complete ranking on this number. PROMETHEE I does not perform this final subtraction; it leaves φ⁺ and φ⁻ separate. The relation between two alternatives then takes one of three forms. If alternative A is both higher on φ⁺ and lower on φ⁻ than B (or equal on one and strictly better on the other), A dominates B (P). If both their φ⁺ and φ⁻ are equal, the two are indifferent (I). If φ⁺ favours one and φ⁻ favours the other, that is, one leaves most rivals behind while at the same time being left behind by several rivals, the two alternatives are declared incomparable (R) and are not positioned relative to each other in the ranking.
An important point: incomparability cannot be understood merely by looking at the direct pairwise preference index (π) between two alternatives. φ⁺ and φ⁻ reflect an alternative's average standing against EVERYONE IN THE SET; because of this, even if A beats B in a direct pairwise comparison, their relationships with a third alternative can make A's and B's total flows conflict, and the two can still turn out incomparable. The second case below demonstrates this with figures.
DecisionMind takes the choice of preference function, the threshold values (p, q, s) and the weights from the user in this extension; all of these are adjustable from the interface just as in crisp PROMETHEE. Only the output form of the fifth step changes.
How to Read the Output
The output is not a ranking but a table built from P (dominates), I (indifferent) and R (incomparable) relations between alternatives; these relations can be organised into layers (who strictly leaves whom behind), but more than one alternative can sit side by side within a layer. Unlike the net flow (PROMETHEE II), PROMETHEE I does not always answer the question "which is second, which is third"; for some pairs it says "I cannot say this with confidence given the information I have."
Thus instead of writing:
"According to PROMETHEE I, A is second and B is third"
when A and B come out incomparable, the report should read:
"For the pair A and B, φ⁺ and φ⁻ give conflicting signals; A leaves most rivals further behind, but is at the same time left behind by more rivals than B. The method cannot confidently establish dominance between these two alternatives with the information it has; the choice between them should be made on another criterion (such as cost or risk appetite)"
When to Prefer This over the Base Method
Use this when the decision needs to be a genuine, honest partial relation rather than a strict complete ranking, that is, when leaving some pairs "incomparable" is acceptable, or even preferred. This is particularly valuable when the decision maker wants to see a conflict that the net flow might conceal: two alternatives can come out close on the net flow, but PROMETHEE I distinguishes whether this is "genuinely close" or "actually incomparable."
If a complete ranking is required, that is, if every alternative must be placed somewhere, base PROMETHEE (net flow, PROMETHEE II logic) should be used; PROMETHEE I gives an incomplete answer in that case. Crisp PROMETHEE's exit conditions apply here too: once the number of alternatives exceeds fifty, the pairwise-comparison burden grows large.
Mistakes Specific to This Extension
Forcing incomparable pairs into a ranking. A decision maker who says "but I need a ranking" and turns an R relation into I (indifferent) or an arbitrary P direction destroys the method's most honest contribution, namely leaving the unknown as unknown. If a ranking is required, PROMETHEE II should be used.
Trying to read incomparability directly from the pairwise preference index (π). As shown above, even if A beats B directly with π(A,B) > π(B,A), the total φ⁺/φ⁻ flows can come out conflicting and render the two incomparable. Incomparability is read only from φ⁺ and φ⁻.
Mistaking the layer order for a complete ranking. If more than one alternative appears within a layer, this does not mean those alternatives are equal; it means they are either incomparable with each other or indifferent. Ranking within a layer requires additional information (for instance, the net flow).
Leaving the preference function and thresholds at their defaults without ever questioning them. This is the general error of crisp PROMETHEE and applies here too: changing a threshold can change both the ranking and which pairs come out incomparable.
The governing principle is this:
PROMETHEE I's contribution is to stay silent wherever it cannot confidently rank with the information it has; forcing this silence into a ranking removes the method's honesty.
Cases
The first case is DecisionMind's validation example; in this example no pair comes out incomparable, and a complete layer ordering results. The second case is an illustrative fiction and contains a genuine incomparable pair.
1. Illustrative example: Choosing a licence among three software vendors (DecisionMind validation example)
An organisation is to choose among three software vendors. There are three criteria: integration-speed score, support-quality score (both benefit criteria) and licence cost (a cost criterion). The weights are 0.4 / 0.35 / 0.25; the plain (usual) preference function is used on every criterion.
| Vendor | Integration speed | Support quality | Licence cost |
|---|---|---|---|
| A1 | 3 | 5 | 4 |
| A2 | 5 | 3 | 2 |
| A3 | 4 | 4 | 3 |
| Direction | benefit | benefit | cost |
| Weight | 0.4 | 0.35 | 0.25 |
The method checks, for every pairwise comparison, which vendor scores higher, computes the incoming flow (φ⁺) and the outgoing flow (φ⁻), then builds the P/I/R relation by leaving these two flows separate.
| Vendor | Φ+ (incoming) | Φ- (outgoing) | Relation |
|---|---|---|---|
| A2 | 0.65 | 0.35 | leaves everyone behind |
| A3 | 0.50 | 0.50 | behind A2, ahead of A1 |
| A1 | 0.35 | 0.65 | behind everyone |
The result reads as follows. A2 has the highest value on φ⁺ and the lowest on φ⁻; it strictly (P) leaves both A3 and A1 behind. A3 is behind A2 but ahead of A1. In this example no pair comes out incomparable: the layers [A2], [A3], [A1] form a complete ranking.
The organisation's hesitation: if the support-quality weight is made dominant and redistributed to 0.2/0.7/0.1 (computed by independently running the same algorithm in Python), the ranking is completely reversed: A1 (φ⁺ = 0.70) comes first, A3 sits in the middle, and A2 (φ⁺ = 0.30) comes third. This shows how strongly the difference between the three vendors depends on how much weight is given to which criterion.
In the report: "With the stated weights (0.4/0.35/0.25), A2 strictly leaves everyone behind, and no pair comes out incomparable in this example. When the weight is shifted to support quality, the ranking is completely reversed; the weight distribution should be separately justified by the organisation."
Source: This case is DecisionMind's validation example for the PROMETHEE I engine. The manifest's A1/A2/A3 and C1/C2/C3 values and the expected P/I/R relation were produced by this repository's own audit validator; they are not a table from Brans, Vincke and Mareschal's (1986) paper (the manifest states this explicitly). The figures for the weight-change scenario were independently recomputed by this card's author using the same algorithm.
2. Freight: A logistics network's choice of shipping company (contains an incomparable pair)
A logistics network is to decide which of three shipping companies to work with. There are three criteria: delivery-speed score (a benefit criterion), price score and damage-rate score (both cost criteria). The weights are distributed as 0.4 to delivery speed, 0.35 to price, 0.25 to damage rate; the plain preference function is used on every criterion.
| Company | Delivery speed | Price | Damage rate |
|---|---|---|---|
| X | 4 | 10 | 9 |
| Y | 3 | 6 | 10 |
| Z | 8 | 10 | 2 |
| Direction | benefit | cost | cost |
| Weight | 0.4 | 0.35 | 0.25 |
The method compares the three companies pairwise. In the direct pairwise comparison of X and Y, X beats Y 0.65 to 0.35: X is faster and has less damage, while Y is only cheaper on price.
| Company | Φ+ (incoming) | Φ- (outgoing) |
|---|---|---|
| Z | 0.65 | 0.175 |
| Y | 0.35 | 0.65 |
| X | 0.325 | 0.50 |
Z strictly leaves both X and Y behind, with both the highest φ⁺ and the lowest φ⁻. But when X and Y are compared: Y's φ⁺ (0.35) is higher than X's (0.325), while X's φ⁻ (0.50) is lower than Y's (0.65). The signals conflict: Y appears to "win" slightly more across the set as a whole, but X appears to "lose" less across the set as a whole. The method declares the two incomparable (R).
The network's hesitation: the impression that X beats Y in the direct pairwise comparison ("X is better than Y") disappears once their performance against Z is taken into account. Y stands slightly better than X against Z (its price advantage also applies against Z); this offsets X's direct superiority in the overall table. If the network must choose between X and Y, it should do so with the net flow (PROMETHEE II) or an additional criterion (such as contract flexibility); the method stays silent here.
In the report: "Z strictly leaves both companies behind, through its superiority in delivery speed and damage rate. Between companies X and Y, the incoming and outgoing flows give conflicting signals; the method declares the two incomparable, and the choice between them should be made on another criterion."
3. What Not to Do
In the second case, looking only at the direct pairwise preference index between X and Y (π(X,Y) = 0.65) and reporting "X is strictly better than Y" is wrong, because incomparability is determined from the total flows across the whole set (Z included), and here X and Y come out incomparable. The second error is turning an R relation into I by saying "the two are equal"; R and I are different things, R means "unknown," I means "the same." The third error is turning the list of layers ("Z," then "X and Y") into a complete ranking such as "Z first, X and Y tied for second"; the method makes no ranking claim whatsoever between X and Y.
Sources
For the formulas behind each step, the intermediate tables and citation formats, see the DecisionMind method page: decisionmind.app/library/promethee-i
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., & 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., & 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
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