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,...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Soft computing (Berlin, Germany) Ročník 26; číslo 17; s. 8699 - 8707
Hlavní autoři:	Das, Sapan Kumar, Edalatpanah, S. A.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2022
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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