Question 1

The transportation simplex method is a two-phase method that first finds an initial feasible solution and then makes iterative improvements in the solution until an optimal solution is reached.

Accepted Answer

A) True 
 B)False

Question 2

Five customers needing their tax returns prepared must be assigned to five tax accountants.The estimated profits for all possible assignments are shown below.Only one accountant can be assigned to a customer,and all customers' tax returns must be prepared.What should the customer-accountant assignments be so that estimated total profit is maximized? What is the resulting total profit?
​

Accepted Answer

The answer of Five customers needing their tax returns prepared...

Question 3

Solve the following transportation problem using the transportation simplex method.State the minimum total shipping cost.  ​
Shipping costs are as follows:

Accepted Answer

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

Question 4

A professor has been contacted by four not-for-profit agencies that are willing to work with student consulting teams.The agencies need help with such things as budgeting,information systems,coordinating volunteers,and forecasting.Although each of the four student teams could work with any of the agencies,the professor feels that there is a difference in the amount of time it would take each group to solve each problem.The professor's estimate of the time,in days,is given in the table below.Use the Hungarian method to determine which team works with which project.All projects must be assigned,and no team can be assigned to more than one project.​

Accepted Answer

The answer of A professor has been contacted by four...

Question 5

​Develop the transportation tableau for this transportation problem.​  ​
​

Accepted Answer

The answer of ​Develop the transportation tableau for this transportation...

Question 6

Finding an initial feasible solution can be done by using a heuristic procedure.

Accepted Answer

A) True 
 B)False

Question 7

The transportation simplex method is more efficient than general-purpose linear programming for solving large-sized transportation problems.

Accepted Answer

A) True 
 B)False

Question 8

Four jobs must be assigned to four work centers.Only one job can be assigned to each work center,and all jobs must be processed.The cost of processing each job at each work center is shown below.Determine which jobs should be assigned to which work center to minimize total processing cost.Compute the total processing cost.​
​

Accepted Answer

The answer of Four jobs must be assigned to four...

Question 9

In assignment problems,dummy agents or tasks are created when the number of agents and tasks is not equal.

Accepted Answer

A) True 
 B)False

Question 10

Four employees must be assigned to four projects.Only one employee can be assigned to each project,and all projects must be completed.The cost of each employee completing each project is shown below.Determine which employee should be assigned to which project to minimize total project completion cost.Be sure to compute the total project completion cost.​

Accepted Answer

The answer of Four employees must be assigned to four...

Question 11

To handle unacceptable routes in a transportation problem where cost is to be minimized,infeasible arcs must be assigned negative cost values.

Accepted Answer

A) True 
 B)False

Question 12

Canning Transport is to move goods from three factories (origins)to three distribution centers (destinations).Information about the move is given below.Solve the problem using the transportation simplex method and compute the total shipping cost.  ​
Shipping costs are as follows:
​  ​

Accepted Answer

The answer of Canning Transport is to move goods from...

Question 13

In the transportation simplex method,when total supply is greater than total demand,we introduce a dummy destination with demand less than the excess of supply over demand.

Accepted Answer

A) True 
 B)False

Question 14

The transportation simplex method is limited to minimization problems.

Accepted Answer

A) True 
 B)False

Question 15

Identifying the outgoing arc in phase II of the transportation simplex method is performed using the

Accepted Answer

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

Question 16

The following table shows the unit shipping cost between cities,the supply at each origin city,and the demand at each destination city.Solve this minimization problem using the transportation simplex method and compute the optimal total cost.  ​

Accepted Answer

The answer of The following table shows the unit shipping...

Question 17

To use the transportation simplex method,

Accepted Answer

A) there can be no unacceptable routes. 
B) the initial feasible solution cannot be degenerate. 
C) a minimization objective function must be the case. 
D) total supply must equal total demand.

Question 18

The optimal solution is found in an assignment matrix when the minimum number of straight lines needed to cover all the zeros equals

Accepted Answer

A) number of agents − 1. 
B) number of agents. 
C) number of agents + 1. 
D) number of agents + number of tasks.

Question 19

To use the transportation simplex method,a transportation problem that is unbalanced requires the use of

Accepted Answer

A) artificial variables. 
B) one or more transshipment nodes. 
C) a dummy origin or destination. 
D) matrix reduction.

Exam 19: Solution Procedures for Transportation and Assignment Problems

The transportation simplex method is a two-phase method that first finds an initial feasible solution and then makes iterative improvements in the solution until an optimal solution is reached.

Solve the following transportation problem using the transportation simplex method.State the minimum total shipping cost. Shipping costs are as follows:

Develop the transportation tableau for this transportation problem.

Finding an initial feasible solution can be done by using a heuristic procedure.

The transportation simplex method is more efficient than general-purpose linear programming for solving large-sized transportation problems.

In assignment problems,dummy agents or tasks are created when the number of agents and tasks is not equal.

To handle unacceptable routes in a transportation problem where cost is to be minimized,infeasible arcs must be assigned negative cost values.

Canning Transport is to move goods from three factories (origins)to three distribution centers (destinations).Information about the move is given below.Solve the problem using the transportation simplex method and compute the total shipping cost. Shipping costs are as follows:

In the transportation simplex method,when total supply is greater than total demand,we introduce a dummy destination with demand less than the excess of supply over demand.

The transportation simplex method is limited to minimization problems.

Identifying the outgoing arc in phase II of the transportation simplex method is performed using the

The following table shows the unit shipping cost between cities,the supply at each origin city,and the demand at each destination city.Solve this minimization problem using the transportation simplex method and compute the optimal total cost.

To use the transportation simplex method,

The optimal solution is found in an assignment matrix when the minimum number of straight lines needed to cover all the zeros equals

To use the transportation simplex method,a transportation problem that is unbalanced requires the use of

Exam 19: Solution Procedures for Transportation and Assignment Problems

The transportation simplex method is a two-phase method that first finds an initial feasible solution and then makes iterative improvements in the solution until an optimal solution is reached.

Solve the following transportation problem using the transportation simplex method.State the minimum total shipping cost. ​ Shipping costs are as follows:

​Develop the transportation tableau for this transportation problem.​ ​ ​

Finding an initial feasible solution can be done by using a heuristic procedure.

The transportation simplex method is more efficient than general-purpose linear programming for solving large-sized transportation problems.

In assignment problems,dummy agents or tasks are created when the number of agents and tasks is not equal.

To handle unacceptable routes in a transportation problem where cost is to be minimized,infeasible arcs must be assigned negative cost values.

Canning Transport is to move goods from three factories (origins)to three distribution centers (destinations).Information about the move is given below.Solve the problem using the transportation simplex method and compute the total shipping cost. ​ Shipping costs are as follows: ​ ​

In the transportation simplex method,when total supply is greater than total demand,we introduce a dummy destination with demand less than the excess of supply over demand.

The transportation simplex method is limited to minimization problems.

Identifying the outgoing arc in phase II of the transportation simplex method is performed using the

The following table shows the unit shipping cost between cities,the supply at each origin city,and the demand at each destination city.Solve this minimization problem using the transportation simplex method and compute the optimal total cost. ​

To use the transportation simplex method,

The optimal solution is found in an assignment matrix when the minimum number of straight lines needed to cover all the zeros equals

To use the transportation simplex method,a transportation problem that is unbalanced requires the use of

Solve the following transportation problem using the transportation simplex method.State the minimum total shipping cost. Shipping costs are as follows:

Develop the transportation tableau for this transportation problem.

Canning Transport is to move goods from three factories (origins)to three distribution centers (destinations).Information about the move is given below.Solve the problem using the transportation simplex method and compute the total shipping cost. Shipping costs are as follows:

The following table shows the unit shipping cost between cities,the supply at each origin city,and the demand at each destination city.Solve this minimization problem using the transportation simplex method and compute the optimal total cost.