Chapter 5—Network Modeling
31.The equipment replacement problem is an example of which network problem?
|
a. |
transportation problem. |
|
b. |
shortest path problem. |
|
c. |
maximal flow problem. |
|
d. |
minimal spanning tree problem. |
32. If a side constraint for a network flow model cannot be avoided, and non-integer solutions result, how can the solution be expressed as an integer solution?
|
a. |
Force all the arc flow decision variables to be integer. |
|
b. |
Round off all the non-integer arc flow decision variables. |
|
c. |
Increase the supply until the solutions are all integer using a dummy supply node. |
|
d. |
Increase the demand until the solutions are all integer using a dummy demand node. |
33. A maximal flow problem differs from other network models in which way?
|
a. |
arcs are two directional |
|
b. |
multiple supply nodes are used |
|
c. |
arcs have limited capacity |
|
d. |
arcs have unlimited capacity |
34. Maximal flow problems are converted to transshipment problems by
|
a. |
connecting the supply and demand nodes with a return arc |
|
b. |
adding extra supply nodes |
|
c. |
adding supply limits on the supply nodes |
|
d. |
requiring integer solutions |
35. What is the objective function in the following maximal flow problem?
|
a. |
MIN X41 |
|
b. |
MAX X12 + X13 |
|
c. |
MAX X14 |
|
d. |
MAX X41 |
36. What is the constraint for node 2 in the following maximal flow problem?
|
a. |
X12- X23- X24 = 0 |
|
b. |
X12 + X23 + X24 = 0 |
|
c. |
X12£ 4 |
|
d. |
X12 + X13- X23 = 0 |
37. What is missing from transportation problems compared to transshipment problems?
|
a. |
arcs |
|
b. |
demand nodes |
|
c. |
transshipment nodes |
|
d. |
supply nodes |
38. Which method is preferred for solving fully connected transportation problems?
|
a. |
linear programming |
|
b. |
network flow methods |
|
c. |
trial and error |
|
d. |
simulation |
39. When might a network flow model for a transportation/assignment problem be preferable to a matrix form for the problem?
|
a. |
When an integer solution is required. |
|
b. |
When the problem is large and not fully connected. |
|
c. |
When the problem is large and fully connected. |
|
d. |
When supply exceeds demand. |
40. Which method is preferred for solving minimal spanning tree problems?
|
a. |
linear programming |
|
b. |
transshipment models |
|
c. |
simulation |
|
d. |
manual algorithms |
41. How many arcs are required to make a spanning tree in a network with n nodes and m arcs?
|
a. |
n |
|
b. |
n- 1 |
|
c. |
m |
|
d. |
m- 1 |
42. The minimal spanning tree solution algorithm works by defining a subnetwork and
|
a. |
adding the least expensive arc which connects any node in the current subnetwork to any node not in the current subnetwork. |
|
b. |
adding the most expensive arc which connects any node in the current subnetwork to any node not in the current subnetwork. |
|
c. |
adding the least expensive arc which connects unconnected nodes in the current subnetwork. |
|
d. |
adding the least expensive arc which connects the most recently added node in the current subnetwork to the closest node not in the current subnetwork. |
-
Rating:
/5
Solution: Chapter 5—Network Modeling