Optimal solution of neutrosophic linear fractional programming problems with mixed constraints

In this paper, linear fractional programming problems have been extended to neutrosophic sets, and the operations and functionality of these laws are studied. Moreover, the new algorithm is based on aggregation ranking function and arithmetic operations of triangular neutrosophic sets. Furthermore,...

Full description

Saved in:
Bibliographic Details
Published in:Soft computing (Berlin, Germany) Vol. 26; no. 17; pp. 8699 - 8707
Main Authors: Das, Sapan Kumar, Edalatpanah, S. A.
Format: Journal Article
Language:English
Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2022
Subjects:
Artificial Intelligence
Computational Intelligence
Control
Engineering
Mathematical Logic and Foundations
Mechatronics
Optimization
Robotics
Crisp linear fractional programming
Neutrosophic linear fractional programming
Triangular neutrosophic numbers
Ranking function
ISSN:1432-7643, 1433-7479
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, linear fractional programming problems have been extended to neutrosophic sets, and the operations and functionality of these laws are studied. Moreover, the new algorithm is based on aggregation ranking function and arithmetic operations of triangular neutrosophic sets. Furthermore, in this paper, we take up a problem where the constraints are both equality and inequality neutrosophic triangular fuzzy number. Lead from genuine issue, a few numerical models are considered to survey the legitimacy, profitability and materialness of our technique. At last, some numerical trials alongside one contextual analysis are given to show the novel techniques are better than the current strategies.
ISSN:1432-7643
1433-7479
DOI:10.1007/s00500-022-07171-z