Public R&D project portfolio selection problem with cancellations

被引:0
作者
Musa Çağlar
Sinan Gürel
机构
[1] Middle East Technical University,Industrial Engineering Department
[2] The Scientific and Technological Research Council of Turkey (TÜBİTAK),undefined
来源
OR Spectrum | 2017年 / 39卷
关键词
R&D project portfolio selection; Cancellations; Dynamic programming; Chance constraints;
D O I
暂无
中图分类号
学科分类号
摘要
In this study, we address a public R&D project portfolio selection problem with project cancellations. For several reasons, a funded R&D project may be halted before finishing the planned research. When a project is canceled, most of its budget is usually unused and also some of the spendings can return to the funding organization. In the call-based R&D programs, usually project selection decisions are made in one go, and, in the current call, it is not possible to award new projects with the unused budget. Decision-makers (DMs) of funding organizations can benefit from considering possible project cancellation situations to improve the budget utilization. We consider two cases. In the first case, we assume that cancellation probability of a project cannot be assessed but the DM can estimate the number of projects that will be canceled. In the second case, we assume that for each project, a cancellation probability can be assessed. For the first problem, we develop a mixed-integer linear programming formulation and a dynamic programming algorithm. For the second problem, we develop a chance-constrained stochastic programming formulation that can be solved as a mixed-integer second-order cone program. Our computational results show that practical-size problems can be solved by the proposed solution approaches.
引用
收藏
页码:659 / 687
页数:28
相关论文
共 39 条
  • [11] Gerchak Y(2010)Large-scale public R&D portfolio selection by maximizing a biobjective impact measure IEEE Trans Syst Man Cybern Part A Syst Hum 40 572-582
  • [12] Parlar M(1976)Computability of global solutions to factorable nonconvex programs. 1. Convex underestimating problems Math Program 10 147-175
  • [13] Gupte A(2013)Exact solution of the robust knapsack problem Comput Oper Res 40 2625-2631
  • [14] Ahmed S(2004)The challenge of building an effective innovation system for catch-up Oxford Dev Studies 32 365-374
  • [15] Cheon MS(2004)Mean-gini analysis in R&D portfolio selection Eur J Oper Res 154 157-169
  • [16] Dey S(2010)Optimization of R&D project portfolios under endogenous uncertainty Eur J Oper Res 207 420-433
  • [17] Heidenberger K(undefined)undefined undefined undefined undefined-undefined
  • [18] Stummer C(undefined)undefined undefined undefined undefined-undefined
  • [19] Henriksen AD(undefined)undefined undefined undefined undefined-undefined
  • [20] Traynor AJ(undefined)undefined undefined undefined undefined-undefined