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.

MoreLess

Year of publication:	1992
Authors:	Gupta, Sushil K. ; Kyparisis, Jerzy ; Ip, Chi-Ming
Published in:	Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 38.1992, 5, p. 751-752
Publisher:	Institute for Operations Research and the Management Sciences - INFORMS
Subject:	project selection \| sequencing/scheduling \| dynamic programming

More details

Extent:	application/pdf
Type of publication:	Article
Other identifiers:	10.1287/mnsc.38.5.751 [DOI]
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10009197412