Loading…

An efficient algorithm for solving multilevel multi-objective linear fractional optimization problem with neutrosophic parameters

This work demonstrates the modeling of the multilevel-multiobjective linear fractional optimization (ML-MOLFO) problem in a neutrosophic decision environment. The primary driving force behind this work is to determine how to handle a ML-MOLFO problem while taking into account a real-life decision-ma...

Full description

Saved in:
Bibliographic Details
Published in:Expert systems with applications 2024-12, Vol.257, p.125122, Article 125122
Main Authors: Moges, Demmelash Mollalign, Wordofa, Berhanu Guta
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This work demonstrates the modeling of the multilevel-multiobjective linear fractional optimization (ML-MOLFO) problem in a neutrosophic decision environment. The primary driving force behind this work is to determine how to handle a ML-MOLFO problem while taking into account a real-life decision-making scenario. There is a hierarchy of decision-makers and many decision-making processes, such as agree, not-sure, and disagree, in a real-life decision-making setting. By taking into account such genuine situations, all resource, coefficient of objective, and constraint functions are represented as single-valued trapezoidal neutrosophic numbers. As far as we can tell, there is no established technique for resolving the ML-MOLFO problem with neutrosophic parameters in the literature review. Therefore, by outlining goal programming methods in the intuitionistic fuzzy environment, we create our new intuitionistic fuzzy Chebyshev goal programming (IFCGP) method to address the introduced problem. In the proposed method, first we used a modified ranking function to transform the problem into an analogous crisp ML-MOLFO problem, and then it was converted into a multilevel multiobjective linear optimization problem through linearized techniques. The linearization procedure in the proposed method, unlike the existing one, does not require derivatives, additional variables, or inequality constraints, which makes it simpler. To illustrate the adequacy and performance of the proposed new method, we considered numerical tests and application problems. We also compared the performance of the resulting optimal solution with existing approaches using the distance metric, which indicates our method is non-dominated. •A new intuitionistic fuzzy Chebyshev goal programming method is proposed.•A modified neutrosophic accuracy ranking technique is considered.•The proposed linearization method does not require derivatives or extra variables.•The distance metric is applied to compare the performance of the resulting solutions.•The proposed method solves two distinct numerical instances and their applications.
ISSN:0957-4174
DOI:10.1016/j.eswa.2024.125122