Extension card · Grey
Grey MABAC
Grey MABAC is the form of MABAC that works with grey interval numbers. It is used when only the lower and upper bound of criterion values are known and no most-likely point in between can be given. It builds the border approximation area on the intervals, and again ranks the result with a single score.
Base method
MABAC →
Philosophy, mechanics, strengths and weaknesses are on the base method card; this card describes only the difference.
Data type (family)
Grey →
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?
Four things change; the border approximation area logic does not.
Cells. In crisp MABAC every cell is a single number. Here every cell is two numbers: a lower bound and an upper bound. No most-likely point is declared within them; every value between the bounds is treated as equally possible. Criterion weights remain crisp (single numbers) here; DecisionMind's Grey MABAC takes weights as crisp, not grey.
Scale equalisation. Crisp MABAC places every column into the 0–1 range according to its own smallest and largest value. Grey MABAC does this with Weitendorf's direction-sensitive two-branch normalisation. For a benefit criterion, the lower and upper bound are scaled up over the same denominator. For a cost criterion, the bounds swap places; the upper bound becomes the lower output and the lower bound becomes the upper output. This keeps the interval ordered. This method is the spread of crisp MABAC's linear min–max equalisation onto intervals.
Weighting and whitenisation. 1 is added to each bound, then it is multiplied by the criterion's (crisp) weight. This comes from the same technical necessity as the "+1" shift in crisp MABAC; the geometric mean in the next step cannot work with zero or negative numbers. The lower and upper bound are then averaged, reducing the interval to a single number (whitenisation). The border approximation area and the distance are computed from this single number.
Border approximation area and distance. The border is the geometric mean of the whitenised values. This is the same formula as the border definition in crisp MABAC; only the input is now the average of an interval. The distance, too, is a simple difference as in crisp MABAC (value minus border). The grey number undergoes no interval operation here; it proceeds through a single whitenised number.
Result and defuzzification. Defuzzification, that is, whitenisation, is done immediately after the scale-equalisation step, right after weighting finishes. This is the step closest to crisp MABAC. DecisionMind holds this early whitenisation and the (lower+upper)/2 averaging rule fixed. A different whitenisation rule (taking only the upper bound, for instance) can produce a different ranking.
How to Read the Output
The score is read the same way as in crisp MABAC. A positive score means "above the border," a negative score means "below the border"; this reading is valid only within this set of alternatives. But here the unknown inside the bounds, that is, the absence of a most-likely point, is closed off at an early stage by averaging. If the score difference between two alternatives is small, this difference is sensitive to the width of the bounds (how little is known).
Thus instead of writing:
"Grey MABAC still gave a precise ranking even with little data"
the report should read:
"The bounds were entered as intervals and reduced to a single number by whitenisation; A2 is furthest above the border, and the order between A1 and A3 can change if a single criterion's interval widens"
When to Prefer This over the Base Method
Use this when only a lower and upper bound are known about a criterion, and no most-likely point can be asserted in between. A typical case is an estimate for a new alternative with little data, for which one can say "at least this much, at most that much" but not "most likely."
If the value is a single measured figure, the base method should be kept. Adding an artificial lower-upper bound to a measured value is not modelling uncertainty, it is manufacturing it. If the table is mixed, DecisionMind requires a single data type; a measured criterion is then also written into an interval, with the lower bound equal to the upper bound. This adds no information, it merely conforms to the format. The exit point is the same as crisp MABAC. This extension, too, is compensatory; if a criterion allows no compromise, the ELECTRE family should be considered.
Mistakes Specific to This Extension
Using the midpoint of the interval as a most-likely value. A grey number does not carry this information; reporting the midpoint as an "expected value" assumes data that does not exist.
Whitenising while entering the data rather than at the very end. Averaging the bounds first and then running crisp MABAC is not Grey MABAC; the width of the bounds never enters the calculation at all, and score differences are exaggerated.
Entering a lower bound greater than the upper bound. A direction mix-up corrupts normalisation from the start; this is seen most often on a cost criterion when the bound swap is forgotten. A check that lower ≤ upper in every cell should be made before entering the data.
The "more advanced, therefore better" fallacy. Grey MABAC does not produce a "more correct" ranking than crisp MABAC; it is only a more honest representation when the input comes with little information (only bounds).
The governing principle is this:
Grey MABAC exists so that, when only bounds are available, nothing beyond them (a most-likely point, a distribution) is invented; averaging the bounds early, or declaring the midpoint most likely, erases the extension's one contribution.
Cases
The first case is DecisionMind's verification example. It comes not from a published paper but from a synthetic 3×3 grey-interval table built so the formulas can be traced by hand. It is stamped `SYNTHETIC_VERIFIED` in the manifest. The second case is an illustrative fiction.
1. Illustrative example: Three bids assessed by bound estimates on three criteria (DecisionMind verification example)
A board is comparing three bids (A1, A2, A3) on three criteria. The first two criteria are "more is better" performance ratios; the third is a "less is better" cost ratio. No bid has a stated most-likely value; only the lower and upper bound of each cell is known.
| Bid | C1 (more is better) | C2 (more is better) | C3 (less is better) |
|---|---|---|---|
| A1 | ⊗[0.65; 0.75] | ⊗[0.45; 0.55] | ⊗[0.55; 0.65] |
| A2 | ⊗[0.75; 0.85] | ⊗[0.55; 0.65] | ⊗[0.35; 0.45] |
| A3 | ⊗[0.55; 0.65] | ⊗[0.65; 0.75] | ⊗[0.45; 0.55] |
| Weight | 0.40 | 0.35 | 0.25 |
The method equalises the three criteria with the direction-sensitive Weitendorf normalisation, weights them, and whitenises. It then builds the border approximation area (geometric mean) for each criterion and sums each bid's distance to this border.
| Bid | Score | Rank |
|---|---|---|
| A2 | 0.242 | 1 |
| A3 | 0.008 | 2 |
| A1 | -0.175 | 3 |
According to the result, A2 is clearly above the border because it holds both the highest bounds and the lowest cost bounds on C1, the heaviest criterion (weight 0.40). The gap between A3 and A1 (0.183) is smaller than A2's and rests on A3's advantage on C2.
The board's hesitation is this. What if A1's C2 (second criterion) bounds had been the same as A3's (⊗[0.65; 0.75])? Recomputed independently, A1 rises to a score of -0.002, overtakes A3 (-0.052) and moves to second place; A2 (0.123) remains first. This shows that the order between A1 and A3 is sensitive to a bound change on a single criterion, while A2's lead remains solid.
In the report: "Criterion values were entered only as lower-upper bounds and reduced to a single number by whitenisation. A2 is furthest above the border with a score of 0.242; the second-place order between A1 and A3 changes if A1's bound on the second criterion is raised."
Source: DecisionMind's Grey MABAC verification example; a synthetic 3×3 grey-interval fixture, verified by an independent Python recomputation of the manifest's steps (A2 > A3 > A1). No Grey MABAC example traceable by page number is shared in the common literature. Pamučar and Ćirović's 2015 paper is the source of crisp MABAC, not a source for the grey extension itself. DecisionMind therefore uses its own verification table.
2. Tourism: Choosing a hotel region for a new season
A tour operator will set investment priority among three new regions for which booking data has not yet accumulated, before the new season begins. Criteria: expected occupancy rate and expected guest satisfaction rate ("more is better"), expected operating cost rate ("less is better"). The operator takes the lowest and highest performance of similar past regions as bounds for these rates; it gives no "most-likely" value, because the new region has no track record.
The method brings the three regions to a common scale, weights and whitenises them, builds the border approximation area, and computes each region's distance to this border. Suppose the region with the widest occupancy interval also carries the widest cost interval and ends up slightly above the border overall; the region with medium occupancy but a narrow cost interval comes second.
The operator has a hesitation. If the upper end of the first region's cost bound, that is, the most pessimistic scenario, materialises, the small gap with the second region could close. The operator should not commit to a large investment before booking data becomes clear, and should watch the two regions for one more season.
In the report: "With the current bound estimates, the region that stands out on occupancy and satisfaction holds the strongest position by the border approximation area. However, if the upper end of this region's cost bound materialises, the gap with the second region becomes negligible."
3. What Not to Do
The first error is averaging the illustrative example's intervals from the start (turning A1's C1 into, say, 0.70) and running crisp MABAC. The ranking often comes out the same, but the 0.183 gap between A1 and A3 turns into a single crisp-number difference with the bound width never visible, and the report claims a precision that does not exist. The second error is entering a lower bound greater than the upper bound in a cell; this happens most often on the cost criterion when the bound swap is forgotten. In this case normalisation silently produces the wrong result. The third error is presenting the border approximation area as "the best bid's performance"; the border is the geometric mean of the three bids, not the value of the best one.
Sources
For the formulas behind each step, the intermediate tables and citation formats, see the DecisionMind method page: decisionmind.app/library/grey-mabac
Pamučar, D., & Ćirović, G. (2015). The selection of transport and handling resources in logistics centers using Multi-Attributive Border Approximation area Comparison (MABAC). Expert Systems with Applications, 42(6), 3016–3028. DOI: 10.1016/j.eswa.2014.11.057
Deng, J. L. (1982). Control problems of grey systems. Systems & Control Letters, 1(5), 288–294. DOI: 10.1016/S0167-6911(82)80025-X
Deng, J. L. (1989). Introduction to grey system theory. The Journal of Grey System, 1(1), 1–24. (no DOI)
Torkayesh, A. E., Tirkolaee, E. B., Bahrini, A., Pamucar, D., & Khakbaz, A. (2022). A Systematic Literature Review of MABAC Method and Applications: An Outlook for Sustainability and Circularity. Informatica, 34(4), 899–929. DOI: 10.15388/23-INFOR511