Decision problems often involve multiple objectives that conflict, making simultaneous optimization impossible. These problems require trade-offs to achieve a solution that balances the competing goals. In this paper, the detailed discussion that is related to linear programming (SVTrNFMOLP) with single valued trapezoidal neutrosophic numbers is made. Furthermore, this study deals with all the related parameters and discussion. As rank function and due to its definition, the SVTrNFMOLP is transformed in the crisp MOLP. It is noticed that goal programming is best to get the best compromise solution. The advantages of the proposed approach are: The use of Tr allows the problem formulation to incorporate uncertainty and imprecision in all parameters, making it more realistic and flexible, transforming the uncertain model into crisp MOLP problem, the approach simplifies computation and enables the use of standard optimization techniques, preserves the essential characteristics of the neutrosophic data while reducing complexity, developing a goal programming approach provides a systematic way to obtain the best compromise solution that balances all objectives, and method is practical and can be applied to a wide range of decision-making problems in engineering, economics, and management. An illustrative example is demonstrated to clarify the developed algorithm.
Alodhaibi et al. (2026) studied this question.