The Basic Notions for (over, off, under) Neutrosophic Geometric Programming Problems

Abstract

Neutrosophic (over, off, under) set and logic were defined for the first time in 1995 by
Florentin Smarandache, and presented during 1995-2018 to various national and international
conferences and seminars. The (over, off, under) neutrosophic geometric programming was put
forward by Huda et al. in (2016) [8], in an attempt to define a new type of geometric programming
using (over, off, under) neutrosophic less than or equal to. This paper completes the basic notions of
(over, off, under) neutrosophic geometric programming illustrating its convexity condition, and its
decomposition theorems. The definitions of (a,b,c)-cut and strong  (a,b,c)-cut are
introduced, and some of their important properties are proved.