Question 1

A(n) ________ problem is a special form of transportation problem where all supply and demand values equal 1.

Accepted Answer

assignment

Question 2

Assignments are made to locations with 0 in the opportunity cost table.

Accepted Answer

A) True 
 B)False  True

Question 3

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 give to cell C1 a loading of ________.

Accepted Answer

350 units

Question 4

Canning Transport wants to move goods from three (3) factories to three (3) distribution centers. Information about the move is given below:
 $$\begin{array}{l}
\text { Supply at Source }\
\hline
\begin{array} { r r } 
50 & \mathrm {~~~~~~~~~A} \
100 & \mathrm {~B} \
150 & \mathrm { C }
\end{array}\
\hline
\end{array}$$ 
 $$\begin{array}{l}
\text { Demand at Destination }\
\begin{aligned}
\hline 50 & ~~~~~~~~~~~~~~~~~~~~~~~\text { I } \
125 & ~~~~~~~~~~~~~~~~~~~~~~~\text { II } \
125 & ~~~~~~~~~~~~~~~~~~~~~~~\text { III }
\end{aligned}
\end{array}$$ Shipping costs are (in $):
 $$\begin{array} { l r r r } 
& \text { I } & \text { II } & \text { III } \
\hline \text { A } & 3 & 2 & 5 \
\text { B } & 9 & 10 & 12 \
\text { C } & 5 & 6 & 4 \
\hline
\end{array}$$
-According to the Vogel's Approximation Method, the initial solution would give to cell CII a loading of ________.

Accepted Answer

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

Question 5

The supply and demand values along the outside rim of a tableau are called

Accepted Answer

A)  rim requirements. 
B)  rim columns. 
C)  rim rows. 
D)  all of the above 
A)  rim requirements. 
B)  rim columns. 
C)  rim rows. 
D)  all of the above

Question 6

In an assignment problem,

Accepted Answer

A)  one agent can do parts of several tasks. 
B)  one task can be done by only one agent. 
C)  each agent is assigned to its own best task. 
D)  all of the above 
A)  one agent can do parts of several tasks. 
B)  one task can be done by only one agent. 
C)  each agent is assigned to its own best task. 
D)  all of the above

Question 7

In the linear programming formulation of a transportation network,

Accepted Answer

A)  there is one variable for each arc. 
B)  there is one constraint for each node. 
C)  the sum of variables corresponding to arcs out of an origin node is constrained by the supply at that node. 
D)  all of the above 
A)  there is one variable for each arc. 
B)  there is one constraint for each node. 
C)  the sum of variables corresponding to arcs out of an origin node is constrained by the supply at that node. 
D)  all of the above

Question 8

$$\begin{array} { l l r 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 are the supply-side constraints?

Accepted Answer

x₁₁ +x₁₂

Question 9

Which of the following assumptions is not an assumption of the transportation model?

Accepted Answer

A)  Shipping costs are constant. 
B)  There is only one transportation route between source and destination. 
C)  There is only one transportation mode between source and destination. 
D)  Actual supply and actual demand must be equal. 
A)  Shipping costs are constant. 
B)  There is only one transportation route between source and destination. 
C)  There is only one transportation mode between source and destination. 
D)  Actual supply and actual demand must be equal.

Question 10

In using the Vogel's Approximation model, a ________ is the difference between the largest and next largest cell cost in a row.

Accepted Answer

The answer of In using the Vogel's Approximation model, a...

Question 11

Which of the following assumptions is not an assumption of the transportation model?

Accepted Answer

A)  Shipping costs per unit are constant. 
B)  There is one transportation route between each source and destination. 
C)  There is one transportation mode between each source and destination. 
D)  Actual total supply and actual total demand must be equal. 
A)  Shipping costs per unit are constant. 
B)  There is one transportation route between each source and destination. 
C)  There is one transportation mode between each source and destination. 
D)  Actual total supply and actual total demand must be equal.

Question 12

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

Accepted Answer

The answer of When demand exceeds supply, a dummy ________...

Question 13

The ________ problem deals with the distribution of goods from several sources to several destinations.

Accepted Answer

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

Question 14

An assignment problem that involves 6 machines to be assigned to 4 workers cannot be solved using the assignment problem solution procedure described.

Accepted Answer

A) True 
 B)False

Question 15

The linear programming model for a transportation problem has constraints for

Accepted Answer

A)  supply at each source. 
B)  supply at each source and demand at each destination. 
C)  demand at each destination. 
D)  a feasible solution. 
A)  supply at each source. 
B)  supply at each source and demand at each destination. 
C)  demand at each destination. 
D)  a feasible solution.

Question 16

Assignments are made to locations with ________ in the opportunity cost table.

Accepted Answer

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

Question 17

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 Northwest Corner method, the initial solution would give to cell B2 a loading of ________.

Accepted Answer

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

Question 18

A transportation table that has a cell evaluation of 0 means that

Accepted Answer

A)  the table is optimal. 
B)  an equivalent alternative solution exists. 
C)  supply and demand are equal. 
D)  the solution is not optimal. 
A)  the table is optimal. 
B)  an equivalent alternative solution exists. 
C)  supply and demand are equal. 
D)  the solution is not optimal.

Question 19

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 give to cell B2 a loading of ________.

Accepted Answer

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

Question 20

Generally, ________ problems match people to an equal number of tasks at a minimum cost.

Accepted Answer

The answer of Generally, ________ problems match people to an...

A(n) ________ problem is a special form of transportation problem where all supply and demand values equal 1.

Assignments are made to locations with 0 in the opportunity cost table.

The supply and demand values along the outside rim of a tableau are called

In an assignment problem,

In the linear programming formulation of a transportation network,

SS 1 2 1 100 5 6 2 200 4 2 3 150 3 6 4 50 9 7 DD 250 250 What are the supply-side constraints?

Which of the following assumptions is not an assumption of the transportation model?

In using the Vogel's Approximation model, a ________ is the difference between the largest and next largest cell cost in a row.

Which of the following assumptions is not an assumption of the transportation model?

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

The ________ problem deals with the distribution of goods from several sources to several destinations.

An assignment problem that involves 6 machines to be assigned to 4 workers cannot be solved using the assignment problem solution procedure described.

The linear programming model for a transportation problem has constraints for

Assignments are made to locations with ________ in the opportunity cost table.

A transportation table that has a cell evaluation of 0 means that

Generally, ________ problems match people to an equal number of tasks at a minimum cost.

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

A(n) ________ problem is a special form of transportation problem where all supply and demand values equal 1.

Assignments are made to locations with 0 in the opportunity cost table.

The supply and demand values along the outside rim of a tableau are called

In an assignment problem,

In the linear programming formulation of a transportation network,

SS 1 2 1 100 5 6 2 200 4 2 3 150 3 6 4 50 9 7 DD 250 250 What are the supply-side constraints?

Which of the following assumptions is not an assumption of the transportation model?

In using the Vogel's Approximation model, a ________ is the difference between the largest and next largest cell cost in a row.

Which of the following assumptions is not an assumption of the transportation model?

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

The ________ problem deals with the distribution of goods from several sources to several destinations.

An assignment problem that involves 6 machines to be assigned to 4 workers cannot be solved using the assignment problem solution procedure described.

The linear programming model for a transportation problem has constraints for

Assignments are made to locations with ________ in the opportunity cost table.

A transportation table that has a cell evaluation of 0 means that

Generally, ________ problems match people to an equal number of tasks at a minimum cost.

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