Question 1

Why don't we want to use the transportation algorithm to solve the assignment problem?

Accepted Answer

A)  It would likely lead to an unbounded solution. 
B)  It would likely lead to a degenerate solution. 
C)  It would likely lead to an infeasible solution. 
D)  It would likely lead to multiple optima. 
E)  It would likely lead to an unbalanced solution. 
A)  It would likely lead to an unbounded solution. 
B)  It would likely lead to a degenerate solution. 
C)  It would likely lead to an infeasible solution. 
D)  It would likely lead to multiple optima. 
E)  It would likely lead to an unbalanced solution. B

Question 2

A certain firm has four different operations that must be assigned to four locations. The profit (in thousands of dollars) associated with each operation at each location is presented below. The firm's vice president would like to assign the various operations so that the total profit is maximized. Find the appropriate assignments.

Accepted Answer

Assign W to 2, X to 4, Y to 3, and Z to 1. Total profit = $48 (thousand)

Question 3

Table 9-2  
-In Table 9-2, cell A3 should be selected to be filled in the next solution. If this was selected as the cell to be filled, and the next solution was found using the appropriate stepping-stone path, how many units would be assigned to this cell?

Accepted Answer

A)  10 
B)  15 
C)  20 
D)  30 
E)  None of the above 
A)  10 
B)  15 
C)  20 
D)  30 
E)  None of the above B

Question 4

In an assignment problem

Accepted Answer

A)  the number of rows and columns must be equal. 
B)  the number of rows must exceed the number of columns. 
C)  the number of rows must equal or exceed the number of columns. 
D)  the number of columns must equal or exceed the number of rows. 
E)  None of the above 
A)  the number of rows and columns must be equal. 
B)  the number of rows must exceed the number of columns. 
C)  the number of rows must equal or exceed the number of columns. 
D)  the number of columns must equal or exceed the number of rows. 
E)  None of the above

Question 5

Which tableau is the solution to the following transportation table?Table 9-18

Accepted Answer

A)    
B)    
C)    
D)    
E)  None of the above 
A)    
B)    
C)    
D)    
E)  None of the above

Question 6

The two most common objectives for the assignment problem are the minimization of ________.

Accepted Answer

A)  uncertainty or inexperience 
B)  total costs or inexperience 
C)  total costs or total time 
D)  total time or inexperience 
E)  total costs or uncertainty 
A)  uncertainty or inexperience 
B)  total costs or inexperience 
C)  total costs or total time 
D)  total time or inexperience 
E)  total costs or uncertainty

Question 7

Which of the following is not part of the transportation algorithm?

Accepted Answer

A)  northwest corner rule 
B)  stepping-stone method 
C)  balanced transportation table 
D)  portfolio selection 
E)  Hungarian method 
A)  northwest corner rule 
B)  stepping-stone method 
C)  balanced transportation table 
D)  portfolio selection 
E)  Hungarian method

Question 8

Maximization assignment problems can easily be converted to minimization problems by subtracting each rating from the largest rating in the table.

Accepted Answer

A) True 
 B)False

Question 9

If items being transported must go through an intermediate point before reaching a final destination, then this situation is known as a(n) ________.

Accepted Answer

A)  transshipment problem 
B)  assignment problem 
C)  transportation problem 
D)  intermediate point problem 
E)  None of the above 
A)  transshipment problem 
B)  assignment problem 
C)  transportation problem 
D)  intermediate point problem 
E)  None of the above

Question 10

A "balanced problem" exists in a transportation model when the optimal solution has the same amount being shipped over all paths that have any positive shipment.

Accepted Answer

A) True 
 B)False

Question 11

It is possible to find an optimal solution to a transportation problem that is degenerate.

Accepted Answer

A) True 
 B)False

Question 12

The objective of an assignment problem solution most often is to minimize the total costs or time of performing the assigned tasks.

Accepted Answer

A) True 
 B)False

Question 13

Table 9-16  
-The solution shown in Table 9-16 is

Accepted Answer

A)  infeasible. 
B)  one of a number of alternate solutions. 
C)  unbounded. 
D)  optimal. 
E)  None of the above 
A)  infeasible. 
B)  one of a number of alternate solutions. 
C)  unbounded. 
D)  optimal. 
E)  None of the above

Question 14

In using the stepping-stone method, the path can turn at any box or cell that is unoccupied.

Accepted Answer

A) True 
 B)False

Question 15

After testing each unused cell by the stepping-stone method in the transportation problem and finding only one cell with a negative improvement index,

Accepted Answer

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 solution. 
D)  you should check to be sure that you don't have to add a dummy source or dummy destination. 
E)  None of the above 
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 solution. 
D)  you should check to be sure that you don't have to add a dummy source or dummy destination. 
E)  None of the above

Question 16

Table 9-12  
-Given Table 9-12, the final table for an assignment problem, who should be assigned to job 2?

Accepted Answer

A)  worker A 
B)  worker C 
C)  either worker A or worker C 
D)  neither worker A nor worker C 
E)  worker D 
A)  worker A 
B)  worker C 
C)  either worker A or worker C 
D)  neither worker A nor worker C 
E)  worker D

Question 17

Which tableau is the solution to the transportation problem depicted below?Table 9-17

Accepted Answer

A)    
B)    
C)    
D)    
E)  None of the above 
A)    
B)    
C)    
D)    
E)  None of the above

Question 18

Transportation models may be used when a firm is trying to decide where to locate a new facility.

Accepted Answer

A) True 
 B)False

Question 19

The objective of a transportation problem solution is to schedule shipments from sources to destinations while minimizing total transportation and production costs.

Accepted Answer

A) True 
 B)False

Question 20

Four projects must be completed, and each of four employees will be assigned to work on exactly one of the four projects. The table below presents an estimate of the cost that each employee would incur if working on the respective projects. What is the minimum-cost assignment of workers to projects?

Accepted Answer

MaryProject 2, Eliza

Why don't we want to use the transportation algorithm to solve the assignment problem?

Table 9-2 -In Table 9-2, cell A3 should be selected to be filled in the next solution. If this was selected as the cell to be filled, and the next solution was found using the appropriate stepping-stone path, how many units would be assigned to this cell?

In an assignment problem

Which tableau is the solution to the following transportation table?Table 9-18

The two most common objectives for the assignment problem are the minimization of ________.

Which of the following is not part of the transportation algorithm?

Maximization assignment problems can easily be converted to minimization problems by subtracting each rating from the largest rating in the table.

If items being transported must go through an intermediate point before reaching a final destination, then this situation is known as a(n) ________.

A "balanced problem" exists in a transportation model when the optimal solution has the same amount being shipped over all paths that have any positive shipment.

It is possible to find an optimal solution to a transportation problem that is degenerate.

The objective of an assignment problem solution most often is to minimize the total costs or time of performing the assigned tasks.

Table 9-16 -The solution shown in Table 9-16 is

In using the stepping-stone method, the path can turn at any box or cell that is unoccupied.

After testing each unused cell by the stepping-stone method in the transportation problem and finding only one cell with a negative improvement index,

Table 9-12 -Given Table 9-12, the final table for an assignment problem, who should be assigned to job 2?

Which tableau is the solution to the transportation problem depicted below?Table 9-17

Transportation models may be used when a firm is trying to decide where to locate a new facility.

The objective of a transportation problem solution is to schedule shipments from sources to destinations while minimizing total transportation and production costs.

Four projects must be completed, and each of four employees will be assigned to work on exactly one of the four projects. The table below presents an estimate of the cost that each employee would incur if working on the respective projects. What is the minimum-cost assignment of workers to projects?

Introduction to Quantitative Analysis

Probability Concepts and Applications

Decision Analysis

Regression Models

Forecasting

Inventory Control Models

Linear Programming Models: Graphical and Computer Methods

Linear Programming Applications

Integer Programming, Goal Programming, and Nonlinear Programming

Network Models

Project Management

Waiting Lines and Queuing Theory Models

Simulation Modeling

Markov Analysis

Statistical Quality Control

Filters

Exam 9: Transportation and Assignment Models

Why don't we want to use the transportation algorithm to solve the assignment problem?

Table 9-2 -In Table 9-2, cell A3 should be selected to be filled in the next solution. If this was selected as the cell to be filled, and the next solution was found using the appropriate stepping-stone path, how many units would be assigned to this cell?

In an assignment problem

Which tableau is the solution to the following transportation table?Table 9-18

The two most common objectives for the assignment problem are the minimization of ________.

Which of the following is not part of the transportation algorithm?

Maximization assignment problems can easily be converted to minimization problems by subtracting each rating from the largest rating in the table.

If items being transported must go through an intermediate point before reaching a final destination, then this situation is known as a(n) ________.

A "balanced problem" exists in a transportation model when the optimal solution has the same amount being shipped over all paths that have any positive shipment.

It is possible to find an optimal solution to a transportation problem that is degenerate.

The objective of an assignment problem solution most often is to minimize the total costs or time of performing the assigned tasks.

Table 9-16 -The solution shown in Table 9-16 is

In using the stepping-stone method, the path can turn at any box or cell that is unoccupied.

After testing each unused cell by the stepping-stone method in the transportation problem and finding only one cell with a negative improvement index,

Table 9-12 -Given Table 9-12, the final table for an assignment problem, who should be assigned to job 2?

Which tableau is the solution to the transportation problem depicted below?Table 9-17

Transportation models may be used when a firm is trying to decide where to locate a new facility.

The objective of a transportation problem solution is to schedule shipments from sources to destinations while minimizing total transportation and production costs.

Introduction to Quantitative Analysis

Probability Concepts and Applications

Decision Analysis

Regression Models

Forecasting

Inventory Control Models

Linear Programming Models: Graphical and Computer Methods

Linear Programming Applications

Integer Programming, Goal Programming, and Nonlinear Programming

Network Models

Project Management

Waiting Lines and Queuing Theory Models

Simulation Modeling

Markov Analysis

Statistical Quality Control

Filters