A compromise solution for the neutrosophic multi-objective linear programming problem and its application in transportation problem

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Hosseinzadeh Elham; Tayyebi Javad

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF APPLIED RESEARCH ON INDUSTRIAL ENGINEERING Year:2023 | Volume:10 | Issue:1 Page(s): 1-10

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

A compromise solution for the neutrosophic multi-objective linear programming problem and its application in transportation problem

Author(s)

Hosseinzadeh Elham | Tayyebi Javad | Issue Writer Certificate

Keywords

Multiobjective programming problem

neutrosophic set

single-valued trapezoidal neutrosophic number

indeterminacy membership functions

Abstract

Neutrosophic set theory plays an important role in dealing with the impreciseness and inconsistency in data encountered in solving real-life problems. The current paper focuses on the neutrosophic fuzzy multiobjective linear programming problem (NFMOLPP), where the coefficients of the objective functions, constraints, and right-hand side parameters are single-valued trapezoidal neutrosophic numbers (NNs). From the viewpoint of complexity of the problem, a ranking function of NNs is proposed to convert the problem into equivalent MOLPPs with crisp parameters. Then suitable membership functions for each objective are formulated using their lowest and highest value. With the aim of linear programming techniques, a compromise optimal solution of NFMOLPP is obtained. The main advantage of the proposed approach is that it obtains a compromise solution by optimizing truth-membership, indeterminacy-membership, and falsity-membership functions, simultaneously. Finally, a transportation problem is introduced as an application to illustrate the utility and practicality of the approach.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans