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

Podrobná bibliografia

Vydané v:	Soft computing (Berlin, Germany) Ročník 26; číslo 17; s. 8699 - 8707
Hlavní autori:	Das, Sapan Kumar, Edalatpanah, S. A.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2022
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!