An Intelligent Dual Simplex Method to Solve Triangular Neutrosophic Linear Fractional Programming Problem

Abstract

This paper develops a general form of neutrosophic linear fractional programming (NLFP) problem and proposed a novel model to solve it. In this method the NLFP problem is decomposed into two neutrosophic linear programming (NLP) problem. Furthermore, the problem has been solved by combination of dual simplex method and a special ranking function. In addition, the model is compared with an existing method. An illustrative example is shown for better understanding of the proposed method. The results show that the method is computationally very simple and comprehensible.

Keywords

• triangular neutrosophic numbers
• dual simplex method
• ranking function
• linear fractional programming
• linear programming