In a typical network model representation of the transportation problem, the nodes indicate a. roads b. rail lines c. geographic locations d. rivers
In a typical network model representation of the transportation problem, the nodes indicate
|
a. |
roads |
|
b. |
rail lines |
|
c. |
geographic locations |
|
d. |
rivers |
For all routes with positive flows in an optimized transportation problem, the reduced cost will be:
|
a. |
zero |
|
b. |
how much less shipping costs would have to be for shipments to occur along that route |
|
c. |
how much more shipping costs would have to be for shipments to occur along that route |
|
d. |
how much the capacity is along that shipping route |
The decision variables in transportation problems are:
|
a. |
profits |
|
b. |
costs |
|
c. |
flows |
|
d. |
capacities |
Which of the following statements is a type of constraint that is often required in blending problems?
|
a. |
Integer constraint |
|
b. |
Quality constraint |
|
c. |
Binary constraint |
|
d. |
None of these options |
When a workforce
|
a. |
an integer objective function |
|
b. |
integer technological coefficients |
|
c. |
integer constraints |
|
d. |
all of these options |
. When the profit increases with a unit increase in a resource, this change in profit will be shown in Solver's sensitivity report as the:
|
a. |
add-in price |
|
b. |
sensitivity price |
|
c. |
shadow price |
|
d. |
additional profit |
The condition of nonnegativity requires that:
|
a. |
the objective function cannot be less than zero |
|
b. |
the decision variables cannot be less than zero |
|
c. |
the right-hand side of the constraints cannot be greater than zero |
|
d. |
the reduced cost cannot be less than zero |
Trending now
This is a popular solution!
Step by step
Solved in 3 steps