Question 1

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 2

Solutions in dynamic programming

Accepted Answer

A) are not optimal. 
B) are unique. 
C) represent each stage. 
D) All of these are correct. 
A) are not optimal. 
B) are unique. 
C) represent each stage. 
D) All of these are correct.

Question 3

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

Accepted Answer

A) True 
 B)False

Question 4

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

Accepted Answer

A) True 
 B)False

Question 5

A number of types of items are to be shipped as cargo.The total available weight in the truck is 10 tons.Determine the number of units of items to be shipped to maximize profit.

Accepted Answer

Ship 0 tons of item

Question 6

A knapsack problem is so named because the objective is to find the number of N items,each of which has a different weight and value,that can be placed in a knapsack with limited weight capacity so as to maximize the total value of the items placed in the knapsack.

Accepted Answer

A) True 
 B)False

Question 7

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

Accepted Answer

A) True 
 B)False

Question 8

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 9

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

​ Three solutions:(1

Question 10

Consider the following integer linear program:   ​ 
a.Set up the network that represents the dynamic programming formulation.
b.Solve the problem using dynamic programming.

Accepted Answer

The answer of Consider the following integer linear program: ...

Question 11

As opposed to a specific technique such as linear programming,dynamic programming is considered a general approach.

Accepted Answer

A) True 
 B)False

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

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

Accepted Answer

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

Question 14

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

Accepted Answer

A) True 
 B)False

Question 15

An input state variable and an output state variable together define the condition of the process at the beginning and end of a stage.

Accepted Answer

A) True 
 B)False

Question 16

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

Question 17

The owner of a small construction firm is excavating at three sites.He wishes to assign his five additional trucks in such a way as to minimize his total costs.Each site can use zero to three additional trucks; no site can use more than three trucks efficiently.The following site total costs are known.   ​ 
a.​
Use dynamic programming to find the assignment of the additional trucks that minimizes total cost.
b.​
If the owner had only four trucks to assign,what would be the optimal assignment and total cost?

Accepted Answer

The answer of The owner of a small construction firm...

Question 18

Audio Disks will be opening outlets in the greater Phoenix area.The estimated sales at each store are dependent not only on the store location,but also on the number of sales personnel,as presented in the table below ($1000s/year).Each store requires at least two salespeople,and a pool of nine salespeople is available.​
a.What would the states be in the dynamic programming formulation?
b.Draw the network that represents the dynamic programming formulation.
c.​
Given the above network,solve the sales personnel allocation problem by finding the longest path.

Accepted Answer

​ a. The states represent the number of

Question 19

The stage transformation function identifies which state one reaches at the next stage for a given decision.

Accepted Answer

A) True 
 B)False

Question 20

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.

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

Solutions in dynamic programming

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

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

A number of types of items are to be shipped as cargo.The total available weight in the truck is 10 tons.Determine the number of units of items to be shipped to maximize profit.

A knapsack problem is so named because the objective is to find the number of N items,each of which has a different weight and value,that can be placed in a knapsack with limited weight capacity so as to maximize the total value of the items placed in the knapsack.

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

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

Consider the following integer linear program: a.Set up the network that represents the dynamic programming formulation. b.Solve the problem using dynamic programming.

As opposed to a specific technique such as linear programming,dynamic programming is considered a general approach.

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

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

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

An input state variable and an output state variable together define the condition of the process at the beginning and end of a stage.

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

The stage transformation function identifies which state one reaches at the next stage for a given decision.

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

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, finance, and OM

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 stage transformation function is

Solutions in dynamic programming

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

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

A number of types of items are to be shipped as cargo.The total available weight in the truck is 10 tons.Determine the number of units of items to be shipped to maximize profit.

A knapsack problem is so named because the objective is to find the number of N items,each of which has a different weight and value,that can be placed in a knapsack with limited weight capacity so as to maximize the total value of the items placed in the knapsack.

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

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

Consider the following integer linear program: ​ a.Set up the network that represents the dynamic programming formulation. b.Solve the problem using dynamic programming.

As opposed to a specific technique such as linear programming,dynamic programming is considered a general approach.

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

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

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

An input state variable and an output state variable together define the condition of the process at the beginning and end of a stage.

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

The stage transformation function identifies which state one reaches at the next stage for a given decision.

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

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, finance, and OM

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 stage transformation function is

Consider the following integer linear program: a.Set up the network that represents the dynamic programming formulation. b.Solve the problem using dynamic programming.

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