Optimisation by dual simplex approach in neutrosophic environment

In the present study, the coefficients of the objective function, technical coefficients, the right hand side coefficients and the decision variables in a crisp linear programming problem are considered as single valued neutrosophic numbers. Such type of linear programming problem is hereafter called a neutrosophic linear programming problem. The basic goal of this paper is to solve a neutrosophic linear programming problem by applying dual simplex method following the sense in crisp environment. In order to that, some necessary results are brought first and then an algorithm is developed. Finally, a classical problem has been solved to measure the efficiency of the proposed algorithm.