This research proposes the most effective Discrete Optimization (DO) based decision making problems such as Subset Sum Problem (SSP), Knapsack problem (KP), and Submonoid Memebership Problem (SMP) along with calculating their generic case complexity. Also, to solve these DO based decision making problems a novel Discrete Gain Acquisitive Knowledge Optimization with Layer Splitting Color Set (DGAKO-LSCS) which utilized to solve the knapsack problem, Subset sum and Submonoid membership problem by splitting the elements in group H into logm. Furthermore, the generic case complexity of these techniques are computed and showed that the solutions are effective with low time complexity and standard deviation.