{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Linear Prog COP4355_Part_40

# Linear Prog COP4355_Part_40 - Chapter 14 Dynamic...

This preview shows pages 1–4. Sign up to view the full content.

164 Chapter 14 Dynamic Programming 14.13 Solution: The route Mack should take to the peak of Mt. Norwood is given below. Base Camp R2 R6 R8 Peak The total minimum time to the peak is 7 hours . 14.14 Solution: The shortest route from Reno to L.A. is Reno 5 Dummy 1 L.A. with a minimum total miles of 113 . 14.15 Solution: Stage X i * P i * S i X i-1 HC i PC i Total Cost _____________________________________________________ 3 2 2 3 1 \$3 \$120 \$123 2 1 6 7 0 0 160 160 1 0 7 5 2 6 170 176 ____ Total Costs: \$459 _____________________________________________________ 2 3 4 5 6 7 8 9 Reno L. A. 25 28 32 14 21 10 12 34 85 26 95 38 44 59 47 61 88 76 45 25 0 Dummy 1 Stage 4 Stage 3 Stage 2 Stage 1 Stage 5 Optimal Solution

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Solutions Manual and Workbook 165 14.16 Product D __________________________________________________________ Machines Machines Used TR 1 * Available (X 1 ) Stage 1 (S 1 ) ( 00's) X 0 * __________________________________________________________ 5 5 33 0 4 4 29 0 3 3 25 0 2 2 19 0 1 1 9 0 0 0 0 0 __________________________________________________________ S 4 S 1 Product B S 3 S 2 X 0 = 0 X 4 = 5 Stage 4 Stage 3 Stage 2 Stage 1 X 3 X 2 X 1 Product A Product C Product D
166 Chapter 14 Dynamic Programming 14.16 (continued) Stage 2 Product C ________________________________________________________________________ Machines Machines Used TR 2 * TR 1 * Total Return Available (X 2 ) Stage 2(S 2 ) (00's) X 1 *(00's) TR 1-2 * _________________________________________________________________________ 5 5 27 0 0 27 4 26 1 9 35 3 25 2 19 44 2 22 3 25 47 * 1 10 4 29 39 0 0 5 33 33 -------------------------------------------------------------------------------------------------- 4 4 20 0 0 26 3 25 1 9 34 2 22 2 19 41 * 1 10 3 25 35 0 0 4 29 29 -------------------------------------------------------------------------------------------------- 3 3 25 0 0 25 2 22 1 9 31 * 1 10 2 19 29 0 0 3 25 25 ------------------------------------------------------------------------------------------------- 2 2 22 0 0 22 * 1 10 1

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 4

Linear Prog COP4355_Part_40 - Chapter 14 Dynamic...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online