Question 1

The problem that NASA has in determining what types of cargo may be loaded on the space shuttle is an example of a knapsack problem.

Accepted Answer

A) True 
 B)False  True

Question 2

There are four items (A,B,C,and
D)that are to be shipped by air.The weights of these are 3,4,5,and 3 tons,respectively.The profits (in thousands of dollars)generated by these are 5 for A,6 for B,7 for C,and 6 for D.There are 2 units of A,1 unit of B,3 units of C,and 2 units of D available to be shipped.The maximum weight is 16 tons.Use dynamic programming to determine the maximum possible profits that may be generated.

Accepted Answer

Maximum profit 28.Carry 2 A,1 B,and 2 D.

Question 3

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

Accepted Answer

A) 5,7 
B) 6,7 
C) 1,2,6,7 
D) 1,2,5,7 
E) 1,3,6,7 
A) 5,7 
B) 6,7 
C) 1,2,6,7 
D) 1,2,5,7 
E) 1,3,6,7 D

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,what is the optimal arc of stage 3?

Accepted Answer

A) 1 
B) 1 - 4 
C) 1 - 3 
D) 1 - 2 
E) None of the above 
A) 1 
B) 1 - 4 
C) 1 - 3 
D) 1 - 2 
E) None of the above

Question 5

The following information is to be used for the questions below:
GATRA,the Greater Attleboro-Taunton Regional Transit Authority serves six cities (City 1-City 6).While there are many restrictions (primarily roads on which they may not travel),they do have some choice of routes.The distances between cities,along permitted routes,are presented below.  
-What is the minimum distance that must be traveled to get from City 1 to City 6?

Accepted Answer

A) 26 
B) 9 
C) 11 
D) 3 
E) None of these 
A) 26 
B) 9 
C) 11 
D) 3 
E) None of these

Question 6

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 arc of stage 1.

Accepted Answer

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

Question 7

If the truck were required to take the route from City 4 to City 5,what would be the overall route?

Accepted Answer

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

Question 8

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 arc of stage 2.

Accepted Answer

A) 4 - 6 
B) 5 - 6 
C) 4 - 5 
D) 2 - 5 
E) None of the above 
A) 4 - 6 
B) 5 - 6 
C) 4 - 5 
D) 2 - 5 
E) None of the above

Question 9

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 3 for the optimal route.

Accepted Answer

A) 22 
B) 23 
C) 24 
D) 7 
E) 10 
A) 22 
B) 23 
C) 24 
D) 7 
E) 10

Question 10

Subproblems in a dynamic programming problem are called stages.

Accepted Answer

A) True 
 B)False

Question 11

here 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?

Accepted Answer

A) 9 
B) 10 
C) 11 
D) 12 
E) None of these 
A) 9 
B) 10 
C) 11 
D) 12 
E) None of these

Question 12

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

Accepted Answer

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

Question 13

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 arc of stage 4.

Accepted Answer

A) 1 - 2 
B) 2 - 4 
C) 1 - 3 
D) 3 - 4 
E) None of the above 
A) 1 - 2 
B) 2 - 4 
C) 1 - 3 
D) 3 - 4 
E) None of the above

Question 14

Table M2-3  
-For the shortest route problem described in Table M2-3,what is the distance for the shortest route?

Accepted Answer

A) 155 miles 
B) 66 miles 
C) 59 miles 
D) 114 miles 
E) None of the above 
A) 155 miles 
B) 66 miles 
C) 59 miles 
D) 114 miles 
E) None of the above

Question 15

A transformation describes

Accepted Answer

A) the relationship between stages. 
B) the initial condition of the system. 
C) a stage. 
D) a state variable. 
E) None of the above 
A) the relationship between stages. 
B) the initial condition of the system. 
C) a stage. 
D) a state variable. 
E) None of the above

Question 16

What is meant by a decision variable in a shortest-route problem?

Accepted Answer

It serves as identif

Question 17

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 travel path from point 1 to point 7.

Accepted Answer

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

Question 18

What are the four steps in dynamic programming?

Accepted Answer

1.Divide the original problem into subpr

Question 19

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 minimum distance from point 1 to point 7.

Accepted Answer

A) 18 
B) 17 
C) 23 
D) 14 
E) None of the above 
A) 18 
B) 17 
C) 23 
D) 14 
E) None of the above

Question 20

Discuss,briefly,the difference between a decision variable and a state variable.

Accepted Answer

A decision variable

Exam 17: Dynamic Programming

The problem that NASA has in determining what types of cargo may be loaded on the space shuttle is an example of a knapsack problem.

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

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

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 arc of stage 1.

If the truck were required to take the route from City 4 to City 5,what would be the overall 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 arc of stage 2.

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 3 for the optimal route.

Subproblems in a dynamic programming problem are called stages.

here 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?

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

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 arc of stage 4.

Table M2-3 -For the shortest route problem described in Table M2-3,what is the distance for the shortest route?

A transformation describes

What is meant by a decision variable in a shortest-route problem?

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 travel path from point 1 to point 7.

What are the four steps in dynamic programming?

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 minimum distance from point 1 to point 7.

Discuss,briefly,the difference between a decision variable and a state variable.

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