The Stochastic Time-Constrained Net Present Value Problem

摘要: The successful management of capital-intensive development and engineering projects requires a careful timing the involved cash in- outflows. To this end, project literature proposes to schedule activities so as maximize their net present value (NPV), that is, sum all discounted flows. Traditionally, on NPV maximization ignores uncertainty inherent in activity durations In survey, we argue should be accounted for explicitly, investigate computational challenges doing so. We then review two major strands stochastic maximization. first set papers provides optimal solutions under assumption follow independent exponential distributions. second strand allows generic distributions but focuses suboptimal solutions. conclude with list research questions believe deserve further attention.