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

DOI10.1007/s001860100129zbMath1037.90034OpenAlexW2085368235MaRDI QIDQ1396984

Jürgen Zimmermann, Christoph Schwindt

Publication date: 15 July 2003

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860100129

zbMATH Keywords

net present valuetemporal constraintsProject schedulingsteepest ascent algorithm

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)

Related Items (9)

A scatter search heuristic for maximising the net present value of a resource-constrained project with fixed activity cash flows ⋮ Order-based neighborhoods for project scheduling with nonregular objective functions. ⋮ Maximizing the expected net present value in a project with uncertain cash flows ⋮ Capital- and resource-constrained project scheduling with net present value optimization ⋮ Maximizing the expected net present value of a project with phase-type distributed activity durations: an efficient globally optimal solution procedure ⋮ Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models ⋮ Project selection, scheduling and resource allocation with time dependent returns ⋮ Maximizing the net present value of a project under uncertainty ⋮ Simulated annealing and tabu search for multi-mode project payment scheduling

This page was built for publication: A steepest ascent approach to maximizing the net present value of projects