Multiple Choice
Identify the
choice that best completes the statement or answers the question.
|
|
|
1.
|
Stages of a dynamic programming solution procedure
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. |
|
|
|
2.
|
State variables in a shortest route problem represent
a. | decisions. | b. | locations in the network. | c. | the minimum distance
between nodes. | d. | None of the alternatives is true. |
|
|
|
3.
|
The stage transformation function
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. |
|
|
|
4.
|
Stage transformation functions
a. | are linear. | b. | calculate the return. | c. | determine the output
of the stage. | d. | All of the alternatives are true. |
|
|
|
5.
|
A return function is a value such as profit or loss associated with making
decision dn at:
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. |
|
|
|
6.
|
If x3 = t4 (x4,d4) = x4
- 2d4 and r4(x4,d4) =
16d4 the state variable is
|
|
|
7.
|
If x3 = t4(x4,d4) = x4
- 2d4 and r4(x4,d4) =
16d4, the stage transformation function is
|
|
|
8.
|
If x3 = t4(x4,d4) = x4
- 2d4 and r4(x4,d4) =
16d4, the subscripts refer to
a. | state. | b. | stage. | c. | transformation. | d. | return. |
|
|
|
9.
|
The knapsack problem is to determine how many units of each item to place in the
knapsack to:
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. |
|
|
|
10.
|
Solutions in dynamic programming
a. | are not optimal. | b. | are unique. | c. | represent each
stage. | d. | All of the alternatives are true. |
|