On solving linear programming problem by duality approach in neutrosophic environment

Tuhin Bera and Nirmal Kumar Mahapatra

International Journal of Mathematics in Operational Research, 2021, vol. 18, issue 3, 310-335

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 (N_lp 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 N_lp 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.

Keywords: neutrosophic set; single valued triangular neutrosophic number; neutrosophic linear programming problem; duality. (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=113576 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:18:y:2021:i:3:p:310-335

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().