Extension card · Neutrosophic
Neutrosophic DNMA
N-DNMA is the form of DNMA used when criterion assessment is given by degrees of truth, indeterminacy and falsity. These three degrees are called a single-valued neutrosophic triple. The method first reduces every cell to a single score, then ranks alternatives with a single aggregation model that averages two normalisations of this score.
Base method
DNMA →
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?
Three things change. One of them affects crisp DNMA's defining structure.
Cells. In crisp DNMA every cell is a single number. Here every cell has three independent components: truth (T), indeterminacy (I), falsity (F). Each lies between 0 and 1, and their sum is not expected to equal 1. Criterion weights remain crisp, that is, single numbers.
Scale equalisation. The method first reduces the neutrosophic triple to a single score number. This score counts truth positively, twice the indeterminacy negatively, and falsity negatively. Crisp DNMA's three separate aggregation models (weighted sum, weighted product, closeness to the ideal) here collapse into a single model. Two normalisations are computed on this score: linear min–max normalisation and vector normalisation. Both use direction information here too; for a benefit criterion a large value is good, for a cost criterion a small value is good.
Score and combination. The two normalisations are averaged and collapse into a single table. This table is multiplied by the weights and summed, giving a single intermediate score. This intermediate score is then rescaled so that the smallest value becomes zero and the largest becomes one. The step that defines crisp DNMA is absent here: the combined score formula that jointly rewards the score and rank consistency of the three separate aggregation models. Structurally, N-DNMA resembles a doubly-normalised weighted sum method more than it resembles crisp DNMA.
Result. Defuzzification happens at the very start, through the score function. The output is a single number rescaled between 0 and 1. A larger value is better.
DecisionMind fixes, for this extension, the score function and the equally weighted average of the two normalisations. One further point should be noted: crisp DNMA's philosophical core is that three different aggregation logics corroborate one another. This core is absent in N-DNMA; the manifest records this extension as having no published literature source, an internal adaptation of DecisionMind's own. This difference is flagged as an open point for scientific review.
How to Read the Output
The output is a single number between 0 and 1, and a rank. It is not a percentage or a probability. It only shows a ranking relative to the other alternatives computed from the same triple inputs.
The difference is this. The score is built from the truth-indeterminacy-falsity triple after it has already been dissolved by a single score function at the very first step. If two alternatives' scores are very close, the difference may come from a small indeterminacy gap in the input data; the score itself does not distinguish this.
Thus instead of writing:
"By the N-DNMA score, A3 is the best alternative"
the report should read:
"A3 has received the highest score (1.0) once the truth-indeterminacy-falsity triples were combined by a single score function. The gap between A1 and A2 (0.036) is very small and is sensitive to a small change in Criterion 1's weight"
When to Prefer This over the Base Method
This extension is suitable when information about a criterion is incomplete, inconsistent or contradictory, and this matters for the decision itself. It is also used when assessing alternatives with no track record, or in expert opinions based on conflicting sources. Which situation calls for a neutrosophic structure is explained on the Neutrosophic data-type card.
Crisp DNMA's exit condition applies here too. If no compromise is acceptable on one criterion, this extension is not suitable.
Mistakes Specific to This Extension
Violating the value-domain constraint. T, I and F must each lie between 0 and 1, and their sum must not exceed 3. If this is violated, the score function and normalisation can produce invalid numbers.
Changing the score function without stating it. The canonical choice is truth, plus minus twice the indeterminacy, minus falsity, divided by two. A different score function can produce a different ranking.
Looking for three aggregation models in this extension. The idea from the crisp DNMA card, that "three models corroborate one another," is absent here. N-DNMA is a single, doubly-normalised model. Confusing the two presents the output as a stronger guarantee than it is.
A criterion column giving the same score for every alternative. In this case linear min–max normalisation becomes undefined, since its denominator approaches division by zero. Such a criterion should be reviewed.
The governing principle is this:
In N-DNMA, defuzzification happens at the very start, through the score function, and the remaining steps form a single, doubly-normalised model. Crisp DNMA's three-model guarantee does not carry over to this extension; this must be stated plainly in the report.
Cases
The first case is DecisionMind's validation fixture. There is no published, page-traceable example for N-DNMA in the literature; the manifest records this explicitly. In its place, a synthetic three-alternative, three-criterion neutrosophic matrix has been built, faithful to the manifest's steps. The engine's steps have been independently recomputed in Python. The second case is an illustrative construction.
1. Illustrative example: Three alternatives scored on three neutrosophic criteria
Three alternatives are assessed on three benefit criteria. Every cell carries a truth-indeterminacy-falsity triple.
| Alternative | Criterion 1 (T,I,F) | Criterion 2 (T,I,F) | Criterion 3 (T,I,F) |
|---|---|---|---|
| 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 |
| Direction | higher is better | higher is better | higher is better |
The method reduces every triple to a single score. It equalises this score separately by linear min-max and vector normalisation, averages the two, takes the weighted sum, and rescales the result between 0 and 1.
| Alternative | N-DNMA score | Rank |
|---|---|---|
| A3 | 1.000 | 1 |
| A1 | 0.036 | 2 |
| A2 | 0.000 | 3 |
The result reads as follows. A3 has the highest truth (0.80) and the lowest indeterminacy (0.10) on Criterion 1, the heaviest criterion; this advantage turns into a clear gap in the final score. The gap between A1 and A2, by contrast, is almost negligible, only 0.036. A1 is stronger on Criterion 1, A2 on Criterion 2, and at the raw-score level these two strengths come out very close to each other.
This closeness is fragile. If Criterion 1's weight is lowered from 0.40 to 0.395, a change of five thousandths, and the difference redistributed equally to Criteria 2 and 3, A1 and A2 swap places: A2 moves ahead. A3 remains first under every circumstance. This shows that the gap between second and third place is extremely fragile against the weights, while A3's lead is robust.
In the report: "The truth-indeterminacy-falsity triples were reduced to a single score and equalised by two normalisations. A3 is a clear first at 1.0. The second-third order between A1 and A2 is sensitive even to a five-thousandths change in Criterion 1's weight, and should be treated as practically undecided."
Source: DecisionMind's N-DNMA validation fixture. The manifest records that no published paper corresponds to this neutrosophic extension, and that it is DecisionMind's own internal adaptation. This table and its numbers are not taken from a paper's page. The engine's steps have been independently recomputed in Python for this card and match DecisionMind's recorded ranking (A3, A1, A2) and scores (A1: 0.0359; A2: 0.0; A3: 1.0) exactly.
2. Librarianship: A university library's choice of digital archive system
A university library will choose among three system proposals to digitise its thesis and periodical archive. Criteria are search performance and long-term data-preservation guarantee, both "higher is better." Two of the three suppliers are not yet used in Turkish university libraries; the library therefore assesses each criterion with a truth-indeterminacy-falsity triple. Supplier references and demo tests count as favourable evidence (T); the scarcity of installations at a comparable scale counts as indeterminacy (I); any known cases of data loss are collected separately as unfavourable evidence (F).
The method scores and ranks the three proposals. Suppose the result comes out as follows: the system with the highest search performance but the fewest comparable installations ranks first. The system with the best-documented data-preservation guarantee stays second.
The library's hesitation is this. The first-ranked system's indeterminacy component is high, because installations at a comparable scale are scarce. Before choosing this system, the library is considering an on-site visit to at least one reference installation to reduce this indeterminacy.
In the report: "The systems were assessed with truth-indeterminacy-falsity triples. The first system leads because of its search performance; because of the indeterminacy arising from the scarcity of comparable installations, an on-site reference visit is recommended."
3. What Not to Do
The first mistake in the illustrative example is to take only the T component of each triple and feed it into crisp DNMA, discarding I and F entirely; this throws away all indeterminacy information. The second mistake is to present the 0.036 gap between A1 and A2 as "A1 is clearly ahead"; as shown above, this gap is small enough to reverse with a weight change of only five thousandths. The third mistake is to describe N-DNMA as though it carried crisp DNMA's three-model guarantee; here there is a single, doubly-normalised model, not three separate aggregation logics.
Sources
For the formulas behind each step, the intermediate tables and citation formats, see the DecisionMind method page: decisionmind.app/library/n-dnma
Liao, H., & Wu, X. (2020). DNMA: A double normalization-based multiple aggregation method for multi-expert multi-criteria decision making. Omega, 94, 102058. DOI: 10.1016/j.omega.2019.04.001
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)
Ye, J. (2013). Multicriteria decision-making method using the correlation coefficient under single-valued neutrosophic environment. International Journal of General Systems, 42(4), 386–394. DOI: 10.1080/03081079.2012.761609