Neutrosophic Geometric Programming (NGP) with (Max, Product) Operator; An Innovative Model

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. (sic), Theta) between a(ij) and b(i) 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 Aox = b, with some properties of the operation Theta. Numerical examples have been solved to illustrate new concepts.