Modified solution for neutrosophic linear programming problems with mixed constraints

Abstract

Neutrosophic Linear Programming (NLP) issues is presently extensive applications in science and engineering. The primary commitment right now to manage the NLP problem where the coefficients are neutrosophic triangular numbers with blended requirements. The current method [20] are viewed as just imbalance limitations. Notwithstanding, in our paper, we consider both blended requirements and utilize another score function to understand the strategy. To determine the progression of the current method, another strategy is proposed for tackling NLP issues. To check the better outcome, we execute various numerical models.

Keywords

• neutrosophic linear programming
• crisp linear programming
• triangular neutrosophic numbers
• score function