Question 1

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

Accepted Answer

A)  more than 
B)  less than 
C)  higher than 
D)  equal to 
A)  more than 
B)  less than 
C)  higher than 
D)  equal to

Question 2

An independent operator is planning shipments of gasoline from two sources to three destinations. Per ton transportation costs are given in the following table.   
There are 1000 tons available at A and 1300 tons available at B. Since the destinations want as much as possible, the owner has decided to ship out all available quantities. Solve using either stepping stone or MODI.

Accepted Answer

1300 tons will be sent to D an

Question 3

The linear programming model for a transportation problem has constraints for supply at each source and demand at each destination.

Accepted Answer

A) True 
 B)False

Question 4

The student internship director needs as much coverage as possible in the office next week. The more hours that can be put in each day, the better. She has asked the students to provide a list of how many hours they are available each day of the week. Each student can be there on only one day and there must be a student in the office each day of the week. Use the table below and the tables provided to determine the schedule that gives the most coverage. Note that the objective of this problem is to maximize the hours worked, not minimize.
 $$\begin{array} { | c | c | c | c | c | c | } 
\hline \text { Student } & \text { Mon } & \text { Tue } & \text { Wed } & \text { Thurs } & \text { Fri } \
\hline \text { A } & 2 & 4 & 8 & 4 & 6 \
\hline \text { B } & 3 & 2 & 7 & 3 & 2 \
\hline \text { C } & 6 & 8 & 6 & 5 & 4 \
\hline \text { D } & 7 & 4 & 3 & 6 & 8 \
\hline \text { E } & 4 & 5 & 3 & 1 & 4 \
\hline
\end{array}$$

Accepted Answer

1. Convert to a minimization problem by

Question 5

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.
  
-What is the reduced cost if we decide to allocate to cell 2C?

Accepted Answer

A)  -2 
B)  -1 
C)  0 
D)  +1 
E)  +2 
A)  -2 
B)  -1 
C)  0 
D)  +1 
E)  +2

Question 6

Consider the following transportation tableau with the initial solution provided. Use the stepping stone method to identify a better allocation.

Accepted Answer

The answer of Consider the following transportation tableau with the...

Question 7

The transportation method assumes that

Accepted Answer

A)  the number of rows is equal to the number of columns. 
B)  there must be at least 2 rows and at least 2 columns. 
C)  both A and B 
D)  the product of rows minus 1 and columns minus 1 should not be less than the number of completed cells. 
A)  the number of rows is equal to the number of columns. 
B)  there must be at least 2 rows and at least 2 columns. 
C)  both A and B 
D)  the product of rows minus 1 and columns minus 1 should not be less than the number of completed cells.

Question 8

The transportation model assumes that shipping costs are the same, regardless of the number of units shipped.

Accepted Answer

A) True 
 B)False

Question 9

Which of the following are assumptions or requirements of the transportation problem?

Accepted Answer

A)  Minimum quantities must be shipped. 
B)  Shipping costs per unit do not vary with the quantity shipped. 
C)  There can only be one source. 
D)  all of the above 
A)  Minimum quantities must be shipped. 
B)  Shipping costs per unit do not vary with the quantity shipped. 
C)  There can only be one source. 
D)  all of the above

Question 10

The transportation model is a special type of linear regression model.

Accepted Answer

A) True 
 B)False

Question 11

It is not possible to solve a transportation problem that has ≤ instead of = signs for the supply constraints.

Accepted Answer

A) True 
 B)False

Question 12

An optimal solution occurs when the number of independent unique assignments equals the number of rows or columns.

Accepted Answer

A) True 
 B)False

Question 13

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

Accepted Answer

A) True 
 B)False

Question 14

In a transportation tableau with m rows and n columns, if there are fewer than n+m-1 allocations, the tableau is said to be ________.

Accepted Answer

The answer of In a transportation tableau with m rows...

Question 15

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

Accepted Answer

A)  inequalities. 
B)  equalities. 
C)  A and B 
D)  none of the above 
A)  inequalities. 
B)  equalities. 
C)  A and B 
D)  none of the above

Question 16

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 have a total transportation cost of ________.

Accepted Answer

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

Question 17

Vogel's approximation method allocates to the minimum cost cell in the row or column with the ________ penalty cost.

Accepted Answer

The answer of Vogel's approximation method allocates to the minimum...

Question 18

A transportation table contains an optimal solution when all the empty cell evaluations are

Accepted Answer

A)  positive or 0. 
B)  negative or 0. 
C)  positive. 
D)  negative. 
A)  positive or 0. 
B)  negative or 0. 
C)  positive. 
D)  negative.

Question 19

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

Accepted Answer

A)  maximum cost. 
B)  minimum cost. 
C)  minimum profit. 
D)  minimum revenue. 
A)  maximum cost. 
B)  minimum cost. 
C)  minimum profit. 
D)  minimum revenue.

Question 20

Which of the following are assumptions or requirements of transportation problems?
I. Goods are the same from each source.
II. There must be a single source.
III. Minimum quantities must be shipped.
IV. Shipping costs per unit do not vary with the quantity shipped.

Accepted Answer

A)  I and III 
B)  I, II, and IV 
C)  I and IV 
D)  II and III 
A)  I and III 
B)  I, II, and IV 
C)  I and IV 
D)  II and III

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

The linear programming model for a transportation problem has constraints for supply at each source and demand at each destination.

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. -What is the reduced cost if we decide to allocate to cell 2C?

Consider the following transportation tableau with the initial solution provided. Use the stepping stone method to identify a better allocation.

The transportation method assumes that

The transportation model assumes that shipping costs are the same, regardless of the number of units shipped.

Which of the following are assumptions or requirements of the transportation problem?

The transportation model is a special type of linear regression model.

It is not possible to solve a transportation problem that has ≤ instead of = signs for the supply constraints.

An optimal 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 1.

In a transportation tableau with m rows and n columns, if there are fewer than n+m-1 allocations, the tableau is said to be ________.

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

Vogel's approximation method allocates to the minimum cost cell in the row or column with the ________ penalty cost.

A transportation table contains an optimal solution when all the empty cell evaluations are

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

Which of the following are assumptions or requirements of transportation problems? I. Goods are the same from each source. II. There must be a single source. III. Minimum quantities must be shipped. IV. Shipping costs per unit do not vary with the quantity shipped.

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

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

The linear programming model for a transportation problem has constraints for supply at each source and demand at each destination.

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. -What is the reduced cost if we decide to allocate to cell 2C?

Consider the following transportation tableau with the initial solution provided. Use the stepping stone method to identify a better allocation.

The transportation method assumes that

The transportation model assumes that shipping costs are the same, regardless of the number of units shipped.

Which of the following are assumptions or requirements of the transportation problem?

The transportation model is a special type of linear regression model.

It is not possible to solve a transportation problem that has ≤ instead of = signs for the supply constraints.

An optimal 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 1.

In a transportation tableau with m rows and n columns, if there are fewer than n+m-1 allocations, the tableau is said to be ________.

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

Vogel's approximation method allocates to the minimum cost cell in the row or column with the ________ penalty cost.

A transportation table contains an optimal solution when all the empty cell evaluations are

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

Which of the following are assumptions or requirements of transportation problems? I. Goods are the same from each source. II. There must be a single source. III. Minimum quantities must be shipped. IV. Shipping costs per unit do not vary with the quantity shipped.

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