A Dynamic Planning Technique for Continuous Activities Under Multiple Resource Constraints

Abstract

The solution technique developed in this paper integrates the simplex search algorithm into the recursive calculations of dynamic programming in order to mitigate the "curse-of-dimensionality." Since differentiation is not required as a means of optimization procedure, it is expected that this technique will have an important impact on planning problems, such as the multiple resource allocation problems which involve nondifferentiable and/or highly nonlinear performance functions. Applications of the technique to very complex problems seem to confirm the anticipated polynomial average performance.dynamic programming, simplex search

Continuous software engineering: A roadmap and agenda

“…While the topic of continuous planning has only been introduced within software engineering research relatively recently (Lehtola et al, 2009), it has long been a topic of study in the strategic management literature (e.g., Mintzberg (1994); Ozden (1987)). In the context of software development, planning tends to be episodic and performed according to a traditional cycle usually triggered by annual (2013)).…”