Authors: Huda E. Khalid
This article sheds light on the possibility of finding the minimum solution set of neutrosophic relational geometric programming with (max, min) composition. This work examines the privacy enjoyed by both neutrosophic logic and geometric programming, and how it affects the minimum solutions. It is the first attempt to solve this type of problems.
Comments: 5 Pages.
[v1] 2016-05-04 05:22:55
Unique-IP document downloads: 25 times
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.