Extension card · Neutrosophic
Neutrosophic MABAC (Peng & Dai, 2018)
N-MABAC adapts MABAC to work with single-valued neutrosophic numbers for situations where criteria are assessed independently by degrees of truth, indeterminacy and falsity. It builds the border approximation area from these three components and ranks the result once again 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)
Neutrosophic →
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 idea does not.
Cells. In crisp MABAC every cell is a single number. Here every cell is three numbers: truth (T), indeterminacy (I) and falsity (F). The three come from separate sources, and their sum is not forced to 1; the total can be anywhere between 0 and 3. Criterion weights remain crisp (single numbers) here; DecisionMind's N-MABAC takes weights as crisp, not neutrosophic.
Scale equalisation. Crisp MABAC places every column between 0 and 1 by min–max normalisation. N-MABAC instead first reduces every neutrosophic triple to a single number with a score function: S = (1+T-2I-F)/2. This step corresponds to crisp MABAC's normalisation step, a "reduction to one dimension." The three independent components become, through this score, a single number on which scale equalisation can then be performed.
Weighting and the border. The scored value is multiplied by the criterion's crisp weight. The border approximation area is the geometric mean of the weighted neutrosophic values. This is the neutrosophic-algebra counterpart of crisp MABAC's border definition. The distance is the difference between the score of the weighted value and the score of the border.
Result and defuzzification. Defuzzification, that is, the score function, happens at the very start of the calculation, in the scale-equalisation step. This step is the closest point to crisp MABAC. DecisionMind keeps this score function and its order fixed: the score is computed first, and normalisation and weighting follow. A different score function, for example one using only T-F, could produce a different ranking.
How to Read the Output
The score's sign is read as in crisp MABAC: positive means "above the border," negative "below the border." The difference is here: underneath this score, three independent components, favourable evidence, the unknown, and unfavourable evidence, have dissolved into a single score. If the gap between two alternatives is small, this gap is sensitive to which component, especially the indeterminacy share, has changed.
Thus instead of writing:
"N-MABAC measured the alternative's true accuracy"
the report should read:
"The degrees of truth, indeterminacy and falsity have been combined into a score, and the distance to the border approximation area has been computed on this score; A3 sits furthest above the border, and the order between A1 and A2 can change if a criterion's indeterminacy share changes"
When to Prefer This over the Base Method
When information about the criteria is incomplete, inconsistent or contradictory, and this matters for the decision itself, this extension is used instead of the base method. That is, N-MABAC applies when favourable evidence, unfavourable evidence and an unknown share need to be recorded separately.
If criteria are measured, or come as a single judgement from a reliable source, the base method should be kept. Expanding such a value into three independent components, particularly inventing an indeterminacy share, is not modelling uncertainty but manufacturing it. If the table is mixed, DecisionMind requires a single data type; a measured criterion is also written as neutrosophic, using the honest embedding (t, 0, 1−t). This embedding adds no information; it only conforms to the format. The exit condition is the same as for crisp MABAC. This extension is also compensatory; if no compromise is acceptable on one criterion, the ELECTRE family should be considered instead.
Mistakes Specific to This Extension
Entering T+I+F>3. If the definitional constraint of the single-valued neutrosophic number is violated, that is, if the sum of the three components exceeds 3, the calculation becomes invalid. Every cell must therefore be checked before entry.
Computing indeterminacy as 1−T−F. This reduces the three components to a dependent triple and removes the rationale for using neutrosophic data; I must come from its own source (missing or conflicting information).
Scoring first and then claiming to have "done a neutrosophic calculation." The score function is only part of the scale-equalisation step; the border approximation area and the distance still proceed through neutrosophic operations (weighted multiplication, geometric mean). Reducing the data to a score at the outset and running crisp MABAC gives a different, usually cruder, result.
The "more advanced" fallacy. N-MABAC does not produce a more "correct" ranking than crisp MABAC; it is simply a more honest representation when the evidence is genuinely contradictory or incomplete.
The governing principle is this:
The three components in N-MABAC must rest on separate sources and must not be derived from one another; any practice that breaks this (T+I+F>3, I=1−T−F, premature scoring) destroys the method's one contribution.
Cases
The first case is DecisionMind's validation example. Peng and Dai's (2018) paper is the founding source for single-valued neutrosophic MABAC. However, the paper sits behind Springer's closed archive, and neither its decision matrix nor a page number could be extracted from it. The first case is therefore drawn from a synthetic 3×3 table built so that the manifest's F1–F8 formulas can be followed by hand. The second case is an illustrative construction.
1. Illustrative example: Three proposals assessed on three criteria (DecisionMind validation example)
An assessment board examines three proposals, A1, A2 and A3, on three criteria. Every criterion has been converted into a judgement of the form "this proposal satisfies this criterion"; the degrees of truth, indeterminacy and falsity are drawn from separate sources, namely supporting evidence, missing information and opposing evidence. All three criteria are "higher is better."
| Proposal | C1 | C2 | C3 |
|---|---|---|---|
| A1 | (0.70; 0.20; 0.10) | (0.60; 0.30; 0.20) | (0.50; 0.40; 0.30) |
| A2 | (0.50; 0.30; 0.40) | (0.70; 0.20; 0.20) | (0.60; 0.30; 0.30) |
| A3 | (0.80; 0.10; 0.20) | (0.50; 0.40; 0.30) | (0.70; 0.30; 0.20) |
| Weight | 0.40 | 0.30 | 0.30 |
The method reduces every triple to a single number with S = (1+T-2I-F)/2. Then it weights this, builds the border approximation area (geometric mean) for each criterion, and sums each proposal's distance to this border.
| Proposal | Score | Rank |
|---|---|---|
| A3 | 0.168 | 1 |
| A1 | 0.027 | 2 |
| A2 | -0.083 | 3 |
The result reads as follows: A3 has the highest truth and lowest indeterminacy on C1. Because this criterion also carries the highest weight, A3 comes out furthest above the border. The gap between A1 and A2 (0.11) is smaller than A3's lead, and stems from A2's weak truth-high falsity combination on C1.
A question occurs to the board: what if A1's assessment on C3, the third criterion, rose to the same truth-indeterminacy level as A3's, (0.70; 0.20; 0.20)? Recomputed independently, A1 rises to a score of 0.186 and moves to first place; A3 falls back to 0.087 and drops to second, while A2 stays third at −0.164. This shows that the lead between A1 and A3 can shift once the indeterminacy share on a single criterion changes. Because the border approximation area rests on all proposals' average, a change in a single cell also shifts the criterion's border.
In the report: "The truth-indeterminacy-falsity triples were reduced to a single number with a score function, and the distance to the border approximation area was computed on this score. A3 sits furthest above the border with 0.168; if A1's indeterminacy share on the third criterion falls, A1 overtakes A3 and moves to first place."
Source: DecisionMind's validation example for N-MABAC; a synthetic 3×3 SVN fixture, verified by independently recomputing the manifest's F1–F8 steps in Python (A3 > A1 > A2). Peng and Dai's (2018) paper is the formula source for the method but is behind a closed archive; the paper's own decision matrix is not carried into this card (see the approval notes).
2. Law: A law firm prioritising three case files
A law firm must decide how to allocate its limited resources among three case files. For each file, the judgement "this case will be decided favourably" is assessed from three separate sources. Precedent and the strength of evidence feed truth; unresolved witness statements and a delayed expert report feed indeterminacy; the opposing side's strong points of defence feed falsity. Three criteria, strength of evidence, alignment with precedent and compensation potential, are all "higher is better."
The method scores the three files, weights them, builds the border approximation area, and computes each file's distance to this border. Suppose the file with the highest compensation potential, because its expert report is still pending, also carries the highest indeterminacy and ends up slightly below the border overall. The file with strong evidence but moderate compensation potential comes first instead.
The firm faces a similar question: if the expert report is completed and the indeterminacy share on the compensation-potential criterion falls, this file could move ahead. The firm should not finalise its resource allocation before the report arrives; it should either wait and recompute, or allocate limited resources to both files.
In the report: "On current evidence, the file with strong evidence takes priority under the border approximation area; if the indeterminacy share on the compensation-potential criterion falls once the expert report is complete, the other file could move ahead."
3. What Not to Do
The first mistake in the illustrative example is to let T+I+F exceed 3 for a criterion. Writing, for instance, A2's C1 as (0.90; 0.50; 0.60) violates the definitional constraint and invalidates the calculation.
The second mistake is to compute indeterminacy as 1−T−F instead of deriving it from a separate source. For example, computing I for A1's C1 as 1−0.70−0.10=0.20, instead of genuinely measuring it from a source of missing information, falls into this trap. This makes the triple dependent and removes the rationale for using neutrosophic data.
The third mistake is to score the triples at the outset and skip the border approximation area and weighted geometric mean steps. That is, saying "A3's score is highest, so let's just pick A3" is not enough. This approach is not N-MABAC but a simple score ranking, and it renders the compensation between criteria invisible.
Sources
For the formulas behind each step, the intermediate tables and citation formats, see the DecisionMind method page: decisionmind.app/library/n-mabac
Peng, X., & Dai, J. (2018). Approaches to single-valued neutrosophic MADM based on MABAC, TOPSIS and new similarity measure with score function. Neural Computing and Applications, 29, 939–954. DOI: 10.1007/s00521-016-2607-y
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
Smarandache, F. (1998). Neutrosophy: Neutrosophic Probability, Set, and Logic. American Research Press, Rehoboth. (no DOI)
Wang, H., Smarandache, F., Zhang, Y., & Sunderraman, R. (2010). Single valued neutrosophic sets. Multispace and Multistructure, 4, 410–413. (no DOI)