In this paper, a new method is presented to solve the Neutrosophic Multi-Objective Linear Programming Problem (NMOLPP) as a Linear Complementation Problem (LCP) that can be viewed as an extension of the problem, Neutrosophic Linear Programming. Here, we have established a multi-objective optimization problem with single-valued triangular neutrals and thus have developed significant results. The solution method proposed here will also be useful for solving multi-objective nonlinear programming problems. In this approach, the true, undefined, and false attributes associated with each objective of a multi-objective linear programming problem are transformed into a single-objective optimization problem and LPP or LCP. Reduction is solved by the proposed algorithm. An illustrative example is also provided to verify the robustness of the proposed method.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

On Solving Neutrosophic Multi-Objective Linear Programming Problem as a Linear Complementarity Problem

  • N. Sudha,
  • R. Irene Hepzibah,
  • A. Nagoor Gani

摘要

In this paper, a new method is presented to solve the Neutrosophic Multi-Objective Linear Programming Problem (NMOLPP) as a Linear Complementation Problem (LCP) that can be viewed as an extension of the problem, Neutrosophic Linear Programming. Here, we have established a multi-objective optimization problem with single-valued triangular neutrals and thus have developed significant results. The solution method proposed here will also be useful for solving multi-objective nonlinear programming problems. In this approach, the true, undefined, and false attributes associated with each objective of a multi-objective linear programming problem are transformed into a single-objective optimization problem and LPP or LCP. Reduction is solved by the proposed algorithm. An illustrative example is also provided to verify the robustness of the proposed method.