In applying Bellman's principle of optimality for dynamic programming using backwards recursion for a maximization problem, at a given state within a given stage:
A)it does not matter how that state is reached.
B)that state was reached using an optimal set of decisions from the first stage.
C)the shortest distance route to the next stage will be selected.
D)the longest distance route to the next stage will be selected.

Question

Quizplus · Accepted Answer

Bellman's principle of optimality states that the optimal policy has the property that, whatever the initial state and initial decision are, the remaining decisions must constitute an optimal policy with regard to the state resulting from the first decision. Thus, it does not matter how the state is reached.

In Applying Bellman's Principle of Optimality for Dynamic Programming Using