DC FieldValueLanguage
dc.contributor.authorStanojević, Bogdanaen_US
dc.date.accessioned2022-04-27T09:27:59Z-
dc.date.available2022-04-27T09:27:59Z-
dc.date.issued2022-01-01-
dc.identifier.issn1432-7643-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/4786-
dc.description.abstractIn this paper, we propose a solution approach to solving full fuzzy multiple objective linear fractional problems based on Zadeh’s extension principle. We adopt the idea of using triangular fuzzy numbers for the coefficients of the original problem and derive the shapes of the fuzzy variables with respect to the extension principle. The solution concept built in the novel approach strictly follows the basic arithmetic of fuzzy numbers, and the developed methodology contributes to correcting some inconsistencies in an existing approach from the recent literature. The solution we propose to the original problem is constructed out of the non-dominated points of crisp multiple objective linear fractional problems formed with feasible values of the fuzzy coefficients. The membership degree of each identified non-dominated point is computed with respect to the membership degrees of the coefficients involved. Our empirical results confirm and clearly illustrate the theoretical foundationsen_US
dc.relation.ispartofSoft Computingen_US
dc.subjectFull fuzzy multiple objective optimization | Linear fractional programming | Triangular fuzzy numbersen_US
dc.titleExtension principle-based solution approach to full fuzzy multi-objective linear fractional programmingen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/s00500-022-06884-5-
dc.identifier.scopus2-s2.0-85125421922-
dc.contributor.affiliationComputer Scienceen_US
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.description.rank~M22-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
crisitem.author.orcid0000-0003-4524-5354-

#### SCOPUSTM Citations

4
checked on Jun 11, 2024

#### Page view(s)

32
checked on May 9, 2024