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

Sushil Kumar Gupta · Jerzy Kyparisis · Chi-Ming Ip

31 citations0/0 files storedManagement Science

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Capital Investment and Risk Analysis Optimization and Mathematical Programming Resource-Constrained Project Scheduling

Abstract

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.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 31 citations exist upstream.

Cited by

1996R&D project selection and scheduling with a filtered beam search approach 1996Project selection with discounted returns and multiple constraints 2014Expanded model of the project portfolio selection problem with divisibility, time profile factors and cardinality constraints 1994Sequential decisions under uncertainty in the R&D project selection problem 2005Towards a model for selection and scheduling of risky projects

Imported from OpenAlex (CC0) — nothing here is generated.