TY - JOUR ID - 105887 TI - Modified solution for neutrosophic linear programming problems with mixed constraints JO - International Journal of Research in Industrial Engineering JA - RIEJ LA - en SN - 2783-1337 AU - Das, S. K. AU - Dash, J. K. AD - Department of Mathematics, National Institute of Technology Jamshedpur, India. AD - Department of Computer Science and Engineering, SRM University-AP, Amravati, India. Y1 - 2020 PY - 2020 VL - 9 IS - 1 SP - 13 EP - 24 KW - neutrosophic linear programming KW - crisp linear programming KW - triangular neutrosophic numbers KW - Score function DO - 10.22105/riej.2020.224198.1127 N2 - 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. UR - https://www.riejournal.com/article_105887.html L1 - https://www.riejournal.com/article_105887_7b95dc7f7c1ad5334987743742af9bbd.pdf ER -