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

Authors

  • Huda E. Khalid University of Telafer, Administrator of the President Office, Telafer, Iraq.
  • Florentin Smarandache University of New Mexico, 705 Gurley Ave., Gallup, NM 87301, USA
  • Ahmed K. Essa University of Telafer, Administrator of the President Office, Telafer, Iraq.

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.

Downloads

Download data is not yet available.

Downloads

Published

2018-12-10

Issue

Vol. 22 (2018): Neutrosophic Sets and Systems

Section

SI#1,2024: Neutrosophical Advancements And Their Impact on Research

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

 Creative Commons Attribution (CC BY) license.

How to Cite

Huda E. Khalid, Smarandache, F., & Ahmed K. Essa. (2018). The Basic Notions for (over, off, under) Neutrosophic Geometric Programming Problems. Neutrosophic Sets and Systems, 22, 50-62. http://fs.unm.edu/nss8/index.php/111/article/view/267

Most read articles by the same author(s)

1 2 3 4 5 6 7 8 9 10 > >>