2020
DOI: 10.35378/gujs.689125
|View full text |Cite
|
Sign up to set email alerts
|

A New Method for Solving Interval Neutrosophic Linear Programming Problems

Abstract: Highlights• Present a technique to convert every Interval Neutrosophic problem into the crisp model.• A powerful tool for dealing with indeterminate and inconsistent information.• A technique for solving and optimizing the problems based on uncertainty.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
8
1

Relationship

2
7

Authors

Journals

citations
Cited by 12 publications
(4 citation statements)
references
References 15 publications
0
4
0
Order By: Relevance
“…Adopting a suitable threshold and score function are other factors that must be considered. Despite shortcomings in score function N in the ranking of neutrosophic triplets in certain cases discussed by Nafei et al in [29], the results obtained in this research indicate that the use of score function N reduces the computational complexity. So, the introduced algorithm using score function N reaches the final order after only one iteration.…”
Section: The Implemented Strategy Order Of Alternatives Number Of Ite...mentioning
confidence: 53%
“…Adopting a suitable threshold and score function are other factors that must be considered. Despite shortcomings in score function N in the ranking of neutrosophic triplets in certain cases discussed by Nafei et al in [29], the results obtained in this research indicate that the use of score function N reduces the computational complexity. So, the introduced algorithm using score function N reaches the final order after only one iteration.…”
Section: The Implemented Strategy Order Of Alternatives Number Of Ite...mentioning
confidence: 53%
“…Abdel-Baset et al [27] introduced the concept of integer programming in an environment of Neutrosophy by assuming that the problem's coefficients are triangular Neutrosophic numbers, and also introduced the Neutrosophic cutting plane algorithm and the Neutrosophic branch and bound algorithm. A new score function was used by Nafei and Nasseri [28] to turn the Neutrosophic integer programming problem into a crisp model, which was then solved using the branch and bound algorithm.…”
Section: Integer Programming (Ip) Is An Optimization Problem That Put...mentioning
confidence: 99%
“…Definition 1 ( [22,27]). A neutrosophic set (NS) N in a domain X(finite universe of objectives) can be represented by…”
Section: Preliminariesmentioning
confidence: 99%