Optimisation by dual simplex approach in neutrosophic environment
by Tuhin Bera; Nirmal Kumar Mahapatra
International Journal of Fuzzy Computation and Modelling (IJFCM), Vol. 2, No. 4, 2019

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.

Online publication date: Wed, 26-Jun-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Fuzzy Computation and Modelling (IJFCM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com