Question 1

Dynamic programming requires that its subproblems be independent of one another.

Accepted Answer

A) True 
 B)False  False

Question 2

Dynamic programming must only involve a finite number of decision alternatives and a finite number of stages.

Accepted Answer

A) True 
 B)False  False

Question 3

The return function for a shortest route problem refers to two directional arcs between nodes.

Accepted Answer

A) True 
 B)False  False

Question 4

Stages of a dynamic programming solution procedure

Accepted Answer

A) represent parts of a large mathematical model. 
B) often represent a sequence of decisions made over time. 
C) are usually not independent of each other. 
D) All of the alternatives are true. 
A) represent parts of a large mathematical model. 
B) often represent a sequence of decisions made over time. 
C) are usually not independent of each other. 
D) All of the alternatives are true.

Question 5

The knapsack problem is to determine how many units of each item to place in the knapsack to:

Accepted Answer

A) minimize total value. 
B) maximize total value. 
C) minimize the number of items in the knapsack. 
D) maximize the number of items in the knapsack. 
A) minimize total value. 
B) maximize total value. 
C) minimize the number of items in the knapsack. 
D) maximize the number of items in the knapsack.

Question 6

Dynamic programming is a general approach with stage decision problems differing substantially from application to application.

Accepted Answer

A) True 
 B)False

Question 7

If x3 = t4(x4,d4) = x4 ? 2d4 and r4(x4,d4) = 16d4, the stage transformation function is

Accepted Answer

A) t 
B) x 
C) r 
D) d 
A) t 
B) x 
C) r 
D) d

Question 8

Dynamic programming, when used for the shortest route problem, requires complete enumeration of paths from the beginning to ending node.

Accepted Answer

A) True 
 B)False

Question 9

The solution of stage k of a dynamic programming problem is dependent upon the solution of stage k?1.

Accepted Answer

A) True 
 B)False

Question 10

Stage transformation functions

Accepted Answer

A) are linear. 
B) calculate the return. 
C) determine the output of the stage. 
D) All of the alternatives are true. 
A) are linear. 
B) calculate the return. 
C) determine the output of the stage. 
D) All of the alternatives are true.

Question 11

If x3 = t4(x4,d4) = x4 ? 2d4 and r4(x4,d4) = 16d4, the subscripts refer to

Accepted Answer

A) state. 
B) stage. 
C) transformation. 
D) return. 
A) state. 
B) stage. 
C) transformation. 
D) return.

Question 12

A return function is a value such as profit or loss associated with making decision dn at:

Accepted Answer

A) stage n for specific value of output variable xn. 
B) stage n for a specific value of input variable xn. 
C) stage n for a specific value of stage m. 
D) input n for a specific value of output variable xn. 
A) stage n for specific value of output variable xn. 
B) stage n for a specific value of input variable xn. 
C) stage n for a specific value of stage m. 
D) input n for a specific value of output variable xn.

Question 13

The stage transformation function

Accepted Answer

A) transforms the input into the output. 
B) transforms a stage into a state. 
C) is a different function for each stage. 
D) None of the alternatives is true. 
A) transforms the input into the output. 
B) transforms a stage into a state. 
C) is a different function for each stage. 
D) None of the alternatives is true.

Question 14

Dynamic programming is a general approach rather than a specific technique.

Accepted Answer

A) True 
 B)False

Question 15

If x3 = t4 (x4,d4) = x4 ? 2d4 and r4(x4,d4) = 16d4 the state variable is

Accepted Answer

A) t 
B) x 
C) r 
D) d 
A) t 
B) x 
C) r 
D) d

Question 16

State variables in a shortest route problem represent

Accepted Answer

A) decisions. 
B) locations in the network. 
C) the minimum distance between nodes. 
D) None of the alternatives is true. 
A) decisions. 
B) locations in the network. 
C) the minimum distance between nodes. 
D) None of the alternatives is true.

Question 17

The output of stage k is the input for stage k?1.

Accepted Answer

A) True 
 B)False

Question 18

State variables are a function of a state variable and a decision.

Accepted Answer

A) True 
 B)False

Question 19

In solving a shortest route problem using dynamic programming the stages represent how many arcs you are from the terminal node.

Accepted Answer

A) True 
 B)False

Dynamic programming requires that its subproblems be independent of one another.

Dynamic programming must only involve a finite number of decision alternatives and a finite number of stages.

The return function for a shortest route problem refers to two directional arcs between nodes.

Stages of a dynamic programming solution procedure

The knapsack problem is to determine how many units of each item to place in the knapsack to:

Dynamic programming is a general approach with stage decision problems differing substantially from application to application.

If x₃ = t₄(x₄,d₄) = x₄ ? 2d₄ and r₄(x₄,d₄) = 16d₄, the stage transformation function is

Dynamic programming, when used for the shortest route problem, requires complete enumeration of paths from the beginning to ending node.

The solution of stage k of a dynamic programming problem is dependent upon the solution of stage k?1.

Stage transformation functions

If x₃ = t₄(x₄,d₄) = x₄ ? 2d₄ and r₄(x₄,d₄) = 16d₄, the subscripts refer to

A return function is a value such as profit or loss associated with making decision d_n at:

The stage transformation function

Dynamic programming is a general approach rather than a specific technique.

If x₃ = t₄(x₄,d₄) = x₄ ? 2d₄ and r₄(x₄,d₄) = 16d₄ the state variable is

State variables in a shortest route problem represent

The output of stage k is the input for stage k?1.

State variables are a function of a state variable and a decision.

In solving a shortest route problem using dynamic programming the stages represent how many arcs you are from the terminal node.

Introduction

Introduction to Linear Programming

LP Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications

Advanced Linear Programming Applications

Distribution and Network Problems

Integer Linear Programming

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Forecasting

Markov Processes

LP: Simplex Method

Simplex-Based Sensitivity Analysis and Duality

Solution Procedures for Transportation and Assignment Problems

Minimal Spanning Tree

Filters

Exam 21: Dynamic Programming

Dynamic programming requires that its subproblems be independent of one another.

Dynamic programming must only involve a finite number of decision alternatives and a finite number of stages.

The return function for a shortest route problem refers to two directional arcs between nodes.

Stages of a dynamic programming solution procedure

The knapsack problem is to determine how many units of each item to place in the knapsack to:

Dynamic programming is a general approach with stage decision problems differing substantially from application to application.

If x3 = t4(x4,d4) = x4 ? 2d4 and r4(x4,d4) = 16d4, the stage transformation function is

Dynamic programming, when used for the shortest route problem, requires complete enumeration of paths from the beginning to ending node.

The solution of stage k of a dynamic programming problem is dependent upon the solution of stage k?1.

Stage transformation functions

If x3 = t4(x4,d4) = x4 ? 2d4 and r4(x4,d4) = 16d4, the subscripts refer to

A return function is a value such as profit or loss associated with making decision dn at:

The stage transformation function

Dynamic programming is a general approach rather than a specific technique.

If x3 = t4 (x4,d4) = x4 ? 2d4 and r4(x4,d4) = 16d4 the state variable is

State variables in a shortest route problem represent

The output of stage k is the input for stage k?1.

State variables are a function of a state variable and a decision.

In solving a shortest route problem using dynamic programming the stages represent how many arcs you are from the terminal node.

Introduction

Introduction to Linear Programming

LP Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications

Advanced Linear Programming Applications

Distribution and Network Problems

Integer Linear Programming

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Forecasting

Markov Processes

LP: Simplex Method

Simplex-Based Sensitivity Analysis and Duality

Solution Procedures for Transportation and Assignment Problems

Minimal Spanning Tree

Filters

If x₃ = t₄(x₄,d₄) = x₄ ? 2d₄ and r₄(x₄,d₄) = 16d₄, the stage transformation function is

If x₃ = t₄(x₄,d₄) = x₄ ? 2d₄ and r₄(x₄,d₄) = 16d₄, the subscripts refer to

A return function is a value such as profit or loss associated with making decision d_n at:

If x₃ = t₄(x₄,d₄) = x₄ ? 2d₄ and r₄(x₄,d₄) = 16d₄ the state variable is