Question 1

When the assumptions of an assignment problem are satisfied,all that needs to be done to formulate a problem is to identify the assignees and tasks

Accepted Answer

A) True 
 B)False

Question 2

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 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

Which of the following is not information needed to use the transportation model?

Accepted Answer

A) Capacity of the sources 
B) Demand of the destinations 
C) Unit shipping costs 
D) Unit shipping distances 
E) All of the above 
A) Capacity of the sources 
B) Demand of the destinations 
C) Unit shipping costs 
D) Unit shipping distances 
E) All of the above

Question 5

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 6

Transportation problems can be solved by the simplex method

Accepted Answer

A) True 
 B)False

Question 7

Transportation problems are a special type of distribution-network problem

Accepted Answer

A) True 
 B)False

Question 8

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 9

Assignment problems are cost minimization problems and cannot be solved as a profit maximization problem

Accepted Answer

A) True 
 B)False

Question 10

An assignment problem is a special type of transportation problem

Accepted Answer

A) True 
 B)False

Question 11

The transportation model assumes that shipping costs are dependent on the distance that goods are shipped

Accepted Answer

A) True 
 B)False

Question 12

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

Accepted Answer

A) True 
 B)False

Question 13

Transportation problems always involve shipping goods from one location to another

Accepted Answer

A) True 
 B)False

Question 14

The transportation model assumes shipping cost per unit is the same regardless of the number of units shipped

Accepted Answer

A) True 
 B)False

Question 15

Transportation problems always have integer solutions

Accepted Answer

A) True 
 B)False

Question 16

Which of the following can be used to solve transportation problems?

Accepted Answer

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

Question 17

Applications of assignment problems may include:

Accepted Answer

A) matching personnel to jobs 
B) assigning machines to tasks 
C) designing bussing routes 
D) a and b only 
E) All of the above 
A) matching personnel to jobs 
B) assigning machines to tasks 
C) designing bussing routes 
D) a and b only 
E) All of the above

Question 18

A network representation can be used to visualize a transportation problem

Accepted Answer

A) True 
 B)False

Question 19

A network representation is helpful because it shows the geographical layout of the sources and destinations of a problem

Accepted Answer

A) True 
 B)False

Question 20

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

When the assumptions of an assignment problem are satisfied,all that needs to be done to formulate a problem is to identify the assignees and tasks

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

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

Which of the following is not information needed to use the transportation model?

The transportation model method for evaluating location alternatives minimizes:

Transportation problems can be solved by the simplex method

Transportation problems are a special type of distribution-network problem

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

Assignment problems are cost minimization problems and cannot be solved as a profit maximization problem

An assignment problem is a special type of transportation problem

The transportation model assumes that shipping costs are dependent on the distance that goods are shipped

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

Transportation problems always involve shipping goods from one location to another

The transportation model assumes shipping cost per unit is the same regardless of the number of units shipped

Transportation problems always have integer solutions

Which of the following can be used to solve transportation problems?

Applications of assignment problems may include:

A network representation can be used to visualize a transportation problem

A network representation is helpful because it shows the geographical layout of the sources and destinations of a problem

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

Introduction

Linear programming: Basic Concepts

Linear programming: Formulation and applications

Theart of modeling with spread sheets

What-If Analysis for linear programming

Network optimization problems

Using binary integer programming to deal withy es-Or-No decisions

Non linear programming

Decision Analysis

Forecasting

Queuing models

Computer simulation: Basic Concepts

Computer simulation with risks olver platform

Solution concepts for linear programming

Pert CPM models for project management

Goal programming

Inventory management with known demand

Inventory management with uncertain demand

Computer simulation with crystal ball

Filters

Exam 15: Transportation and assignment problems

When the assumptions of an assignment problem are satisfied,all that needs to be done to formulate a problem is to identify the assignees and tasks

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

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

Which of the following is not information needed to use the transportation model?

The transportation model method for evaluating location alternatives minimizes:

Transportation problems can be solved by the simplex method

Transportation problems are a special type of distribution-network problem

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

Assignment problems are cost minimization problems and cannot be solved as a profit maximization problem

An assignment problem is a special type of transportation problem

The transportation model assumes that shipping costs are dependent on the distance that goods are shipped

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

Transportation problems always involve shipping goods from one location to another

The transportation model assumes shipping cost per unit is the same regardless of the number of units shipped

Transportation problems always have integer solutions

Which of the following can be used to solve transportation problems?

Applications of assignment problems may include:

A network representation can be used to visualize a transportation problem

A network representation is helpful because it shows the geographical layout of the sources and destinations of a problem

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

Introduction

Linear programming: Basic Concepts

Linear programming: Formulation and applications

Theart of modeling with spread sheets

What-If Analysis for linear programming

Network optimization problems

Using binary integer programming to deal withy es-Or-No decisions

Non linear programming

Decision Analysis

Forecasting

Queuing models

Computer simulation: Basic Concepts

Computer simulation with risks olver platform

Solution concepts for linear programming

Pert CPM models for project management

Goal programming

Inventory management with known demand

Inventory management with uncertain demand

Computer simulation with crystal ball

Filters