An approach to linear programming problem under QSVN environment

Abstract

Human mistakes are normal issues in manual gathering processes, affecting item quality and bringing about extra expenses. In order to reduce human mistakes optimization problem  plays a crucial role in real life problems. The utilization of a SVN set makes it more straightforward to oversee circumstances in which one should manage mistaken, startling, helpless, broken, defenseless, and muddled data. Thus neutrosophic optimization becomes a notable optimization problem in artificial intelligence, manufacturing and management. To further generalize the SVN optimization problem we have introduced the quadripartitioned single valued neutrosophic (QSVN) optimization problem. Here the concept of QSVN trapezoidal (QSVNTP) number and quadripartitioned single valued triangular neutrosophic (QSVTRN) number are introduced and some properties of both numbers are discussed. Later new approaches based on centroid of QSVNTP and QSVNTRN numbers are provided  to solve a QSVN linear programming problem (LPP). The proposed methods are comparatively trouble-free and less calculative than existing methods. Finally examples are provided to  emphasize our proposed methods. A comparative study which illustrates the adequacy of our proposed method is also given at the end.