2021
DOI: 10.1007/s00500-021-06559-7
|View full text |Cite
|
Sign up to set email alerts
|

Solution of matrix games with payoffs of single-valued trapezoidal neutrosophic numbers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 17 publications
(16 citation statements)
references
References 36 publications
0
16
0
Order By: Relevance
“…According to second comparing approach, to find an optimal solution of the SVTN MPP (P5) is equivalent to find an optimal solution of the crisp MPP (P9) and to find an optimal solution of the SVTN MPP (P6) is equivalent to find an optimal solution of the crisp MPP (P10). Seikh and Dutta (2022) shown that to find an optimal solution of (i) The interval MPPs (P7) and (P8) is equivalent to find an optimal solution of the CLPPs (P11) and (P12) respectively.…”
Section: Second Comparing Approachmentioning
confidence: 99%
See 2 more Smart Citations
“…According to second comparing approach, to find an optimal solution of the SVTN MPP (P5) is equivalent to find an optimal solution of the crisp MPP (P9) and to find an optimal solution of the SVTN MPP (P6) is equivalent to find an optimal solution of the crisp MPP (P10). Seikh and Dutta (2022) shown that to find an optimal solution of (i) The interval MPPs (P7) and (P8) is equivalent to find an optimal solution of the CLPPs (P11) and (P12) respectively.…”
Section: Second Comparing Approachmentioning
confidence: 99%
“…Brikaa (2022) pointed out that as Seikh and Dutta (2022) have considered a mathematically incorrect result to transform the interval MPP (P7) into the CLPP (P11) as well as to transform the interval MPP (P8) into the CLPP (P12). So, the crisp MPPs (P11) and (P12) are not equivalent to interval MPPs (P7) and (P8) respectively.…”
Section: /3mentioning
confidence: 99%
See 1 more Smart Citation
“…Benchmarks Applications Certain novel concepts of neutrosophic sets, neutrosophic logic, and neutrosophic probability were explored in [31]. Seikh and Dutta [32] developed a matrix games model based on SVNSs. Saha and Paul [33] proposed generalized weighted exponential similarity measures for SVNSs.…”
Section: Researchersmentioning
confidence: 99%
“…Furthermore, some researchers [15][16][17] also proposed trapezoidal or triangular neutrosophic number programming methods to solve single-objective or multiobjective linear programming problems in indeterminate environments. Certain researchers [18] further proposed a nonlinear programming model to perform matrix games in the setting of singlevalued neutrosophic numbers. However, these optimal crisp feasible solutions of decision variables and objective functions obtained in uncertain optimization/planning problems are not really meaningful complete solutions but are actually special solutions in uncertain problems.…”
Section: Introductionmentioning
confidence: 99%