Question 1

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

Accepted Answer

shortest-r

Question 2

For the questions which follow,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 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 
E) None of the above 
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 
E) None of the above

Question 3

Table M2-4  
-For the shortest route problem described in Table M2-4,which arcs comprise the shortest route?

Accepted Answer

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

Question 4

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

Accepted Answer

A) 22 
B) 17 
C) 24 
D) 7 
E) None of the above 
A) 22 
B) 17 
C) 24 
D) 7 
E) None of the above

Question 5

A stage is a(n)

Accepted Answer

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

Question 6

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 
E) None of the above 
A) 26 
B) 20 
C) 18 
D) 22 
E) None of the above

Question 7

Dynamic programming can only be used to solve network-based problems.

Accepted Answer

A) True 
 B)False

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

For the questions which follow,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 routes should be traveled?

Table M2-4 -For the shortest route problem described in Table M2-4,which arcs comprise the shortest 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 3.

A stage is a(n)

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

Dynamic programming can only be used to solve network-based problems.

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

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

For the questions which follow,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 routes should be traveled?

Table M2-4 -For the shortest route problem described in Table M2-4,which arcs comprise the shortest 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 3.

A stage is a(n)

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

Dynamic programming can only be used to solve network-based problems.

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