Skip to content
Q187Section III (Statistics)187 of 190

Bellman's principle guarantees optimal subpaths, but not their uniqueness

Suppose that R is the shortest route from city 1 to city 10 passing through some other cities. The principle of optimality implies that: (i) For every city jj on R, the subpath in R from city jj to city 10 must be the shortest. (ii) For every city jj on R, there must be a unique path from city jj to city 10. Which of the above statements is correct?

Options

Pick an option to check your answer.