IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v18y2021i3p310-335.html
   My bibliography  Save this article

On solving linear programming problem by duality approach in neutrosophic environment

Author

Listed:
  • Tuhin Bera
  • Nirmal Kumar Mahapatra

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.

Suggested Citation

  • Tuhin Bera & Nirmal Kumar Mahapatra, 2021. "On solving linear programming problem by duality approach in neutrosophic environment," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 18(3), pages 310-335.
    • Handle: RePEc:ids:ijmore:v:18:y:2021:i:3:p:310-335
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=113576
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijmore:v:18:y:2021:i:3:p:310-335. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=320 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.