Optimal Solution of Neutrosophic Linear Fractional Programming Problems With Mixed Constraints

Abstract In this paper, Linear Fractional Programming (LFP) problems have been extended to neutrosophic sets (NSs) and the operations and functionality of these laws are studied. Moreover, the new algorithm is based on aggregation ranking function and arithmetic operations of triangular neutrosophic sets (TNSs). Furthermore, for the first time, in this paper, we take up a problem where the constraints are both equality and inequality neutrosophic triangular fuzzy number. Lead from genuine issue, a few numerical models are considered to survey the legitimacy, profitability and materialness of our technique. At last, some numerical trials alongside one contextual analysis are given to show the novel techniques are better than the current strategies.