Neutrosophic Geometric Programming (NGP) with (Max, Product) Operator; an Innovative Model
Huda E. Khalid · UNM’s Digital Repository (University of New Mexico) · 2020
In this paper, a neutrosophic optimization model has been first constructed for the neutrosophic geometric programming subject to (max-product) neutrosophic relation constraints. For finding the maximum solution, two new operations (i.e. , ) between and have been defined, which have a key role in the structure of the maximum solution. Also, two new theorems and some propositions are introduced that discussed the cases of the incompatibility in the relational equations , with some properties of the operation . Numerical examples have been solved to illustrate new concepts.