Question 1

Use the Hungarian method to obtain the optimal solution to the following assignment problem in which total cost is to be minimized.All tasks must be assigned,and no agent can be assigned to more than one task.​

Accepted Answer

​

Question 2

The net evaluation index for occupied cells in the transportation simplex method is 0.

Accepted Answer

A) True 
 B)False  True

Question 3

A dummy origin in a transportation problem is used when supply exceeds demand.

Accepted Answer

A) True 
 B)False  False

Question 4

Using the Hungarian method,the optimal solution to an assignment problem is found when the minimum number of lines required to cover the zero cells in the reduced matrix equals the number of agents.

Accepted Answer

A) True 
 B)False

Question 5

Optimal assignments are made in the Hungarian method to cells in the reduced matrix that contain a 0.

Accepted Answer

A) True 
 B)False

Question 6

A large screen printer is faced with six jobs due on Tuesday.The plan is to do the jobs on Monday so they will be ready on time.The shop has six worker-machine pairs that can work on any of the six jobs.Because of differing experience levels and machine capabilities,processing times differ.The processing times presented in the table below are in minutes.What is the optimal assignment of jobs to worker-machine pairs that minimizes total processing time?
​  ​
​

Accepted Answer

The answer of A large screen printer is faced with...

Question 7

Using the transportation simplex method,the optimal solution to the transportation problem has been found when

Accepted Answer

A)  there is a shipment in every cell.
B)  more than one stepping-stone path is available.
C)  there is a tie for the outgoing cell.
D)  the net evaluation index for each unoccupied cell is ≥ 0.

Question 8

After some special presentations,the employees of the AV Center have to move overhead projectors back to classrooms.The table below indicates the buildings where the projectors are now (the origins),where they need to go (the destinations),and a measure of the distance between sites.Determine the transport arrangement that minimizes the total transport distance.

Accepted Answer

The answer of After some special presentations,the employees of the...

Question 9

Solve the following assignment problem using the Hungarian method.No agent can be assigned to more than one task.Total cost is to be minimized.​

Accepted Answer

The answer of Solve the following assignment problem using the...

Question 10

The Hungarian method involves

Accepted Answer

A)  matrix reduction.
B)  subtracting and adding appropriate values to yield an optimal solution.
C)  continuing iteratively until the value of one of the solutions is zero.
D)  All of these are correct.

Question 11

The difference between the transportation and assignment problems is that

Accepted Answer

A)  total supply must equal total demand in the transportation problem.
B)  the number of origins must equal the number of destinations in the transportation problem.
C)  each supply and demand value is 1 in the assignment problem.
D)  There are many differences between the transportation and assignment problems.

Question 12

The per-unit change in the objective function associated with assigning flow to an unused arc in the transportation simplex method is called the

Accepted Answer

A)  net evaluation index.
B)  degenerate value.
C)  opportunity loss.
D)  simplex multiplier.

Question 13

The transportation simplex method can be used to solve the assignment problem.

Accepted Answer

A) True 
 B)False

Question 14

An example of a heuristic is the

Accepted Answer

A)  minimum cost method.
B)  stepping-stone method.
C)  Hungarian method.
D)  MODI method.

Question 15

A solution to a transportation problem that has less than m + n − 1 cells with positive allocations in the transportation tableau is a(n)

Accepted Answer

A)  optimal solution.
B)  initial feasible solution.
C)  minimum cost solution.
D)  degenerate solution.

Question 16

The transportation simplex method can be applied only to a balanced problem; if a problem is not balanced,a dummy origin or dummy destination must be added.

Accepted Answer

A) True 
 B)False

Question 17

In order to identify the arc that will cause the largest reduction per unit in the total cost of the current solution,we use the MODI method.The MODI method is used to identify

Accepted Answer

A)  an outgoing arc.
B)  an incoming arc.
C)  unoccupied cells.
D)  an initial feasible solution.

Question 18

To use the Hungarian method,a profit-maximization assignment problem requires

Accepted Answer

A)  converting all profits to opportunity losses.
B)  a dummy agent or task.
C)  matrix expansion.
D)  finding the maximum number of lines to cover all the zeros in the reduced matrix.

Question 19

The stepping-stone method requires that one or more artificially occupied cells with a flow of zero be created in the transportation tableau when the number of occupied cells is fewer than

Accepted Answer

A)  m + n − 2.
B)  m + n − 1.
C)  m + n.
D)  m + n + 1.

Question 20

For an assignment problem with three agents and four tasks,the assignment matrix will have three rows and four columns.

Accepted Answer

A) True 
 B)False

Exam 19: Solution Procedures for Transportation and Assignment Problems

Use the Hungarian method to obtain the optimal solution to the following assignment problem in which total cost is to be minimized.All tasks must be assigned,and no agent can be assigned to more than one task.​

The net evaluation index for occupied cells in the transportation simplex method is 0.

A dummy origin in a transportation problem is used when supply exceeds demand.

Using the Hungarian method,the optimal solution to an assignment problem is found when the minimum number of lines required to cover the zero cells in the reduced matrix equals the number of agents.

Optimal assignments are made in the Hungarian method to cells in the reduced matrix that contain a 0.

Using the transportation simplex method,the optimal solution to the transportation problem has been found when

Solve the following assignment problem using the Hungarian method.No agent can be assigned to more than one task.Total cost is to be minimized.​

The Hungarian method involves

The difference between the transportation and assignment problems is that

The per-unit change in the objective function associated with assigning flow to an unused arc in the transportation simplex method is called the

The transportation simplex method can be used to solve the assignment problem.

An example of a heuristic is the

A solution to a transportation problem that has less than m + n − 1 cells with positive allocations in the transportation tableau is a(n)

The transportation simplex method can be applied only to a balanced problem; if a problem is not balanced,a dummy origin or dummy destination must be added.

In order to identify the arc that will cause the largest reduction per unit in the total cost of the current solution,we use the MODI method.The MODI method is used to identify

To use the Hungarian method,a profit-maximization assignment problem requires

The stepping-stone method requires that one or more artificially occupied cells with a flow of zero be created in the transportation tableau when the number of occupied cells is fewer than

For an assignment problem with three agents and four tasks,the assignment matrix will have three rows and four columns.

Use the Hungarian method to obtain the optimal solution to the following assignment problem in which total cost is to be minimized.All tasks must be assigned,and no agent can be assigned to more than one task.

Solve the following assignment problem using the Hungarian method.No agent can be assigned to more than one task.Total cost is to be minimized.