able M2-5 Stage 1 Si 6 ri SO di 6-7 5 – 7 10 7 7 7 fo 0 0 fi 10 7 Stage 2 SZ S1 12 3 6 5 4 6 d: 5-6 4-6 4-5 35 2-5 5 6 9 4 fi 10 10 7 7 7 f2 13 15 13 16 11 3 5 5 5 N Stage 3 S3 3 d3 3-4 2 – 4 13 4 5 S2 4 f: 13 13 f 17 18 4 Stage 4 S3 S4 1 d4 1-3 1-2 14 7 3 f f 16 f4 23 3 2 11 14The data below is a dynamic programming solution for a shortest route problem.
Using the data in Table M2-5, determine the optimal arc of stage 1.
|
3 – 7 |
||
|
6 – 7 |
||
|
5 – 7 |
||
|
4 – 7 |
||
|
None of these |
