Quantitative Management - Week 8-10 Review - Mini Game

Which method is commonly used to find an initial feasible solution in transportation problems?

• Northwest Corner Rule Method

• Hungarian Method

• Stepping-Stone Method

• Modified Distribution Method

In a transportation problem, what indicates that the minimum cost solution has been found?

• All improvement indices are equal to zero

• All cells in the dummy row are empty

• All improvement indices are positive or zero

• All improvement indices are negative or zero

If the total demand is greater than the total capacity in a transportation problem, then......

• Dummy source must be added

• Both a dummy source and a dummy destination must be added

• Dummy destination must be added

• The optimal solution will be degenerated

If the number of filled cells in a transportation table does not equal the number of rows plus the number of columns minus 1, then the problem is said to be......

• Unbalanced

• Degenerate

• Feasible

• Non-optimal

Below is the initial solution of transportation problem using Vogel's Approximation Method (VAM). From the occupied cells labelled with capital letter V-Z, can you tell which one is filled out first? How many units are supposed to be delivered on that route?

• Cell with capital letter Z is filled out first; The delivered units on that route is 100

• Cell with capital letter Y is filled out first; The delivered units on that route is 200

• Cell with capital letter W is filled out first; The delivered units on that route is 200

• Cell with capital letter V is filled out first; The delivered units on that route is 100

Which method is commonly used to solve assignment problems?

• Northwest Corner Rule Method

• Hungarian Method

• Stepping-Stone Method

• Modified Distribution Method

In an assignment model, the optimal solution is found when the minimum number of vertical and horizontal straight lines necessary to cover all zeros in the table is......

• Equal the number of rows or columns

• Less than the number of rows or columns

• More than the number of rows or columns

• The same as the total number of rows plus columns minus 1

An assignment problem can be viewed as a transportation problem in which......

• Each source can be assigned to multiple destinations

• Destinations can be assigned to multiple sources

• Sources and destinations are interchangeable in assignments

• It will most likely have severe degeneracy issues

In an assignment problem, if there are more tasks than workers, what must be done to solve the problem?

• Add dummy workers

• Remove some tasks

• Change the cost structure

• Increase the number of workers

Which of the following statements is true regarding the Hungarian Method?

• It requires the cost matrix to be square

• It guarantees an optimal solution for assignment problems

• It can only be used for minimization problems

• It is less efficient than the Simplex Method