R&D Project Portfolio 선정 문제

This paper investigates the R&D project portfolio selection problem. Despite its importance and impact on real world projects, there exist few practical techniques that help construct an non-dominated portfolio for a decision makers satisfaction. One of the difficulties constructing the portfolio is that such project portfolio problem is, in nature, a multi-attribute decision-making problem, which is an NP-hard class problem. This paper investigates the R&D project portfolio selection problem. Despite its importance and impact on real world projects, there exist few practical techniques that help construct an non-dominated portfolio for a decision makers satisfaction. One of the difficulties constructing the portfolio is that such project portfolio problem is, in nature, a multi-attribute decision-making problem, which is an NP-hard class problem. In order to obtain the non-dominated portfolio that a decision maker or a user is satisfied with, we devise a user-interface algorithm, in that the user provides the maximum/minimum input values for each project attribute. Then the system searches the non-dominated portfolio that satisfies all the given constraints if such a portfolio exists. The process that the user adjusts the maximum/minimum values on the basis of the portfolio found continues repeatedly until the user is optimally satisfied with. We illustrate the algorithm proposed, and the computational results show the efficacy of our procedure.