Finding the optimal flow of triangular neutrosophic maximal flow problems

Abstract

In solving real life maximal Network Flow Problems, we often face the state of uncertainty as well as hesitation due to various uncontrollable factors. To overcome these limitations, the neutrosophic approach is applied to this problem. in this paper, the triangular neutrosophic linear programming formulation of triangular neutrosophic maximal flow (TNMFP) problems are proposed and on the basis of the proposed formulation a method is proposed to find the optimal solution of triangular neutrosophic maximal flow problems. In the proposed method all the parameters are represented by triangular neutrosophic numbers. By using the proposed method, the optimal solution of triangular neutrosophic maximal flow problems can be easily obtained by using ranking function. To illustrate the proposed method numerical examples are solved and the obtained results are discussed.