Note—Project Selection and Sequencing to Maximize Net Present Value of the Total Return

This note considers a problem of simultaneous selection of a subset of N projects and determination of an optimal sequence to implement these projects so as to maximize the net present value of the total return. We first establish an optimal sequence of all projects which does not depend on the particular subset of selected projects and then propose an efficient polynomial dynamic programming method for solving the problem.

• 저널Management Science · 38(5) · 751–752
• 토픽Scheduling and Optimization Algorithms · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.38.5.751
• 저자Sushil Gupta, Jerzy Kyparisis, Chi-Ming Ip