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

Sushil K. Gupta, Jerzy Kyparisis and Chi-Ming Ip
Additional contact information
Sushil K. Gupta: Department of Decision Sciences and Information Systems, College of Business Administration, Florida International University, Miami, Florida 33199
Jerzy Kyparisis: Department of Decision Sciences and Information Systems, College of Business Administration, Florida International University, Miami, Florida 33199
Chi-Ming Ip: Department of Industrial Engineering, College of Engineering, University of Miami, Coral Gables, Florida 33124

Management Science, 1992, vol. 38, issue 5, 751-752

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.

Keywords: project selection; sequencing/scheduling; dynamic programming (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.38.5.751 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:38:y:1992:i:5:p:751-752

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().