Question 1

In a transportation problem, a single source may supply something to all destinations.

Accepted Answer

A) True 
 B)False

Question 2

If we want to quickly arrive at a "feasible," but not necessarily "optimal" solution to the transportation problem, we will use the

Accepted Answer

A)  stepping-stone method. 
B)  northwest corner rule. 
C)  Vogel's approximation method. 
D)  MODI method. 
E)  Any of the above 
A)  stepping-stone method. 
B)  northwest corner rule. 
C)  Vogel's approximation method. 
D)  MODI method. 
E)  Any of the above

Question 3

Table 9-11  
-A company must assign mechanics to each of four jobs. The time involved varies according to individual abilities. Table 9-11 shows how many minutes it takes each mechanic to perform each job. If the optimal assignments are made, how many total minutes would be required for completing the jobs?

Accepted Answer

A)  0 
B)  4 
C)  17 
D)  16 
E)  None of the above 
A)  0 
B)  4 
C)  17 
D)  16 
E)  None of the above

Question 4

Transportation models can be used for which of the following decisions?

Accepted Answer

A)  facility location 
B)  production mix 
C)  media selection 
D)  portfolio selection 
E)  employee shift scheduling 
A)  facility location 
B)  production mix 
C)  media selection 
D)  portfolio selection 
E)  employee shift scheduling

Question 5

Which of the following is not considered a special situation with the transportation algorithm?

Accepted Answer

A)  unbalanced transportation problems 
B)  degeneracy 
C)  unconstrained transportation problems 
D)  more than one optimal solution 
E)  maximization transportation problems 
A)  unbalanced transportation problems 
B)  degeneracy 
C)  unconstrained transportation problems 
D)  more than one optimal solution 
E)  maximization transportation problems

Question 6

Both transportation and assignment problems are members of a category of LP techniques called ________.

Accepted Answer

A)  transshipment problems 
B)  Hungarian problems 
C)  source-destination problems 
D)  supply and demand problems 
E)  network flow problems 
A)  transshipment problems 
B)  Hungarian problems 
C)  source-destination problems 
D)  supply and demand problems 
E)  network flow problems

Question 7

Table 9-3   The following improvements are proved for Table 9-3:  
-The cell improvement indices for Table 9-3 suggest that the optimal solution has been found. Based on this solution, how many units would actually be sent from source C?

Accepted Answer

A)  10 
B)  170 
C)  180 
D)  250 
E)  None of the above 
A)  10 
B)  170 
C)  180 
D)  250 
E)  None of the above

Question 8

Using the stepping-stone method to solve a maximization problem, we would choose the route with the largest positive improvement index.

Accepted Answer

A) True 
 B)False

Question 9

If the total supply from the sources does not equal the total demand from the destinations in the transportation problem,

Accepted Answer

A)  and if supply is greater than demand, add a dummy source or factory. 
B)  the amount put in a dummy source or destination should make supply and demand equal. 
C)  and if demand is greater than supply, add a dummy destination or warehouse. 
D)  All of the above 
E)  None of the above 
A)  and if supply is greater than demand, add a dummy source or factory. 
B)  the amount put in a dummy source or destination should make supply and demand equal. 
C)  and if demand is greater than supply, add a dummy destination or warehouse. 
D)  All of the above 
E)  None of the above

Question 10

Which technique requires that we start in the upper-left-hand cell of the table and allocate units to shipping routes in a "stair step" fashion?

Accepted Answer

A)  upper-left rule 
B)  stair step method 
C)  northwest corner rule 
D)  Vogel's approximation method 
E)  MODI 
A)  upper-left rule 
B)  stair step method 
C)  northwest corner rule 
D)  Vogel's approximation method 
E)  MODI

Question 11

Table 9-3   The following improvements are proved for Table 9-3:  
-In Table 9-3, suppose shipping cost from source C to point 2 was 8, which below would be true?

Accepted Answer

A)  There would be multiple optimal solutions. 
B)  The minimum possible total cost would decrease. 
C)  The minimum possible total cost would increase. 
D)  Another dummy column would be needed. 
E)  None of the above 
A)  There would be multiple optimal solutions. 
B)  The minimum possible total cost would decrease. 
C)  The minimum possible total cost would increase. 
D)  Another dummy column would be needed. 
E)  None of the above

Question 12

Table 9-14  
-The solution presented in Table 9-14 is

Accepted Answer

A)  infeasible. 
B)  degenerate. 
C)  unbounded. 
D)  optimal. 
E)  Both B and D 
A)  infeasible. 
B)  degenerate. 
C)  unbounded. 
D)  optimal. 
E)  Both B and D

Question 13

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

Accepted Answer

A)  infeasible. 
B)  degenerate. 
C)  unbounded. 
D)  optimal. 
E)  None of the above 
A)  infeasible. 
B)  degenerate. 
C)  unbounded. 
D)  optimal. 
E)  None of the above

Question 14

Table 9-7  
-Table 9-7 illustrates a(n)

Accepted Answer

A)  optimal solution. 
B)  degenerate solution. 
C)  unbounded solution. 
D)  infeasible solution. 
E)  None of the above 
A)  optimal solution. 
B)  degenerate solution. 
C)  unbounded solution. 
D)  infeasible solution. 
E)  None of the above

Question 15

In finding the maximum quantity that can be shipped on the least costly route using the stepping-stone method, one examines the closed path of plus and minus signs drawn and selects the smallest number found in those squares containing minus signs.

Accepted Answer

A) True 
 B)False

Question 16

Which of the following statements concerning the transshipment problem are false?

Accepted Answer

A)  The number of units shipped into a transshipment point should be equal to the number of units shipped out. 
B)  There can be constraints on the number of units shipped out of an origin point. 
C)  There can be constraints on the number of units shipped into a destination point. 
D)  The transshipment problem can be solved with linear programming. 
E)  Any units shipped from one origin point must all go to the same destination point. 
A)  The number of units shipped into a transshipment point should be equal to the number of units shipped out. 
B)  There can be constraints on the number of units shipped out of an origin point. 
C)  There can be constraints on the number of units shipped into a destination point. 
D)  The transshipment problem can be solved with linear programming. 
E)  Any units shipped from one origin point must all go to the same destination point.

Question 17

Which of the following techniques can be used for moving from an initial feasible solution to an optimal solution in a transportation problem?

Accepted Answer

A)  Hungarian method 
B)  stepping-stone method 
C)  northwest corner rule 
D)  Vogel's approximation method 
E)  All of the above 
A)  Hungarian method 
B)  stepping-stone method 
C)  northwest corner rule 
D)  Vogel's approximation method 
E)  All of the above

Question 18

Table 9-7  
-The only restriction we place on the initial solution of a transportation problem is that

Accepted Answer

A)  we must have nonzero quantities in a majority of the boxes. 
B)  all constraints must be satisfied. 
C)  demand must be less than supply. 
D)  we must have a number (equal to the number of rows plus the number of columns minus one) of boxes that contain nonzero quantities. 
E)  None of the above 
A)  we must have nonzero quantities in a majority of the boxes. 
B)  all constraints must be satisfied. 
C)  demand must be less than supply. 
D)  we must have a number (equal to the number of rows plus the number of columns minus one) of boxes that contain nonzero quantities. 
E)  None of the above

Question 19

When using a general LP model for transportation problems, if there are 4 sources and 3 destinations, which of the following statements is true?

Accepted Answer

A)  There are typically 4 decision variables and 3 constraints. 
B)  There are typically 12 decision variables and 7 constraints. 
C)  There are typically 7 decision variables and 7 constraints. 
D)  There are typically 12 decision variables and 12 constraints. 
E)  There are typically 12 decision variables and 3 constraints. 
A)  There are typically 4 decision variables and 3 constraints. 
B)  There are typically 12 decision variables and 7 constraints. 
C)  There are typically 7 decision variables and 7 constraints. 
D)  There are typically 12 decision variables and 12 constraints. 
E)  There are typically 12 decision variables and 3 constraints.

Question 20

What is meant by a balanced transportation problem?

Accepted Answer

a situation in which

In a transportation problem, a single source may supply something to all destinations.

If we want to quickly arrive at a "feasible," but not necessarily "optimal" solution to the transportation problem, we will use the

Transportation models can be used for which of the following decisions?

Which of the following is not considered a special situation with the transportation algorithm?

Both transportation and assignment problems are members of a category of LP techniques called ________.

Table 9-3 The following improvements are proved for Table 9-3: -The cell improvement indices for Table 9-3 suggest that the optimal solution has been found. Based on this solution, how many units would actually be sent from source C?

Using the stepping-stone method to solve a maximization problem, we would choose the route with the largest positive improvement index.

If the total supply from the sources does not equal the total demand from the destinations in the transportation problem,

Which technique requires that we start in the upper-left-hand cell of the table and allocate units to shipping routes in a "stair step" fashion?

Table 9-3 The following improvements are proved for Table 9-3: -In Table 9-3, suppose shipping cost from source C to point 2 was 8, which below would be true?

Table 9-14 -The solution presented in Table 9-14 is

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

Table 9-7 -Table 9-7 illustrates a(n)

In finding the maximum quantity that can be shipped on the least costly route using the stepping-stone method, one examines the closed path of plus and minus signs drawn and selects the smallest number found in those squares containing minus signs.

Which of the following statements concerning the transshipment problem are false?

Which of the following techniques can be used for moving from an initial feasible solution to an optimal solution in a transportation problem?

Table 9-7 -The only restriction we place on the initial solution of a transportation problem is that

When using a general LP model for transportation problems, if there are 4 sources and 3 destinations, which of the following statements is true?

What is meant by a balanced transportation problem?

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

In a transportation problem, a single source may supply something to all destinations.

If we want to quickly arrive at a "feasible," but not necessarily "optimal" solution to the transportation problem, we will use the

Transportation models can be used for which of the following decisions?

Which of the following is not considered a special situation with the transportation algorithm?

Both transportation and assignment problems are members of a category of LP techniques called ________.

Table 9-3 The following improvements are proved for Table 9-3: -The cell improvement indices for Table 9-3 suggest that the optimal solution has been found. Based on this solution, how many units would actually be sent from source C?

Using the stepping-stone method to solve a maximization problem, we would choose the route with the largest positive improvement index.

If the total supply from the sources does not equal the total demand from the destinations in the transportation problem,

Which technique requires that we start in the upper-left-hand cell of the table and allocate units to shipping routes in a "stair step" fashion?

Table 9-3 The following improvements are proved for Table 9-3: -In Table 9-3, suppose shipping cost from source C to point 2 was 8, which below would be true?

Table 9-14 -The solution presented in Table 9-14 is

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

Table 9-7 -Table 9-7 illustrates a(n)

In finding the maximum quantity that can be shipped on the least costly route using the stepping-stone method, one examines the closed path of plus and minus signs drawn and selects the smallest number found in those squares containing minus signs.

Which of the following statements concerning the transshipment problem are false?

Which of the following techniques can be used for moving from an initial feasible solution to an optimal solution in a transportation problem?

Table 9-7 -The only restriction we place on the initial solution of a transportation problem is that

When using a general LP model for transportation problems, if there are 4 sources and 3 destinations, which of the following statements is true?

What is meant by a balanced transportation problem?

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