Question 1

A transportation problem requires a unit cost for every source-destination combination.

Accepted Answer

A) True 
 B)False

Question 2

The transportation model method for evaluating location alternatives minimizes:

Accepted Answer

A) the number of sources. 
B) the number of destinations. 
C) total supply. 
D) total demand. 
E) total shipping cost 
A) the number of sources. 
B) the number of destinations. 
C) total supply. 
D) total demand. 
E) total shipping cost

Question 3

The feasible solutions property states that a pure transportation problem will have feasible solutions if and only if the sum of its supplies equals the sum of its demands.

Accepted Answer

A) True 
 B)False

Question 4

In an assignment problem,every destination has a demand of 0 or 1.

Accepted Answer

A) True 
 B)False

Question 5

Which of the following is the fastest algorithm for solving an assignment problem?

Accepted Answer

A) The simplex method. 
B) The transportation simplex method. 
C) The network simplex method. 
D) The Hungarian method. 
E) All of the above. 
A) The simplex method. 
B) The transportation simplex method. 
C) The network simplex method. 
D) The Hungarian method. 
E) All of the above.

Question 6

Which of the following are assumptions or requirements of transportation problems?
I.Goods are the same,regardless of 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 IV 
B) II and III 
C) I,II and IV 
D) I and III 
E) I,II,III,and IV 
A) I and IV 
B) II and III 
C) I,II and IV 
D) I and III 
E) I,II,III,and IV

Question 7

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

Accepted Answer

A) True 
 B)False

Question 8

The linear programming model of a transportation problem is one of maximization of its objective function.

Accepted Answer

A) True 
 B)False

Question 9

The transportation simplex method solves transportation problems much faster than the regular simplex method.

Accepted Answer

A) True 
 B)False

Question 10

Many problems can be reformulated to fit the format of an assignment problem.

Accepted Answer

A) True 
 B)False

Question 11

Which of the following is not an assumption of assignment problems?

Accepted Answer

A) The number of assignees and the number of tasks are the same 
B) The objective is to minimize the number of assignments not made. 
C) Each task is to be performed by exactly one assignee. 
D) There is a cost associated with each combination of an assignee performing a task, 
E) Each assignee is to be assigned exactly one task. 
A) The number of assignees and the number of tasks are the same 
B) The objective is to minimize the number of assignments not made. 
C) Each task is to be performed by exactly one assignee. 
D) There is a cost associated with each combination of an assignee performing a task, 
E) Each assignee is to be assigned exactly one task.

Question 12

Network representation provides a way of visualizing an assignment problem graphically.

Accepted Answer

A) True 
 B)False

Question 13

When demand and supply are not equal in a transportation problem then the problem cannot be solved.

Accepted Answer

A) True 
 B)False

Question 14

Transportation problems must satisfy which of the following assumptions?

Accepted Answer

A) The supply assumption. 
B) The cost assumption. 
C) The integer assumption. 
D) All of the above. 
E) None of the above. 
A) The supply assumption. 
B) The cost assumption. 
C) The integer assumption. 
D) All of the above. 
E) None of the above.

Question 15

Which of the following problems can be reformulated to fit the format for an assignment problem?

Accepted Answer

A) Certain assignees are unable to perform certain tasks. 
B) There are more tasks than assignees,so some tasks will not be done. 
C) Each assignee can be assigned to perform more than one task simultaneously 
D) Each task can be performed jointly by more than one assignee. 
E) All of the above. 
A) Certain assignees are unable to perform certain tasks. 
B) There are more tasks than assignees,so some tasks will not be done. 
C) Each assignee can be assigned to perform more than one task simultaneously 
D) Each task can be performed jointly by more than one assignee. 
E) All of the above.

Question 16

It is always necessary to add constraints to a transportation model in order to restrict variables to only integer values.

Accepted Answer

A) True 
 B)False

Question 17

When demand is not a fixed amount but a range,the problem cannot be formulated as a transportation problem.

Accepted Answer

A) True 
 B)False

Question 18

In a pure assignment problem,more than one person can be assigned to a specific task.
Multiple Choice Questions

Accepted Answer

A) True 
 B)False

Question 19

The Hungarian Method is an algorithm used to solve transportation problems.

Accepted Answer

A) True 
 B)False

Question 20

In the linear programming version of a true transportation model:

Accepted Answer

A) all constraints are $\ge$. 
B) all constraints are $\le$. 
C) some constraints are $\ge$ and some are $\le$. 
D) all constraints are =. 
E) some constraints are $\ge$ and some are =. 
A) all constraints are $\ge$. 
B) all constraints are $\le$. 
C) some constraints are $\ge$ and some are $\le$. 
D) all constraints are =. 
E) some constraints are $\ge$ and some are =.

Exam 18: CD - Transportation and Assignment Problems

A transportation problem requires a unit cost for every source-destination combination.

The transportation model method for evaluating location alternatives minimizes:

The feasible solutions property states that a pure transportation problem will have feasible solutions if and only if the sum of its supplies equals the sum of its demands.

In an assignment problem,every destination has a demand of 0 or 1.

Which of the following is the fastest algorithm for solving an assignment problem?

Which of the following are assumptions or requirements of transportation problems? I.Goods are the same,regardless of 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.

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

The linear programming model of a transportation problem is one of maximization of its objective function.

The transportation simplex method solves transportation problems much faster than the regular simplex method.

Many problems can be reformulated to fit the format of an assignment problem.

Which of the following is not an assumption of assignment problems?

Network representation provides a way of visualizing an assignment problem graphically.

When demand and supply are not equal in a transportation problem then the problem cannot be solved.

Transportation problems must satisfy which of the following assumptions?

Which of the following problems can be reformulated to fit the format for an assignment problem?

It is always necessary to add constraints to a transportation model in order to restrict variables to only integer values.

When demand is not a fixed amount but a range,the problem cannot be formulated as a transportation problem.

In a pure assignment problem,more than one person can be assigned to a specific task. Multiple Choice Questions

The Hungarian Method is an algorithm used to solve transportation problems.

In the linear programming version of a true transportation model:

Introduction

Linear Programming: Basic Concepts

Linear Programming: Formulation and Applications

The Art of Modeling With Spreadsheets

What-If Analysis for Linear Programming

Network Optimization Problems

Using Binary Integer Programming to Deal With Yes-Or-No Decisions

Nonlinear Programming

Decision Analysis

Cd Supplement - Decision Analysis

Forecasting

Queueing Models

CD Supplement - Additional Queueing Models

Computer Simulation: Basic Concepts

CD Supplement - the Inverse Transformation Method for Generating Random Observations

Computer Simulation With Crystal Ball

CD - Solution Concepts for Linear Programming

CD - Pertcpm Models for Project Management

CD - Goal Programming

CD - Inventory Management With Known Demand

CD - Inventory Management With Uncertain Demand

Filters

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