DC FieldValueLanguage
dc.contributor.authorStanojević, Bogdanaen_US
dc.contributor.authorStanojević, Milanen_US
dc.date.accessioned2022-12-26T12:41:33Z-
dc.date.available2022-12-26T12:41:33Z-
dc.date.issued2023-
dc.identifier.isbn9783031186448-
dc.identifier.issn2367-3370-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/5004-
dc.description.abstractWe address the full fuzzy linear fractional programming problem with LR fuzzy numbers. Our goal is to revitalize a strict use of extension principle by employing it in all stages of our solution approach, thus deriving results that fully comply to it. Using the α -cuts of the coefficients we present the linear optimization models that empirically derive the α -cuts of the optimal objective fuzzy value, and discuss the optimization models able to derive the exact endpoints of the optimal objective values intervals. For initial maximization (minimization) problems the main issue is related to how to solve two stage min-max (max-min) problems to obtain the left (right) most endpoints. Our goals are as it follows: to obtain exact solutions to small-size problems; to obtain relevant information about solutions to large-scale problems that are in accordance to the extension principle; and to provide a procedure able to measure to which extent the solutions obtained by an approach to full fuzzy linear fractional programming comply to the extension principle. We illustrate the theoretical findings reporting numerical results, and including a relevant comparison to the results from the literature.en_US
dc.publisherSpringer Linken_US
dc.relation.ispartofseriesLecture Notes in Networks and Systemsen_US
dc.subjectExtension principle | Linear fractional programming | LR fuzzy numbersen_US
dc.titleFull Fuzzy Fractional Programming Based on the Extension Principleen_US
dc.typeConference Paperen_US
dc.relation.conferenceInternational Symposium SymOrg 2022: Sustainable Business Management and Digital Transformation: Challenges and Opportunities in the Post-COVID Eraen_US
dc.relation.publicationProceedingen_US
dc.identifier.doi10.1007/978-3-031-18645-5_4-
dc.identifier.scopus2-s2.0-85142722493-
dc.contributor.affiliationComputer Scienceen_US
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Artsen_US
dc.relation.firstpage43-
dc.relation.lastpage60-
dc.relation.volume562 LNNS-
dc.description.rankM33-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeConference Paper-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0003-4524-5354-
Show simple item record

Page view(s)

36
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.