Question 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 
A) 0 
B) 4 
C) 8 
D) 12

Question 2

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 
A) 1 
B) 1 - 4 
C) 1 - 3 
D) 1 - 2

Question 3

Identify two types of problems that can be solved by dynamic programming.

Accepted Answer

shortest-r

Question 4

A transformation describes

Accepted Answer

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

Question 5

In Figure M2.1 there is a function t2 that is not depicted, that converts s2 and d2 to s1.

Accepted Answer

A) True 
 B)False

Question 6

-Using the data in Table M2-5, determine the optimal distance of stage 2.

Accepted Answer

A) 10 
B) 7 
C) 8 
D) 11 
A) 10 
B) 7 
C) 8 
D) 11

Question 7

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

Accepted Answer

A) True 
 B)False

Question 8

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.
 
-Which routes should be traveled?

Accepted Answer

A) 1-2, 2-3, 3-5, 5-6 
B) 1-2, 2-3, 3-4, 4-6 
C) 1-2, 2-5, 5-6 
D) 1-4, 4-6 
A) 1-2, 2-3, 3-5, 5-6 
B) 1-2, 2-3, 3-4, 4-6 
C) 1-2, 2-5, 5-6 
D) 1-4, 4-6

Question 9

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

Accepted Answer

A) True 
 B)False

Question 10

The arrow labeled D2 in Figure M2.1 represents a disturbance.

Accepted Answer

A) True 
 B)False

Question 11

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

Question 12

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) 7 
D) 10 
A) 22 
B) 23 
C) 7 
D) 10

Question 13

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

Accepted Answer

A) 0 
B) 8 
C) 12 
D) 16 
A) 0 
B) 8 
C) 12 
D) 16

Question 14

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

Question 15

The arrow labeled S1 in Figure M2.1 represents an output.

Accepted Answer

A) True 
 B)False

Question 16

For the bus line problem above, what is the minimum possible distance to travel from City 1 to City 6?

Accepted Answer

A) 26 
B) 20 
C) 18 
D) 22 
A) 26 
B) 20 
C) 18 
D) 22

Question 17

A stage is a(n)

Accepted Answer

A) alternative. 
B) policy. 
C) condition at the end of the problem. 
D) subproblem. 
A) alternative. 
B) policy. 
C) condition at the end of the problem. 
D) subproblem.

Question 18

Figure M2.1
-In Figure M2.1, arrow S2 represents a(n)

Accepted Answer

A) signal. 
B) source. 
C) stage. 
D) output. 
A) signal. 
B) source. 
C) stage. 
D) output.

Question 19

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, and the plane can carry 13 tons. 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. If this were to be solved as a dynamic programming problem, how many stages would there be?

Accepted Answer

A)  1 
B)  2 
C)  3 
D)  4 
A)  1 
B)  2 
C)  3 
D)  4

Question 20

Subproblems in a dynamic programming problem are called stages.

Accepted Answer

A) True 
 B)False

Exam 17: Dynamic Programming

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.

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?

Identify two types of problems that can be solved by dynamic programming.

A transformation describes

In Figure M2.1 there is a function t2 that is not depicted, that converts s2 and d2 to s1.

-Using the data in Table M2-5, determine the optimal distance of stage 2.

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

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

The arrow labeled D2 in Figure M2.1 represents a disturbance.

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.

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.

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

-Using the data in Table M2-5, determine the optimal travel path from point 1 to point 7.

The arrow labeled S1 in Figure M2.1 represents an output.

For the bus line problem above, what is the minimum possible distance to travel from City 1 to City 6?

A stage is a(n)

Figure M2.1 -In Figure M2.1, arrow S2 represents a(n)

Subproblems in a dynamic programming problem are called stages.

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

In Figure M2.1 there is a function t₂ that is not depicted, that converts s₂ and d₂ to s₁.

The arrow labeled D₂ in Figure M2.1 represents a disturbance.

The arrow labeled S₁ in Figure M2.1 represents an output.

Figure M2.1 -In Figure M2.1, arrow S₂ represents a(n)