An Efficient Enumeration Technique for a Transportation Problem in Neutrosophic Environment

In this paper, we have given a technique to solve transportation problems in a neutrosophic environment. The proposed technique gives solutions in the best possible and the worst possible manner. The concept is based on (α, β, γ) cut-sets of neutrosophic sets. It converts the problem into an interval-valued problem, which is further solved to give the best possible and the worst possible solution to the considered problem. Moreover, the technique proposed in this paper produces a direct optimal solution. The gained results ensure that the proposed method is better than the traditional ones as it is computationally much more efficient. The proposed technique has been suitably modified by varying (α, β, γ) according to the decision maker’s knowledge of supply and demand requirements. Numerical illustrations have been provided to demonstrate the methodology and to prove our claim on efficiency