Question 1

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 2

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

Accepted Answer

A) True 
 B)False

Question 3

​Finding the optimal solution to each stage of a dynamic programming problem will always lead to an optimal solution to the total problem.

Accepted Answer

A) True 
 B)False

Question 4

We have a number of types of items to be shipped as cargo. The total available weight in the truck is ten tons. We wish to determine the number of units of items to be shipped to maximize profit.

Accepted Answer

Ship 0 tons of item

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

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 8

Find the shortest path through the following network using dynamic programming.

Accepted Answer

The answer of Find the shortest path through the following...

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

​What is the Principle of Optimality, and what is its relationship to dynamic programming?

Accepted Answer

The Principle of Optimality states that

Question 11

​Marvelous Marvin is planning his annual "Almost Everything Must Go" inventory clearance sale. Marvin has decided to allocate 18 shelf feet to the cooking section. He is considering offering up to five items for sale in this category:
​   ​
If Marvin wants at least one item A and one item B on sale, what stock should he have on sale and what is the total expected profit?

Accepted Answer

​
a. 1-2-7-12-15: Di

Question 12

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 13

A cargo company has a set of delivery patterns for its goods from its locations at city1 to a series of cities 2,3,4,5, and 6. The delivery times between cities are given I hours below. Find the shortest route.

Accepted Answer

The answer of A cargo company has a set of...

Question 14

​Define the following terms as they relate to dynamic programming.
a.Stage
b.State variable
c.Stage transformation function​

Accepted Answer

Dynamic programming is a method for solv

Question 15

​In a production and inventory control problem, the states can correspond to the amount of inventory on hand at the beginning of each period.

Accepted Answer

A) True 
 B)False

Question 16

​In a knapsack problem, if one adds another item, one must completely resolve the problem in order to find a new optimal solution.

Accepted Answer

A) True 
 B)False

Question 17

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 18

​The subscripts used in dynamic programming notation refer to states.

Accepted Answer

A) True 
 B)False

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

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

Finding the optimal solution to each stage of a dynamic programming problem will always lead to an optimal solution to the total problem.

We have a number of types of items to be shipped as cargo. The total available weight in the truck is ten tons. We wish to determine the number of units of items to be shipped to maximize profit.

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

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

Stage transformation functions

Find the shortest path through the following network using dynamic programming.

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

What is the Principle of Optimality, and what is its relationship to dynamic programming?

Stages of a dynamic programming solution procedure

A cargo company has a set of delivery patterns for its goods from its locations at city1 to a series of cities 2,3,4,5, and 6. The delivery times between cities are given I hours below. Find the shortest route.

Define the following terms as they relate to dynamic programming. a.Stage b.State variable c.Stage transformation function

In a production and inventory control problem, the states can correspond to the amount of inventory on hand at the beginning of each period.

In a knapsack problem, if one adds another item, one must completely resolve the problem in order to find a new optimal solution.

The stage transformation function

The subscripts used in dynamic programming notation refer to states.

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, Finance, and Operations Management

Advanced Linear Programming Applications

Distribution and Network Models

Integer Linear Programming

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Time Series Analysis and Forecasting

Markov Processes

Linear Programming: Simplex Method

Simplex-Based Sensitivity Analysis and Duality

Solution Procedures for Transportation and Assignment Problems

Minimal Spanning Tree

Filters

Exam 21: Dynamic Programming

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

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

​Finding the optimal solution to each stage of a dynamic programming problem will always lead to an optimal solution to the total problem.

We have a number of types of items to be shipped as cargo. The total available weight in the truck is ten tons. We wish to determine the number of units of items to be shipped to maximize profit.

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

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

Stage transformation functions

Find the shortest path through the following network using dynamic programming.

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

​What is the Principle of Optimality, and what is its relationship to dynamic programming?

Stages of a dynamic programming solution procedure

A cargo company has a set of delivery patterns for its goods from its locations at city1 to a series of cities 2,3,4,5, and 6. The delivery times between cities are given I hours below. Find the shortest route.

​Define the following terms as they relate to dynamic programming. a.Stage b.State variable c.Stage transformation function​

​In a production and inventory control problem, the states can correspond to the amount of inventory on hand at the beginning of each period.

​In a knapsack problem, if one adds another item, one must completely resolve the problem in order to find a new optimal solution.

The stage transformation function

​The subscripts used in dynamic programming notation refer to states.

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, Finance, and Operations Management

Advanced Linear Programming Applications

Distribution and Network Models

Integer Linear Programming

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Time Series Analysis and Forecasting

Markov Processes

Linear Programming: 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 state variable is

Finding the optimal solution to each stage of a dynamic programming problem will always lead to an optimal solution to the total problem.

What is the Principle of Optimality, and what is its relationship to dynamic programming?

Define the following terms as they relate to dynamic programming. a.Stage b.State variable c.Stage transformation function

In a production and inventory control problem, the states can correspond to the amount of inventory on hand at the beginning of each period.

In a knapsack problem, if one adds another item, one must completely resolve the problem in order to find a new optimal solution.

The subscripts used in dynamic programming notation refer to states.