Authors: Stanojević, Bogdana 
Stanojević, Milan
Affiliations: Computer Science 
Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Full Fuzzy Fractional Programming Based on the Extension Principle
Series/Report no.: Lecture Notes in Networks and Systems
Volume: 562 LNNS
First page: 43
Last page: 60
Related Publication(s): Proceeding
Conference: International Symposium SymOrg 2022: Sustainable Business Management and Digital Transformation: Challenges and Opportunities in the Post-COVID Era
Issue Date: 2023
Rank: M33
ISBN: 9783031186448
ISSN: 2367-3370
DOI: 10.1007/978-3-031-18645-5_4
Abstract: 
We 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.
Keywords: Extension principle | Linear fractional programming | LR fuzzy numbers
Publisher: Springer Link

Show full item record

Page view(s)

36
checked on Apr 24, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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