Question 1

Consider the following transportation tableau which shows the initial solution. Evaluate the cost of allocating units to cell DR.

Accepted Answer

A)  -5 
B)  -2 
C)  0 
D)  3 
E)  5 
A)  -5 
B)  -2 
C)  0 
D)  3 
E)  5

Question 2

The three methods for identifying initial feasible solutions to transportation problems are ________, ________, and ________.

Accepted Answer

northwest corner met

Question 3

When supply exceeds demand, a dummy ________ is added to the solution tableau.

Accepted Answer

column or

Question 4

The problem that deals with the distribution of goods from several sources to several destinations is the

Accepted Answer

A)  network problem. 
B)  assignment problem. 
C)  transportation problem. 
D)  transshipment problem. 
A)  network problem. 
B)  assignment problem. 
C)  transportation problem. 
D)  transshipment problem.

Question 5

In a transportation problem, items are allocated from sources to destinations at a ________ cost.

Accepted Answer

A)  maximum 
B)  minimum 
C)  high 
D)  low 
A)  maximum 
B)  minimum 
C)  high 
D)  low

Question 6

An assignment problem is a special form of transportation problem where all supply and demand values equal:

Accepted Answer

A)  -1 or 1 
B)  -1 
C)  0 
D)  1 
A)  -1 or 1 
B)  -1 
C)  0 
D)  1

Question 7

Use the following table and the information to answer the questions below.
In the following transportation matrix, all cells except 2C have been evaluated and show no improvement. Evaluate that cell.
  
-Make the necessary allocation to cell 2C and determine the total transportation cost.

Accepted Answer

A)  936 
B)  928 
C)  908 
D)  852 
E)  878 
A)  936 
B)  928 
C)  908 
D)  852 
E)  878

Question 8

A(n) ________ solution occurs when the number of independent unique assignments equals the number of rows or columns.

Accepted Answer

The answer of A(n) ________ solution occurs when the number...

Question 9

An assignment problem is a special form of transportation problem where all supply and demand values equal 0.

Accepted Answer

A) True 
 B)False

Question 10

The transportation method is a linear programming technique where linearity can be found in which of the following ways?

Accepted Answer

A)  The cost of goods shipped from any source to any destination is a linear function of quantity shipped. 
B)  The total cost associated with a given plan is a linear function of shipping costs. 
C)  Cell evaluations assume linear movements through the matrix. 
D)  The cost of goods shipped from any source to any destination is a linear function of the cost per unit. 
A)  The cost of goods shipped from any source to any destination is a linear function of quantity shipped. 
B)  The total cost associated with a given plan is a linear function of shipping costs. 
C)  Cell evaluations assume linear movements through the matrix. 
D)  The cost of goods shipped from any source to any destination is a linear function of the cost per unit.

Question 11

When the number of people and the number of tasks are not equal in an assignment problem then the problem cannot be solved.

Accepted Answer

A) True 
 B)False

Question 12

Consider the following transportation tableau which shows the initial solution. Evaluate the cost of allocating units to cell CR.

Accepted Answer

A)  -12 
B)  -9 
C)  -6 
D)  -2 
E)  +3 
A)  -12 
B)  -9 
C)  -6 
D)  -2 
E)  +3

Question 13

The difference between the assignment and the transportation problem is that

Accepted Answer

A)  each supply and demand value is 1 in the assignment problem. 
B)  total supply must equal total demand in the transportation problem. 
C)  the number of origins must equal the number of destinations in the transportation problem. 
D)  all of the above 
A)  each supply and demand value is 1 in the assignment problem. 
B)  total supply must equal total demand in the transportation problem. 
C)  the number of origins must equal the number of destinations in the transportation problem. 
D)  all of the above

Question 14

$$\begin{array} { l l c r } 
& \text { SS } & 1 & 2 \
\hline 1 & 100 & 5 & 6 \
2 & 200 & 4 & 2 \
3 & 150 & 3 & 6 \
4 & 50 & 9 & 7 \
\hline \text { DD } & & 250 & 250
\end{array}$$ 
What is the objective function?

Accepted Answer

Min 5x₁₁ + 6x₁

Question 15

Given the following transportation tableau where the numbers in each cell represent transportation costs from the specific source to the specific destination with supply figures corresponding to each source and demand figures corresponding to each destination:
 $$\begin{array} { l c r c c c } 
& & &{ \text { Source } } \
& & \text { A } & \text { B } & \text { C } & \text { Demand } \
\hline  & 1 & \$ 2.2 & 2.4 & 2.1 & 350 \
{ \text { Destination } }& 2 & 3.4 & 3.2 & 3.6 & 400 \
& 3 & 1.9 & 1.8 & 2.1 & 200 \
Supply&&200 & 300 & 450\
\hline
\end{array}$$
-According to the minimum cell cost method, the initial solution would have a total transportation cost of ________.

Accepted Answer

The answer of Given the following transportation tableau where the...

Question 16

Given the following transportation tableau where the numbers in each cell represent transportation costs from the specific source to the specific destination with supply figures corresponding to each source and demand figures corresponding to each destination:
 $$\begin{array} { l c r c c c } 
& & &{ \text { Source } } \
& & \text { A } & \text { B } & \text { C } & \text { Demand } \
\hline  & 1 & \$ 2.2 & 2.4 & 2.1 & 350 \
{ \text { Destination } }& 2 & 3.4 & 3.2 & 3.6 & 400 \
& 3 & 1.9 & 1.8 & 2.1 & 200 \
Supply&&200 & 300 & 450\
\hline
\end{array}$$
-According to the Vogel's Approximation Method, the initial solution would have a total transportation cost of ________.

Accepted Answer

The answer of Given the following transportation tableau where the...

Question 17

A multiple optimal solution occurs when an empty cell has a cost change of ________ and all other empty cells are positive.

Accepted Answer

The answer of A multiple optimal solution occurs when an...

Question 18

In a balanced transportation model where supply equals demand, all constraints are inequalities.

Accepted Answer

A) True 
 B)False

Question 19

If the number of unique assignments is less than the number of rows or columns, a line test must be used.

Accepted Answer

A) True 
 B)False

Question 20

Transportation problems can be solved by the simplex method.

Accepted Answer

A) True 
 B)False

Consider the following transportation tableau which shows the initial solution. Evaluate the cost of allocating units to cell DR.

The three methods for identifying initial feasible solutions to transportation problems are , , and .

When supply exceeds demand, a dummy ________ is added to the solution tableau.

The problem that deals with the distribution of goods from several sources to several destinations is the

In a transportation problem, items are allocated from sources to destinations at a ________ cost.

An assignment problem is a special form of transportation problem where all supply and demand values equal:

Use the following table and the information to answer the questions below. In the following transportation matrix, all cells except 2C have been evaluated and show no improvement. Evaluate that cell. -Make the necessary allocation to cell 2C and determine the total transportation cost.

A(n) ________ solution occurs when the number of independent unique assignments equals the number of rows or columns.

An assignment problem is a special form of transportation problem where all supply and demand values equal 0.

The transportation method is a linear programming technique where linearity can be found in which of the following ways?

When the number of people and the number of tasks are not equal in an assignment problem then the problem cannot be solved.

Consider the following transportation tableau which shows the initial solution. Evaluate the cost of allocating units to cell CR.

The difference between the assignment and the transportation problem is that

SS 1 2 1 100 5 6 2 200 4 2 3 150 3 6 4 50 9 7 DD 250 250 What is the objective function?

A multiple optimal solution occurs when an empty cell has a cost change of ________ and all other empty cells are positive.

In a balanced transportation model where supply equals demand, all constraints are inequalities.

If the number of unique assignments is less than the number of rows or columns, a line test must be used.

Transportation problems can be solved by the simplex method.

Management Science

Linear Programming: Model Formulation and Graphical Solution

Linear Programming: Computer Solution and Sensitivity Analysis

Linear Programming: Modeling Examples

Integer Programming

Transportation, Transshipment, and Assignment Problems

Network Flow Models

Project Management

Multicriteria Decision Making

Nonlinear Programming

Probability and Statistics

Decision Analysis

Queuing Analysis

Simulation

Forecasting

Inventory Management

the Simplex Solution Method

Integer Programming: the Branch and Bound Method

Nonlinear Programming: Solution Techniques

Game Theory

Markov Analysis

Filters

Exam 18: Transportation and Assignment Solution Methods

Consider the following transportation tableau which shows the initial solution. Evaluate the cost of allocating units to cell DR.

The three methods for identifying initial feasible solutions to transportation problems are ________, ________, and ________.

When supply exceeds demand, a dummy ________ is added to the solution tableau.

The problem that deals with the distribution of goods from several sources to several destinations is the

In a transportation problem, items are allocated from sources to destinations at a ________ cost.

An assignment problem is a special form of transportation problem where all supply and demand values equal:

Use the following table and the information to answer the questions below. In the following transportation matrix, all cells except 2C have been evaluated and show no improvement. Evaluate that cell. -Make the necessary allocation to cell 2C and determine the total transportation cost.

A(n) ________ solution occurs when the number of independent unique assignments equals the number of rows or columns.

An assignment problem is a special form of transportation problem where all supply and demand values equal 0.

The transportation method is a linear programming technique where linearity can be found in which of the following ways?

When the number of people and the number of tasks are not equal in an assignment problem then the problem cannot be solved.

Consider the following transportation tableau which shows the initial solution. Evaluate the cost of allocating units to cell CR.

The difference between the assignment and the transportation problem is that

SS 1 2 1 100 5 6 2 200 4 2 3 150 3 6 4 50 9 7 DD 250 250 What is the objective function?

A multiple optimal solution occurs when an empty cell has a cost change of ________ and all other empty cells are positive.

In a balanced transportation model where supply equals demand, all constraints are inequalities.

If the number of unique assignments is less than the number of rows or columns, a line test must be used.

Transportation problems can be solved by the simplex method.

Management Science

Linear Programming: Model Formulation and Graphical Solution

Linear Programming: Computer Solution and Sensitivity Analysis

Linear Programming: Modeling Examples

Integer Programming

Transportation, Transshipment, and Assignment Problems

Network Flow Models

Project Management

Multicriteria Decision Making

Nonlinear Programming

Probability and Statistics

Decision Analysis

Queuing Analysis

Simulation

Forecasting

Inventory Management

the Simplex Solution Method

Integer Programming: the Branch and Bound Method

Nonlinear Programming: Solution Techniques

Game Theory

Markov Analysis

Filters

The three methods for identifying initial feasible solutions to transportation problems are , , and .