Title: Optimisation by dual simplex approach in neutrosophic environment

Authors: Tuhin Bera; Nirmal Kumar Mahapatra

Addresses: Department of Mathematics, Boror S.S. High School, Bagnan, Howrah-711312, WB, India ' Department of Mathematics, Panskura Banamali College, Panskura RS-721152, WB, India

Abstract: 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.

Keywords: neutrosophic set; single valued neutrosophic number; neutrosophic linear programming problem; dual simplex method.

DOI: 10.1504/IJFCM.2019.100347

International Journal of Fuzzy Computation and Modelling, 2019 Vol.2 No.4, pp.334 - 352

Received: 16 Jul 2018
Accepted: 09 Jan 2019
Published online: 26 Jun 2019 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article