On solving linear programming problem by duality approach in neutrosophic environment Online publication date: Fri, 12-Mar-2021
by Tuhin Bera; Nirmal Kumar Mahapatra
International Journal of Mathematics in Operational Research (IJMOR), Vol. 18, No. 3, 2021
Abstract: This paper extends the concept of crisp linear programming problem (lpp) by adopting the coefficients in objective function, technical coefficients, the right hand side coefficients and the decision variables as single valued triangular neutrosophic numbers (Sυtrn number). It is a special type of neutrosophic set. This modified concept is here called neutrosophic linear programming problem (Nlp problem). To develop this notion, a linear ranking function is newly constructed from geometrical concept first. Then the validity of existing crisp results are tested with the help of that ranking function in this new arena. An attempt is also taken to solve an Nlp problem by duality approach. For that, an efficient solution algorithm is developed by obeying the properties of ranking function. Finally, this proposed algorithm is demonstrated to solve a real life problem and some special cases are also illustrated by numerical examples.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook