Exam 17: Dynamic Programming

-Using the data in Table M2-5, determine the minimum distance from point 1 to point 7.

The data below is a dynamic programming solution for a shortest route problem. -Using the data in Table M2-1, what is the optimal travel path from point 1 to 7?

The following information describes a shortest-route problem with the distance in miles.What is the shortest possible route from node 1 to node 8?

The data below is a dynamic programming solution for a shortest route problem. -Using the data in Table M2-1, determine the optimal arc of stage 1.

In a shortest-route problem, the nodes represent the destinations.

-Using the data in Table M2-5, determine the optimal arc of stage 4.

In a shortest-route problem, the limit on the number of allowable decision variables from one node to another is the number of possible nodes to which one might yet travel.

-For the shortest route problem described in Table M2-4, what is the length of the shortest route?

Develop the shortest-route network for the problem below, and determine the minimum distance from node 1 to node 8.

There are six cities (City 1-City 6) serviced by a particular airline. Limited routes are available, and the distances for each of these routes are presented in the table below. -What is the minimum distance that must be traveled to get from City 1 to City 6?

The data below is a dynamic programming solution for a shortest route problem. -Using the data in Table M2-1, determine the minimum distance from point 1 to point 7.

What are the four elements defining each stage in a dynamic programming problem?

There are three items (A, B, and C) that are to be shipped by air. The weights of these are 4, 5, and 3 tons, respectively. The profits (in thousands of dollars) generated by these are 3 for A, 4 for B, and 2 for C. There are four units of each available for shipment. Only 12 tons may be loaded on the plane. The maximum possible profit for this would be

For the bus line problem above, what are the stages that provide the minimum distance?

Dynamic programming can be applied to a professional tennis player's serving strategy.

Linear programming is typically applied to problems wherein one must make a decision at a specified point (or points)in time.Dynamic programming is typically applied to problems wherein one must make a sequence of decisions.

Each item in a knapsack problem will be a stage of the dynamic programming problem.

There are six cities (City 1-City 6) serviced by a particular airline. Limited routes are available, and the distances for each of these routes are presented in the table below. -Which nodes are involved in the shortest distance between City 1 and City 5?

There are four items (A, B, C, and D) that are to be shipped by truck. The weights of these are 3, 7, 4, and 5 tons, respectively, and the plane can carry 13 tons. The profits (in thousands of dollars) generated by these are 3 for A, 4 for B, 2 for C, and 5 for D. There are four units of each available for shipment. If this were to be solved as a dynamic programming problem, how many stages would there be?

Hard D.Head has decided that he wants to climb one of the world's tallest mountains.He has mapped out a number of routes between various points on the mountain, and rated each route as to difficulty.His rating scale considers a 1 as being particularly easy, and a 10 as being almost impossible. (a)Given the information below, identify the route that would provide the easiest climb. (b)What would be the average rating of the route? (c)What is wrong with this approach to Mr.Head's problem?