Comparison Between Cauchy's Steepest Descent and Fletcher-Reeves Methods in Solving Unconstrained Neutrosophic Nonlinear Programming Problems

The main objective of this study is to solve unconstrained single-valued Neutrosophic Nonlinear Programming Problems using Cauchy’s Steepest Descent Method(CSDM) and the Fletcher-Reeves Method(FRM). Our approach is based on new arithmetic operations and ranking on the parametric representations of Triangular Neutrosophic Numbers(TNN). We prove some important theorems for Cauchy’s Steepest Descent Method and the Fletcher-Reeves Method. Numerical examples are presented to illustrate the theory developed in this article. The outcomes of the proposed methods are compared.