Linear fractional programming based on triangular neutrosophic numbers

In this paper, a solution procedure is proposed to solve neutrosophic linear fractional programming problem (NLFP) where cost of the objective function, the resources and the technological coefficients are triangular neutrosophic numbers. Here, the NLFP problem is transformed into an equivalent crisp multi-objective linear fractional programming (MOLFP) problem. By using proposed approach, the transformed MOLFP problem is reduced to a single objective linear programming (LP) problem which can be solved easily by suitable linear programming technique. The proposed procedure illustrated through a numerical example.