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:
ISSN:1432-7643, 1433-7479
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first