A note on “An improved solution for the neutrosophic linear programming problems based on Mellin’s transform”

Abstract

Tamilarasi and Paulraj (Soft Comput (2022) 26:8497–8507), firstly, proposed a Mellin’s transform based ranking method for comparing single-valued triangular neutrosophic numbers. Then, using the proposed ranking method, Tamilarasi and Paulraj proposed an approach to solve neutrosophic linear programming problems. Tamilarasi and Paulraj pointed out that their proposed approach is better than Khatter’s approach (Soft Comput (2020) 24:16847-16867). In future, other researchers may use Tamilarasi and Paulraj’s approach to solve real-life neutrosophic linear programming problems. However, after a deep study of Tamilarasi and Paulraj’s approach, it is observed that a mathematical incorrect result, pointed out by Bhatia et al. (Soft Comput (2022) 26:8479–8495) in Khatter’s approach, is also considered in Tamilarasi and Paulraj’s approach. Hence, Tamilarasi and Paulraj’s approach is not valid. Also, it is observed that the ranking method, proposed by Tamilarasi and Paulraj, is not valid. In this note, these observations are discussed in details. Furthermore, it is suggested to use Bhatia et al.’s approach to solve real-life neutrosophic linear programming problems.