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.

Free

(Essay)

4.9/5

(32)

Question 1

Correct Answer:

Verified

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

Free

(True/False)

4.8/5

(41)

Question 2

Correct Answer:

Verified

True

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

Free

(True/False)

4.9/5

(37)

Question 3

Correct Answer:

Verified

False

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.

(True/False)

4.7/5

(27)

Question 4

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

(True/False)

4.7/5

(25)

Question 5

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?

(Essay)

4.7/5

(29)

Question 6

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

(Multiple Choice)

4.8/5

(28)

Question 7

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.

(Essay)

4.8/5

(43)

Question 8

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.

(Essay)

4.9/5

(32)

Question 9

The Hungarian method involves

(Multiple Choice)

4.9/5

(30)

Question 10

The difference between the transportation and assignment problems is that

(Multiple Choice)

4.7/5

(32)

Question 11

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

(Multiple Choice)

4.9/5

(32)

Question 12

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

(True/False)

4.9/5

(30)

Question 13

An example of a heuristic is the

(Multiple Choice)

4.8/5

(31)

Question 14

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

(Multiple Choice)

4.9/5

(43)

Question 15

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.

(True/False)

4.7/5

(34)

Question 16

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

(Multiple Choice)

4.9/5

(37)

Question 17

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

(Multiple Choice)

4.8/5

(30)

Question 18

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

(Multiple Choice)

4.9/5

(27)

Question 19

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

(True/False)

4.8/5

(39)

Question 20

Showing 1 - 20 of 39

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.

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, finance, and OM

Advanced Linear Programming Applications

Distribution and Network Models

Integer Linear Programming

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Time Series Analysis and Forecasting

Markov Processes

Linear Programming: Simplex Method

Simplex-Based Sensitivity Analysis and Duality

Minimal Spanning Tree

Dynamic Programming

Filters

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.

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, finance, and OM

Advanced Linear Programming Applications

Distribution and Network Models

Integer Linear Programming

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Time Series Analysis and Forecasting

Markov Processes

Linear Programming: Simplex Method

Simplex-Based Sensitivity Analysis and Duality

Minimal Spanning Tree

Dynamic Programming

Filters

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.