Question 1

For knapsack problems,sn-1 = an × sn + bn × dn + cn is a typical transformation expression.

Accepted Answer

A) True 
 B)False

Question 2

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

Accepted Answer

Shortest d

Question 3

Discuss,briefly,the role of the transformation function.

Accepted Answer

The transformation function de

Question 4

Table M2-1
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.

Accepted Answer

A) 5 
B) 6 
C) 7 
D) 6 - 7 
E) 5 - 7 
A) 5 
B) 6 
C) 7 
D) 6 - 7 
E) 5 - 7

Question 5

In the shortest-route problem,circles represent ________,and arrows represent ________.

Accepted Answer

nodes or "locations,

Question 6

What is the decision criterion for a knapsack problem?

Accepted Answer

maximizing profit or minimizin

Question 7

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

Accepted Answer

A) True 
 B)False

Question 8

The following information is to be used for the questions below:
There are seven cities (City 1-City 7)served by Acme Trucking.Route availability is limited.The distances,in hundreds of miles,are given in the table below for each route.  
-What route should the truck from City 1 to City 7 take?

Accepted Answer

A) 1-2,2-5,5-7 
B) 1-3,3-4,4-6,6-7 
C) 1-2,2-4,4-5,5-6,6-7 
D) 1-3,3-5,5-6,6-7 
E) None of the above 
A) 1-2,2-5,5-7 
B) 1-3,3-4,4-6,6-7 
C) 1-2,2-4,4-5,5-6,6-7 
D) 1-3,3-5,5-6,6-7 
E) None of the above

Question 9

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

Accepted Answer

A) True 
 B)False

Question 10

What is the decision criterion for a shortest route problem?

Accepted Answer

minimizati

Question 11

Table M2-1
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 2.

Accepted Answer

A) 4 - 6 
B) 3 - 6 
C) 3 - 5 
D) 2 - 6 
E) 2 - 5 
A) 4 - 6 
B) 3 - 6 
C) 3 - 5 
D) 2 - 6 
E) 2 - 5

Question 12

In dynamic programming,there is a state variable defined for every stage.

Accepted Answer

A) True 
 B)False

Question 13

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?

Accepted Answer

(a)The route with the lowest overall rat

Question 14

A transformation changes the identities of the state variables.

Accepted Answer

A) True 
 B)False

Question 15

Table M2-1
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.

Accepted Answer

A) 21 
B) 22 
C) 23 
D) 24 
E) 75 
A) 21 
B) 22 
C) 23 
D) 24 
E) 75

Question 16

Both dynamic programming and linear programming take a multi-stage approach to solving problems.

Accepted Answer

A) True 
 B)False

Question 17

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

Accepted Answer

A) 0 
B) 4 
C) 8 
D) 12 
E) 21 
A) 0 
B) 4 
C) 8 
D) 12 
E) 21

Question 18

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

Accepted Answer

A) 0 
B) 8 
C) 7 
D) 14 
E) None of the above 
A) 0 
B) 8 
C) 7 
D) 14 
E) None of the above

Question 19

Table M2-2  
-According to Table M2-2,which gives a solution to a shortest route problem solved with dynamic programming,which cities would be included in the best route?

Accepted Answer

A) 1,2,3,4,5,6 
B) 1,4,6,7 
C) 1,2,5,6,7 
D) 6,7 
E) None of the above 
A) 1,2,3,4,5,6 
B) 1,4,6,7 
C) 1,2,5,6,7 
D) 6,7 
E) None of the above

Question 20

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

Accepted Answer

A) 205 miles 
B) 94 miles 
C) 241 miles 
D) 108 miles 
E) None of the above 
A) 205 miles 
B) 94 miles 
C) 241 miles 
D) 108 miles 
E) None of the above

Exam 17: Dynamic Programming

For knapsack problems,sn-1 = an × sn + bn × dn + cn is a typical transformation expression.

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

Discuss,briefly,the role of the transformation function.

Table M2-1 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 the shortest-route problem,circles represent ________,and arrows represent ________.

What is the decision criterion for a knapsack problem?

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

The following information is to be used for the questions below: There are seven cities (City 1-City 7)served by Acme Trucking.Route availability is limited.The distances,in hundreds of miles,are given in the table below for each route. -What route should the truck from City 1 to City 7 take?

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

What is the decision criterion for a shortest route problem?

Table M2-1 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 2.

In dynamic programming,there is a state variable defined for every stage.

A transformation changes the identities of the state variables.

Table M2-1 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.

Both dynamic programming and linear programming take a multi-stage approach to solving problems.

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

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

Table M2-2 -According to Table M2-2,which gives a solution to a shortest route problem solved with dynamic programming,which cities would be included in the best route?

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

Introduction to Quantitative Analysis

Probability Concepts and Applications

Decision Analysis

Regression Models

Forecasting

Inventory Control Models

Linear Programming Models: Graphical and Computer Methods

Linear Programming Applications

Transportation,assignment,and Network Models

Integer Programming,goal Programming,and Nonlinear Programming

Project Management

Waiting Lines and Queuing Theory Models

Simulation Modeling

Markov Analysis

Statistical Quality Control

Analytic Hierarchy Process

Decision Theory and the Normal Distribution

Game Theory

Mathematical Tools: Determinants and Matrices

Calculus-Based Optimization

Linear Programming: The Simplex Method

Transportation, Assignment, and Network Algorithms

Filters

For knapsack problems,s_n-1 = a_n × s_n + b_n × d_n + c_n is a typical transformation expression.

In the shortest-route problem,circles represent ,and arrows represent .