Downloads provided by UsageCounts
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.
Neutrosophic Relational Equations, Geometric Programming, Electronic computers. Computer science, QA1-939, QA75.5-76.95, Mathematics
Neutrosophic Relational Equations, Geometric Programming, Electronic computers. Computer science, QA1-939, QA75.5-76.95, Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 2 | |
| downloads | 1 |

Views provided by UsageCounts
Downloads provided by UsageCounts