A Novel Approach to Solve Gaussian Valued Neutrosophic Shortest Path Problems
| Main Authors: | Ranjan Kumar, S A Edalatpana, Sripati Jha, Ramayan Singh |
|---|---|
| Format: | Article eJournal |
| Terbitan: |
, 2019
|
| Subjects: | |
| Online Access: |
https://zenodo.org/record/3047525 |
Daftar Isi:
- We have exhibited a novel method for finding the neutrosophic shortest path problem (NSSPP) considering Gaussian valued Neutrosophic number. We have used linear programming approach for finding the NSS- PP for Gaussian valued Neutrosophic number which is as per best of our information, hasn’t been used till date for any other research work. In this article, we have introdu- ced a novel method which deals Gaussian shaped neutro- sophic problem easily without using any ranking method. We have used this method to solve uncertain network pro-blems to find the shortest path which can help in taking crucial uncertain decisions. Finally, some numerical con- siderations are provided to show the effectiveness of the proposed model.