Question 1

If a transportation problem has four origins and five destinations, one of the destinations will not be fully supplied.

Accepted Answer

A) True 
 B)False

Question 2

​Explain how the Hungarian method can be used to solve an assignment problem that has a maximization objective.

Accepted Answer

The Hungarian method is a mathematical a

Question 3

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...

Question 4

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

Accepted Answer

A) True 
 B)False

Question 5

An example of a heuristic is the

Accepted Answer

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

Question 6

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

Accepted Answer

A) True 
 B)False

Question 7

​For an assignment problem where the number of agents does not equal the number of tasks, what adjustments must be made to allow the problem to be solved using the Hungarian method?

Accepted Answer

The Hungarian method is an algorithm use

Question 8

Al Bergman, staff traffic analyst at the corporate headquarters of Computer Products Corporation (CPC), is developing a monthly shipping plan for the El Paso and Atlanta manufacturing plants to follow next year. These plants manufacture specialized computer workstations that are shipped to five regional warehouses. Al has developed these estimated requirements and costs:   Determine how many workstations should be shipped per month from each plant to each warehouse to minimize monthly shipping costs, and compute the total shipping cost. 
a.
Use the minimum cost method to find an initial feasible solution.
b.
Use the transportation simplex method to find an optimal solution.
c.
Compute the optimal total shipping cost.

Accepted Answer

​
a. Initial feasible solution found usi

Question 9

​Explain how the transportation simplex method can be used to solve a transportation problem that has a maximization objective.

Accepted Answer

The transportation simplex method can be

Question 10

When an assignment problem involves an unacceptable assignment, a dummy agent or task must be introduced.

Accepted Answer

A) True 
 B)False

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

Accepted Answer

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

Question 12

​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. 
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 13

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

Accepted Answer

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

Question 14

​Explain what adjustments are made to the transportation tableau when total supply and total demand are not equal.

Accepted Answer

No answer

Question 15

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. 
A)  artificial variables. 
B)  one or more transshipment nodes. 
C)  a dummy origin or destination. 
D)  matrix reduction.

Question 16

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 17

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 18

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:
​​

Accepted Answer

​
​ @#IMG-DLM& ​
Tot

Question 19

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

Accepted Answer

A) True 
 B)False

Question 20

Consider the transportation problem below.
​​   ​ 
a.
Use the minimum cost method to find an initial feasible solution.
b.
Can the initial solution be improved?
c.
Compute the optimal total shipping cost.

Accepted Answer

​
a.The minimum cost method pr

If a transportation problem has four origins and five destinations, one of the destinations will not be fully supplied.

Explain how the Hungarian method can be used to solve an assignment problem that has a maximization objective.

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

An example of a heuristic is the

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

For an assignment problem where the number of agents does not equal the number of tasks, what adjustments must be made to allow the problem to be solved using the Hungarian method?

Explain how the transportation simplex method can be used to solve a transportation problem that has a maximization objective.

When an assignment problem involves an unacceptable assignment, a dummy agent or task must be introduced.

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

To use the transportation simplex method,

Develop the transportation tableau for this transportation problem.

Explain what adjustments are made to the transportation tableau when total supply and total demand are not equal.

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

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.

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.

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:

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

Consider the transportation problem below. a. Use the minimum cost method to find an initial feasible solution. b. Can the initial solution be improved? c. Compute the optimal total shipping cost.

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, Finance, and Operations Management

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

If a transportation problem has four origins and five destinations, one of the destinations will not be fully supplied.

​Explain how the Hungarian method can be used to solve an assignment problem that has a maximization objective.

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

An example of a heuristic is the

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

​For an assignment problem where the number of agents does not equal the number of tasks, what adjustments must be made to allow the problem to be solved using the Hungarian method?

​Explain how the transportation simplex method can be used to solve a transportation problem that has a maximization objective.

When an assignment problem involves an unacceptable assignment, a dummy agent or task must be introduced.

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

​To use the transportation simplex method,

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

​Explain what adjustments are made to the transportation tableau when total supply and total demand are not equal.

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

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. ​

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.

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: ​​

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

Consider the transportation problem below. ​​ ​ a. Use the minimum cost method to find an initial feasible solution. b. Can the initial solution be improved? c. Compute the optimal total shipping cost.

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, Finance, and Operations Management

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

Explain how the Hungarian method can be used to solve an assignment problem that has a maximization objective.

For an assignment problem where the number of agents does not equal the number of tasks, what adjustments must be made to allow the problem to be solved using the Hungarian method?

Explain how the transportation simplex method can be used to solve a transportation problem that has a maximization objective.

To use the transportation simplex method,

Develop the transportation tableau for this transportation problem.

Explain what adjustments are made to the transportation tableau when total supply and total demand are not equal.

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.

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:

Consider the transportation problem below. a. Use the minimum cost method to find an initial feasible solution. b. Can the initial solution be improved? c. Compute the optimal total shipping cost.