A new approach to evaluate linear programming problem in pentagonal neutrosophic environment

In this paper, authors disclose a new concept of pentagonal neutrosophic (PN) approach to solve linear programming (LP) problem. To best of our insight, there is no approach for solving PNLP problem. For the first time, we take up the PNLP problem where the objectives, constraints are considered as pentagonal neutrosophic numbers (PNN). To deign our algorithm, we described the PN arithmetic operation laws and mathematical computation in PNN environment. This proposed method is based on ranking function and convert to its equivalent crisp LP (CrLP) problem. The obtained CrLP issue is presently being tackled by any LP method which is effectively accessible. To legitimize the proposed technique, some numerical tests are given to show the adequacy of the new model.

Automated summary

This paper introduces a new approach to solve pentagonal neutrosophic linear programming problems, which for the first time considers pentagonal neutrosophic numbers as objectives and constraints. By describing arithmetic operations and mathematical computations in a pentagonal neutrosophic number environment, the authors design an algorithm that converts the problem into a crisp linear programming issue, which can be solved effectively using existing LP methods. Numerical tests are conducted to demonstrate the adequacy of the proposed model.