Linear Programming (LP) is an essential approach in mathematical programming because it is a viable technique used for addressing linear systems involving linear parameters and continuous constraints. The most important use of LP resides in solving the issues requiring resource management. Because many real-world issues are too complicated to be accurately characterized, indeterminacy is often present in every engineering planning process. Neutrosophic logic, which is an application of intuitionistic fuzzy sets, is a useful logic for dealing with indeterminacy. Neutrosophic Linear Programming (NLP) issues are essential in neutrosophic modelling because they may express uncertainty in the physical universe. Numerous techniques have been proposed to alleviate NLP difficulties. On the surface, the current approaches in the specialized literature are unable to tackle issues with non-deterministic variables. In other words, no method for solving a truly neutrosophic problem has been offered. For the first time, a unique approach is provided for tackling Fully Neutrosophic Linear Programming (FNLP) problems in this study. The proposed study uses a decomposition method to break the FNLP problem into three separate bounded problems. Then, these problems are solved using simplex techniques. Unlike other existing methods, the proposed method can solve NLP problems with neutrosophic values for variables. In this research, the decision-makers have the freedom to consider the variables with neutrosophic structure, while obtaining the optimal objective value as a crisp number. It should also be noted that the typical NLP problems, which can be solved by means of the existing methods, can also be solved through the method proposed in this paper.