Multi-level programming (MLP) is an important branch of operation research. The majority of optimization problems- humans currently face- have very large numbers of variables and constraints and are called large-scale programming problems. However, practical situations entail some imprecision regarding some decisions and performances. Neutrosophic sets play a vital role by considering three independent degrees, namely, the truth membership degree, indeterminacy membership degree, and falsity membership degree, of any aspect of an uncertain decision. The present study focuses on solving multi-level large-scale linear programming problems with neutrosophic parameters in the constrains by considering the problem coefficients to be trapezoidal neutrosophic numbers. The neutrosophic form of the problem is transformed into an equal crisp model in the first stage of the solution methodology to reduce the problem’s complexity. In the second stage, a decomposition algorithm is used to obtain the Pareto optimal solution among conflicted decision levels. The proposed algorithm is validated by an illustrative example.
Digital Object Identifier (DOI)
E. Emam, O.; A. Abdel-Fattah, Manal; and Azzam, Safaa.M.
"A Decomposition Algorithm for Solving Multi-Level Large-Scale Linear Programming Problems With Neutrosophic Parameters in the Constrains,"
Applied Mathematics & Information Sciences: Vol. 14:
5, Article 19.
Available at: https://digitalcommons.aaru.edu.jo/amis/vol14/iss5/19