Biology Test
|BUAD – 555 Decision Science |October 3rd. |
| |2012 |
|Mini Exam # 2 | |
|Students’ Version | |
Chapter 9
Transportation and Assignment Models
True / False Questions
1) Transportation models may be used when a firm is trying to decide where to locate a new
2) In a transportation problem, each destination must be supplied by one and only one source.
3) One of the advantages of the stepping-stone method is that if, at a particular iteration, we accidentally choose a route that is not the best, the only penalty is to perform additional iterations.
4) The transportation algorithm can be used to solve both minimization problems and maximization problems.
5) In the assignment problem, the costs for a dummy row will be equal to the lowest cost of the column for each respective cell in that row.
Multiple Choice Questions:
6) Which of the following techniques can be used for moving from an initial feasible solution to an optimal solution in a transportation problem?
A) Hungarian method
B) stepping-stone method
C) northwest corner rule
D) Vogel's approximation method
E) All of the above
7) After testing each unused cell by the stepping-stone method in the transportation problem and finding only one cell with a negative improvement index,
A) once you make that improvement, you would definitely have an optimal solution.
B) you would make that improvement and then check all unused cells again.
C) you could stop because you already had the optimal
| |2012 |
|Mini Exam # 2 | |
|Students’ Version | |
Chapter 9
Transportation and Assignment Models
True / False Questions
1) Transportation models may be used when a firm is trying to decide where to locate a new
2) In a transportation problem, each destination must be supplied by one and only one source.
3) One of the advantages of the stepping-stone method is that if, at a particular iteration, we accidentally choose a route that is not the best, the only penalty is to perform additional iterations.
4) The transportation algorithm can be used to solve both minimization problems and maximization problems.
5) In the assignment problem, the costs for a dummy row will be equal to the lowest cost of the column for each respective cell in that row.
Multiple Choice Questions:
6) Which of the following techniques can be used for moving from an initial feasible solution to an optimal solution in a transportation problem?
A) Hungarian method
B) stepping-stone method
C) northwest corner rule
D) Vogel's approximation method
E) All of the above
7) After testing each unused cell by the stepping-stone method in the transportation problem and finding only one cell with a negative improvement index,
A) once you make that improvement, you would definitely have an optimal solution.
B) you would make that improvement and then check all unused cells again.
C) you could stop because you already had the optimal