IDEAS home Printed from https://ideas.repec.org/a/wut/journl/v32y2022i3p1-15id1.html
   My bibliography  Save this article

Neutrosophic compromise programming approach for multiobjective nonlinear transportation problem with supply and demand following the exponential distribution

Author

Listed:
  • Ahmad Yusuf Adhami
  • Mohd Faizan
  • Anas M

Abstract

Decision-making is a tedious and complex process. In the present competitive scenario, any incorrect decision may excessively harm an organization. Therefore, the parameters involved in the decision-making process should be looked into carefully as they may not always be of a deterministic nature. In the present study, a multiobjective nonlinear transportation problem is formulated, wherein the parameters involved in the objective functions are assumed to be fuzzy and both supply and demand are stochastic. Supply and demand are assumed to follow the exponential distribution. After converting the problem into an equivalent deterministic form, the multiobjective problem is solved using a neutrosophic compromise programming approach. A comparative study indicates that the proposed approach provides the best compromise solution, which is significantly better than the one obtained using the fuzzy programming approach.

Suggested Citation

  • Ahmad Yusuf Adhami & Mohd Faizan & Anas M, 2022. "Neutrosophic compromise programming approach for multiobjective nonlinear transportation problem with supply and demand following the exponential distribution," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 32(3), pages 1-15.
    • Handle: RePEc:wut:journl:v:32:y:2022:i:3:p:1-15:id:1
    DOI: 10.37190/ord220301
    as

    Download full text from publisher

    File URL: https://ord.pwr.edu.pl/assets/papers_archive/ord2022vol32no3_1.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.37190/ord220301?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:wut:journl:v:32:y:2022:i:3:p:1-15:id:1. 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: Adam Kasperski (email available below). General contact details of provider: https://edirc.repec.org/data/iopwrpl.html .

    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.