Question 1

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 D

Question 2

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

Accepted Answer

A) True 
 B)False  True

Question 3

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

Accepted Answer

A) True 
 B)False  False

Question 4

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

Accepted Answer

A) True 
 B)False

Question 5

When the number of people and the number of tasks are not equal in an assignment problem then the problem cannot be solved

Accepted Answer

A) True 
 B)False

Question 6

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

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

A network representation is an important tool for solving any size transportation problem

Accepted Answer

A) True 
 B)False

Question 8

In the linear programming version of a true transportation model:

Accepted Answer

A) all constraints are ≥ 
B) all constraints are ≤ 
C) some constraints are ≥ and some are ≤ 
D) all constraints are = 
E) some constraints are ≥ and some are = 
A) all constraints are ≥ 
B) all constraints are ≤ 
C) some constraints are ≥ and some are ≤ 
D) all constraints are = 
E) some constraints are ≥ and some are =

Question 9

Transportation problems are concerned with distributing commodities from sources to destinations in such a way as to minimize the total distribution cost

Accepted Answer

A) True 
 B)False

Question 10

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

Accepted Answer

A) True 
 B)False

Question 11

It is not possible to adjust the transportation simplex method to maximize instead of minimize

Accepted Answer

A) True 
 B)False

Question 12

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

Accepted Answer

A) True 
 B)False

Question 13

Assignment problems are just a special type of transportation problem where the sources are now tasks to be performed

Accepted Answer

A) True 
 B)False

Question 14

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

Accepted Answer

A) Actual supply and demand must be equal 
B) Shipping costs per unit are constant 
C) Items to be shipped are the same 
D) One transportation route between each source and destination 
E) One transportation mode between each source and destination 
A) Actual supply and demand must be equal 
B) Shipping costs per unit are constant 
C) Items to be shipped are the same 
D) One transportation route between each source and destination 
E) One transportation mode between each source and destination

Question 15

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 16

Network representation provides a way of visualizing an assignment problem graphically

Accepted Answer

A) True 
 B)False

Question 17

Applications of the transportation problem include the areas of:

Accepted Answer

A) I and IV 
B) I,II,and IV 
C) I,II,and III 
D) I,II,III,and IV 
E) None of the above 
A) I and IV 
B) I,II,and IV 
C) I,II,and III 
D) I,II,III,and IV 
E) None of the above

Question 18

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

Accepted Answer

A) True 
 B)False

Question 19

As long as all its supplies and demands have integer values,any transportation problem with feasible solutions is guaranteed to have an optimal solution with integer values for all its decision variables

Accepted Answer

A) True 
 B)False

Question 20

The supplies and demands provide all the data for a transportation problem

Accepted Answer

A) True 
 B)False

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

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

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

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

When the number of people and the number of tasks are not equal in an assignment problem then the problem cannot be solved

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

A network representation is an important tool for solving any size transportation problem

In the linear programming version of a true transportation model:

Transportation problems are concerned with distributing commodities from sources to destinations in such a way as to minimize the total distribution cost

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

It is not possible to adjust the transportation simplex method to maximize instead of minimize

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

Assignment problems are just a special type of transportation problem where the sources are now tasks to be performed

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

Transportation problems must satisfy which of the following assumptions?

Network representation provides a way of visualizing an assignment problem graphically

Applications of the transportation problem include the areas of:

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

As long as all its supplies and demands have integer values,any transportation problem with feasible solutions is guaranteed to have an optimal solution with integer values for all its decision variables

The supplies and demands provide all the data for a transportation problem

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

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

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

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

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

When the number of people and the number of tasks are not equal in an assignment problem then the problem cannot be solved

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

A network representation is an important tool for solving any size transportation problem

In the linear programming version of a true transportation model:

Transportation problems are concerned with distributing commodities from sources to destinations in such a way as to minimize the total distribution cost

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

It is not possible to adjust the transportation simplex method to maximize instead of minimize

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

Assignment problems are just a special type of transportation problem where the sources are now tasks to be performed

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

Transportation problems must satisfy which of the following assumptions?

Network representation provides a way of visualizing an assignment problem graphically

Applications of the transportation problem include the areas of:

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

As long as all its supplies and demands have integer values,any transportation problem with feasible solutions is guaranteed to have an optimal solution with integer values for all its decision variables

The supplies and demands provide all the data for a transportation problem

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