A novel approach to solve gaussian valued neutrosophic shortest path problems

Abstract

We have exhibited a novel method for finding the neutrosophic shortest path problem (NSSPP) consid-ering 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 introduced 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 problems to find the shortest path which can help in taking crucial uncertain decisions. Finally, some numerical considerations are provided to show the effectiveness of the proposed model.