Numerical Analysis

Dynamic ProgrammingTherefore, the minimum cost is 15 and it is achieved through path a → c → e → h → m , as shownin Figure 16.5d96bh56 35eam3454c6f8kFigure 16.5. Line graph showing the minimum cost for Example 16.2Example 16.3On the line graph of Figure 16.6, node A represents an airport in New York City and nodes Bthrough L several airports throughout Europe and Asia. All flights originate at A and fly eastward.A salesman must leave New York City and be in one of the airports H, J, K, or L at theshortest possible time. The encircled numbers represent waiting times in hours at each airport.The numbers in squares show the hours he must travel by an automobile to reach his destination,and the numbers beside the line segments indicated the flight times, also in hours. Which airportshould he choose ( H, J, K, or L) to minimize his total travel time, and in how many hours afterdeparture from A will he reach his destination?A5D4B2 48423E43 467C536F7Figure 16.6. Line graph for Example 16.3H 3J 2K 4L 3Numerical Analysis Using MATLAB and Spreadsheets, Second Edition 16-7Orchard Publications