decision support system on resources allocation problem

This study, recursively, optimizes the limited budget allocation process in an organization that manages several projects. dynamic programming decomposed the main resources allocation problem into a simpler sub-problem and solve the problem in a backward manner. the case under study is a state organization in 2016 managed seven projects with a total requested budget 1.33 billion id to cover all projects but the received budget was only 0.5 billion id. each requested budget for each project is divided equally, which represents projects’ alternatives and each alternative return of investment (roi) is calculated. the main purpose of the current thesis is to help and assist both private and, especially, iraqi state organizations to manage and optimize their projects that run annually from a resources allocation perspective. to attain this optimization purpose, the thesis employed dynamic programming side-by-side with multi-criteria decision-making (mcdm) technique.