Simplex and interior point methods for solving budgetary allocation linear programming problem as IR4.0 strategy

Increasing the complexity of solving budgetary allocation (NP-hardness problem) has led a wide range of methods to minimize the costs. Metastrategy (or often called metaheuristic) and Linear Programming (LP) are the most popular optimisation methods used in this fields. Therefore, this study provides some insights and deep understanding of the applicability LP models in industry and how to formulate Simplex Method (SM) and affine Interior Point Methods (IPM) for solving real world linear problems. Moreover, it will present a better way to deal with decision making problems through the development and comparison of the SM and affine IPM to solve LP optimization problem to maximize profit. Finally, to other researchers particularly of similar interests who are undertaking further investigation on this topic, this study can be vital as a secondary source of information and guidance towards IR4.0.