IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v207y2010i1p420-433.html
   My bibliography  Save this article

Optimization of R&D project portfolios under endogenous uncertainty

Author

Listed:
  • Solak, Senay
  • Clarke, John-Paul B.
  • Johnson, Ellis L.
  • Barnes, Earl R.

Abstract

Project portfolio management deals with the dynamic selection of research and development (R&D) projects and determination of resource allocations to these projects over a planning period. Given the uncertainties and resource limitations over the planning period, the objective is to maximize the expected total discounted return or the expectation of some other function for all projects over a long time horizon. We develop a detailed formal description of this problem and the corresponding decision process, and then model it as a multistage stochastic integer program with endogenous uncertainty. Accounting for this endogeneity, we propose an efficient solution approach for the resulting model, which involves the development of a formulation technique that is amenable to scenario decomposition. The proposed solution algorithm also includes an application of the sample average approximation method, where the sample problems are solved through Lagrangian relaxation and a new lower bounding heuristic. The performance of the overall solution procedure is demonstrated using several implementations of the proposed approach.

Suggested Citation

  • Solak, Senay & Clarke, John-Paul B. & Johnson, Ellis L. & Barnes, Earl R., 2010. "Optimization of R&D project portfolios under endogenous uncertainty," European Journal of Operational Research, Elsevier, vol. 207(1), pages 420-433, November.
    • Handle: RePEc:eee:ejores:v:207:y:2010:i:1:p:420-433
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(10)00351-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Janne Gustafsson & Ahti Salo, 2005. "Contingent Portfolio Programming for the Management of Risky Projects," Operations Research, INFORMS, vol. 53(6), pages 946-956, December.
    2. Christoph H. Loch & Stylianos Kavadias, 2002. "Dynamic Portfolio Selection of NPD Programs Using Marginal Returns," Management Science, INFORMS, vol. 48(10), pages 1227-1241, October.
    3. Alexander Shapiro, 2003. "Inference of statistical bounds for multistage stochastic programming problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 58(1), pages 57-68, September.
    4. F Ghasemzadeh & N Archer & P Iyogun, 1999. "A zero-one model for project portfolio selection and scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(7), pages 745-755, July.
    5. Colvin, Matthew & Maravelias, Christos T., 2010. "Modeling methods and a branch and cut algorithm for pharmaceutical clinical trial planning using stochastic programming," European Journal of Operational Research, Elsevier, vol. 203(1), pages 205-215, May.
    6. Tore Jonsbråten & Roger Wets & David Woodruff, 1998. "A class of stochastic programs withdecision dependent random elements," Annals of Operations Research, Springer, vol. 82(0), pages 83-106, August.
    7. Viswanath, Kannan & Peeta, Srinivas & Salman, Sibel F., 2004. "Investing in the Links of a Stochastic Network to Minimize Expected Shortest Path. Length," Purdue University Economics Working Papers 1167, Purdue University, Department of Economics.
    8. Harry Markowitz, 1952. "Portfolio Selection," Journal of Finance, American Finance Association, vol. 7(1), pages 77-91, March.
    9. X. Zhao & P. B. Luh & J. Wang, 1999. "Surrogate Gradient Algorithm for Lagrangian Relaxation," Journal of Optimization Theory and Applications, Springer, vol. 100(3), pages 699-712, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lars Hellemo & Paul I. Barton & Asgeir Tomasgard, 2018. "Decision-dependent probabilities in stochastic programs with recourse," Computational Management Science, Springer, vol. 15(3), pages 369-395, October.
    2. Feng, Wei & Feng, Yiping & Zhang, Qi, 2021. "Multistage robust mixed-integer optimization under endogenous uncertainty," European Journal of Operational Research, Elsevier, vol. 294(2), pages 460-475.
    3. Bora Tarhan & Ignacio Grossmann & Vikas Goel, 2013. "Computational strategies for non-convex multistage MINLP models with decision-dependent uncertainty and gradual uncertainty resolution," Annals of Operations Research, Springer, vol. 203(1), pages 141-166, March.
    4. Salo, Ahti & Doumpos, Michalis & Liesiö, Juuso & Zopounidis, Constantin, 2024. "Fifty years of portfolio optimization," European Journal of Operational Research, Elsevier, vol. 318(1), pages 1-18.
    5. Liesiö, Juuso & Xu, Peng & Kuosmanen, Timo, 2020. "Portfolio diversification based on stochastic dominance under incomplete probability information," European Journal of Operational Research, Elsevier, vol. 286(2), pages 755-768.
    6. Sha, Yue & Zhang, Junlong & Cao, Hui, 2021. "Multistage stochastic programming approach for joint optimization of job scheduling and material ordering under endogenous uncertainties," European Journal of Operational Research, Elsevier, vol. 290(3), pages 886-900.
    7. Tahir Ekin & Nicholas G. Polson & Refik Soyer, 2017. "Augmented nested sampling for stochastic programs with recourse and endogenous uncertainty," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(8), pages 613-627, December.
    8. H S Ryoo, 2007. "A compact mean-variance-skewness model for large-scale portfolio optimization and its application to the NYSE market," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(4), pages 505-515, April.
    9. Blanford, Geoffrey J., 2009. "R&D investment strategy for climate change," Energy Economics, Elsevier, vol. 31(Supplemen), pages 27-36.
    10. Giovanni Pantuso, 2021. "A node formulation for multistage stochastic programs with endogenous uncertainty," Computational Management Science, Springer, vol. 18(3), pages 325-354, July.
    11. Kopa, Miloš & Rusý, Tomáš, 2023. "Robustness of stochastic programs with endogenous randomness via contamination," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1259-1272.
    12. Jafarzadeh, M. & Tareghian, H.R. & Rahbarnia, F. & Ghanbari, R., 2015. "Optimal selection of project portfolios using reinvestment strategy within a flexible time horizon," European Journal of Operational Research, Elsevier, vol. 243(2), pages 658-664.
    13. Maier, Sebastian & Pflug, Georg C. & Polak, John W., 2020. "Valuing portfolios of interdependent real options under exogenous and endogenous uncertainties," European Journal of Operational Research, Elsevier, vol. 285(1), pages 133-147.
    14. Huang, Xiaoxia & Xiang, Lan & Islam, Sardar M.N., 2014. "Optimal project adjustment and selection," Economic Modelling, Elsevier, vol. 36(C), pages 391-397.
    15. Rocha, Paula & Kuhn, Daniel, 2012. "Multistage stochastic portfolio optimisation in deregulated electricity markets using linear decision rules," European Journal of Operational Research, Elsevier, vol. 216(2), pages 397-408.
    16. Milford, James & Henrion, Max & Hunter, Chad & Newes, Emily & Hughes, Caroline & Baldwin, Samuel F., 2022. "Energy sector portfolio analysis with uncertainty," Applied Energy, Elsevier, vol. 306(PA).
    17. Eyyüb Y. Kıbış & İ. Esra Büyüktahtakın & Robert G. Haight & Najmaddin Akhundov & Kathleen Knight & Charles E. Flower, 2021. "A Multistage Stochastic Programming Approach to the Optimal Surveillance and Control of the Emerald Ash Borer in Cities," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 808-834, May.
    18. Salo, Ahti & Andelmin, Juho & Oliveira, Fabricio, 2022. "Decision programming for mixed-integer multi-stage optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 299(2), pages 550-565.
    19. Miloš Kopa & Tomáš Rusý, 2021. "A decision-dependent randomness stochastic program for asset–liability management model with a pricing decision," Annals of Operations Research, Springer, vol. 299(1), pages 241-271, April.
    20. Kavitha G. Menon & Ricardo Fukasawa & Luis A. Ricardez-Sandoval, 2021. "A novel stochastic programming approach for scheduling of batch processes with decision dependent time of uncertainty realization," Annals of Operations Research, Springer, vol. 305(1), pages 163-190, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:207:y:2010:i:1:p:420-433. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.