Linear Prog COP4355_Part_40

Linear Prog COP4355_Part_40 - Chapter 14 Dynamic...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
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
Background image of page 1

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

View Full DocumentRight Arrow Icon
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
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/13/2011 for the course COP 4355 taught by Professor Koslov during the Spring '10 term at University of Florida.

Page1 / 4

Linear Prog COP4355_Part_40 - Chapter 14 Dynamic...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online