DocumentCode
3506543
Title
Methods for selecting the optimal portfolio of projects
Author
Ding, Wei ; Cao, RongZeng
Author_Institution
IBM China Res. Lab., Beijing
Volume
2
fYear
2008
fDate
12-15 Oct. 2008
Firstpage
2617
Lastpage
2622
Abstract
Most organizations do not have sufficient resources to meet all of their obligations; selecting which projects should be funded is not just ranking projects and funding them ´top-down´ until resources are depleted. Organizations need to balance the benefits that project portfolios provide with their respective constraints and they need to do so in a meaningful way. To address this problem, we propose using enterprise portfolio analysis to reach the optimal projects mix and maximize the collective benefits, while balancing other factors such as risk, dependency and budget etc. Three extended mathematical models and revised dynamic programming algorithms together with simulation optimization are proposed based on solution of standard knapsack problem. Specifically, the proposed models and algorithms are illustrated using an example from practices.
Keywords
dynamic programming; knapsack problems; project management; dynamic programming algorithms; enterprise portfolio analysis; project portfolios; simulation optimization; standard knapsack problem; dynamic programming; knapsack problem; project portfolio selection;
fLanguage
English
Publisher
ieee
Conference_Titel
Service Operations and Logistics, and Informatics, 2008. IEEE/SOLI 2008. IEEE International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4244-2012-4
Electronic_ISBN
978-1-4244-2013-1
Type
conf
DOI
10.1109/SOLI.2008.4682979
Filename
4682979
Link To Document