Model Optimisasi Diskrit dalam Membentuk Pohon Keputusan Optimal

Abstract

Decision problems are commonly used in real world. In this case, there are several alternatives to be chosen with different outcome values and limitations that should not be exceeded. Various methods have been developed to solve discrete decision making problems, specifically the binary decision model. This study aims to apply a decision tree model with a binary model in solving discrete decision problems. The results of this study indicate that the use of advanced recursive computational dynamic programming algorithms produces the same advantageous solution as the implicit enumeration method.