Question 1

What are the four steps in dynamic programming?

Accepted Answer

Divide the original problem into subprob

Question 2

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

Accepted Answer

It serves as identif

Question 3

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) 1100 miles 
B) 900 miles 
C) 1,300 miles 
D) 1,400 miles 
A) 1100 miles 
B) 900 miles 
C) 1,300 miles 
D) 1,400 miles

Question 4

Your local paper carrier could make use of the shortest-route technique.

Accepted Answer

A) True 
 B)False

Question 5

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 
A) 26 
B) 9 
C) 11 
D) 3

Question 6

The arrow labeled S2 in Figure M2.1 represents the output from stage 1.

Accepted Answer

A) True 
 B)False

Question 7

What is the decision criterion for a knapsack problem?

Accepted Answer

maximizing profit or minimizin

Question 8

Alex returns from a weekend hiking with his son and discovers a note from his unstable wife on the kitchen counter.Alex decides to take the shortest possible route to the meanest lawyer in Bearington to put an end to this marriage.What is the minimum distance required to take Alex to his new lawyer whose office is at node 7?

Accepted Answer

Shortest d

Question 9

The formula sn = tn(sn-1,dn,rn)allows us to go from one stage to the next in Figure M2.1.

Accepted Answer

A) True 
 B)False

Question 10

-The above information describes a shortest-route problem with the distance in miles.How many stages will this dynamic programming problem have?

Accepted Answer

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

Question 11

In dynamic programming, the decision rules defining an optimal policy give optimal decisions for any entering condition at any stage.

Accepted Answer

A) True 
 B)False

Question 12

The following information describes a shortest-route problem with the distance in miles.Which nodes are involved in the shortest route?

Accepted Answer

A) 1-3-7-8 
B) 1-2-6-8 
C) 1-4-7-8 
D) 1-4-6-8 
A) 1-3-7-8 
B) 1-2-6-8 
C) 1-4-7-8 
D) 1-4-6-8

Question 13

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.
 
-If the truck were required to take the route from City 4 to City 5, what would be the shortest distance from City 1 to City 7?

Accepted Answer

A) 2900 miles 
B) 3200 miles 
C) 3700 miles 
D) 3400 miles 
A) 2900 miles 
B) 3200 miles 
C) 3700 miles 
D) 3400 miles

Question 14

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

Accepted Answer

A) 22 
B) 17 
C) 24 
D) 7 
A) 22 
B) 17 
C) 24 
D) 7

Question 15

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 shortest route?

Accepted Answer

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

Question 16

The second step in solving a dynamic programming problem is to solve the last stage of the problem for all conditions or states.

Accepted Answer

A) True 
 B)False

Question 17

Figure M2.1
-In Figure M2.1, arrow d2 represents a

Accepted Answer

A) decision 
B) disturbance 
C) d-transformation 
D) dynamic node 
A) decision 
B) disturbance 
C) d-transformation 
D) dynamic node

Question 18

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

Question 19

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

Question 20

-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 
A) 4 - 6 
B) 5 - 6 
C) 4 - 5 
D) 2 - 5

What are the four steps in dynamic programming?

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

Your local paper carrier could make use of the shortest-route technique.

The arrow labeled S₂ in Figure M2.1 represents the output from stage 1.

What is the decision criterion for a knapsack problem?

The formula s_n = t_n(s_n-1,d_n,r_n)allows us to go from one stage to the next in Figure M2.1.

-The above information describes a shortest-route problem with the distance in miles.How many stages will this dynamic programming problem have?

In dynamic programming, the decision rules defining an optimal policy give optimal decisions for any entering condition at any stage.

The following information describes a shortest-route problem with the distance in miles.Which nodes are involved in the shortest route?

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

The second step in solving a dynamic programming problem is to solve the last stage of the problem for all conditions or states.

Figure M2.1 -In Figure M2.1, arrow d₂ represents a

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

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?

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

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

Exam 17: Dynamic Programming

What are the four steps in dynamic programming?

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

Your local paper carrier could make use of the shortest-route technique.

The arrow labeled S2 in Figure M2.1 represents the output from stage 1.

What is the decision criterion for a knapsack problem?

The formula sn = tn(sn-1,dn,rn)allows us to go from one stage to the next in Figure M2.1.

-The above information describes a shortest-route problem with the distance in miles.How many stages will this dynamic programming problem have?

In dynamic programming, the decision rules defining an optimal policy give optimal decisions for any entering condition at any stage.

The following information describes a shortest-route problem with the distance in miles.Which nodes are involved in the shortest route?

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

The second step in solving a dynamic programming problem is to solve the last stage of the problem for all conditions or states.

Figure M2.1 -In Figure M2.1, arrow d2 represents a

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

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?

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

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

The arrow labeled S₂ in Figure M2.1 represents the output from stage 1.

The formula s_n = t_n(s_n-1,d_n,r_n)allows us to go from one stage to the next in Figure M2.1.

Figure M2.1 -In Figure M2.1, arrow d₂ represents a