 |
| 1 | |
Transportation and assignment problems can be solved by simplex method though special purpose algorithms offer an easier solution procedure. |
| | A) | True |
| | B) | False |
|
|
|
| 2 | |
The total supply must equal total demand in a transportation problem in order to solve it by the transportation algorithm. |
| | A) | True |
| | B) | False |
|
|
|
| 3 | |
XYZ Inc. manufactures desks and chairs in all its four furniture manufacturing plants. It has 5 warehouses across the country. One transportation problem can be used to determine how to ship desks and chairs. |
| | A) | True |
| | B) | False |
|
|
|
| 4 | |
Transshipment problem can be solved using the transportation formulation, as long as we are assured that no material stays in the intermediate points permanently. |
| | A) | True |
| | B) | False |
|
|
|
| 5 | |
Transshipment problem formulation may be used in place of transportation formulation when there are two products that are being shipped, each having its own per unit cost of shipping. |
| | A) | True |
| | B) | False |
|
|
|
| 6 | |
In a linear programming formulation of the assignment problem, the RHS of all constraints is greater than 1. |
| | A) | True |
| | B) | False |
|
|
|
| 7 | |
In the transportation problem model for production planning discussed in your text, if there are 3 periods and 4 methods of manufacture in each period, how many rows will be needed? |
| | A) | 12. |
| | B) | 7. |
| | C) | 13. |
| | D) | 8. |
|
|
|
| 8 | |
In the linear programming formulation of the transportation problem, cost of transporting one unit of the material from a supply point to a demand point appears in |
| | A) | the objective function only. |
| | B) | the constraints only. |
| | C) | both objective function and constraints. |
| | D) | neither objective function nor constraints. |
|
|
|
| 9 | |
Data on cost, demand and supply for a balanced (total supply equals total demand) transportation problem is given in the table below. In the linear programming formulation of this transportation problem, with Xij denoting the amount shipped from supply point i (1 or 2) to demand point j (1, 2 or 3) the correct constraint to make sure that supply available in supply point #2 will be fully used is:
 <![CDATA[<a onClick="window.open('/olcweb/cgi/pluginpop.cgi?it=jpg::::/sites/dl/free/007299066x/335683/06_9.jpg','popWin', 'width=571,height=185,resizable,scrollbars');" href="#"><img valign="absmiddle" height="16" width="16" border="0" src="/olcweb/styles/shared/linkicons/image.gif"> (14.0K)</a>]]>
|
| | A) | 7X21 + 2X22 + 5X23 = 300 |
| | B) | X21 + X22 + X23 = 300 |
| | C) | 7X21 + 2X22 + 5X23 ≥ 300 |
| | D) | X21 + X22 + X23 ≥ 300 |
|
|
|
| 10 | |
In a transportation problem with total demand equal to 1200 and total supply equal to 900, we should add a _______________ _____________ with a quantity equal to ___________ to convert it to a balanced problem. |
| | A) | Dummy supply 300. |
| | B) | Dummy supply 2100. |
| | C) | Dummy demand 300. |
| | D) | Dummy demand 2100. |
|
|
|
| 11 | |
In the linear programming formulation of the transshipment problem, demand at the destination points are required to be satisfied from shipment from |
| | A) | origins. |
| | B) | intermediate points. |
| | C) | either origins or intermediated points. |
| | D) | origins or external sources. |
|
|
|
| 12 | |
A transshipment problem has 3 origins, 2 intermediate points and 4 destinations. The number of decision variables in the linear programming formulation of this problem will be |
| | A) | 24. |
| | B) | 9. |
| | C) | 48. |
| | D) | 14. |
|
|
.