A steepest ascent approach to maximizing the net present value of projects

Christoph Schwindt and Jürgen Zimmermann

Mathematical Methods of Operations Research, 2001, vol. 53, issue 3, 435-450

Abstract: We study the scheduling of projects subject to general temporal constraints between activities such that the project net present value is maximized. The proposed algorithm is based on a first-order steepest ascent approach, where the steepest ascent directions are normalized by the supremum norm. In each iteration, the procedure ascends from a vertex of the feasible region to some non-adjacent vertex, which leads to a considerable speed-up compared to standard line-search. In an experimental performance analysis, we compare previous solution methods from literature to the algorithm presented in this paper. On the basis of two randomly generated test sets, the efficiency of the steepest ascent approach is demonstrated. Problem instances with up to 1000 activities can be solved in less than one second on a personal computer. Copyright Springer-Verlag Berlin Heidelberg 2001

Keywords: Key words: Project scheduling; net present value; temporal constraints; steepest ascent algorithm (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations: View citations in EconPapers (16)

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860100129 (text/html)
Access to full text is restricted to subscribers.

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:spr:mathme:v:53:y:2001:i:3:p:435-450

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860100129

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().