Question 1

________ model is a method for determining an initial solution for a transportation problem based on the concept of penalty cost or regret.

Accepted Answer

Vogel's ap

Question 2

A(n) ________ table is developed by first subtracting the minimum value in each row from all other row values and then repeating the process for each column.

Accepted Answer

The answer of A(n) ________ table is developed by first...

Question 3

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 minimum cell cost method, the initial solution would give to cell BI a loading of ________.

Accepted Answer

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

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 minimum cell cost method, the initial solution would have a total transportation cost of ________.

Accepted Answer

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

Question 5

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 Northwest Corner method, the initial solution would have a total transportation cost of ________.

Accepted Answer

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

Question 6

Unacceptable (prohibited) routes in a transportation problem are assigned cost values of zero.

Accepted Answer

A) True 
 B)False

________ model is a method for determining an initial solution for a transportation problem based on the concept of penalty cost or regret.

A(n) ________ table is developed by first subtracting the minimum value in each row from all other row values and then repeating the process for each column.

Unacceptable (prohibited) routes in a transportation problem are assigned cost values of zero.

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

________ model is a method for determining an initial solution for a transportation problem based on the concept of penalty cost or regret.

A(n) ________ table is developed by first subtracting the minimum value in each row from all other row values and then repeating the process for each column.

Unacceptable (prohibited) routes in a transportation problem are assigned cost values of zero.

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