Deck 18: CD - Transportation and Assignment Problems

Question 1

Transportation problems always have integer solutions.

Answer 1

False

Question 2

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

Answer 2

False

Question 3

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

Answer 3

False

Question 4

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

Question 5

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

Question 6

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

Question 7

Transportation problems always involve shipping goods from one location to another.

Question 8

A network representation can be used to visualize a transportation problem.

Question 9

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

Question 10

Transportation problems can be solved by the simplex method.

Question 11

Transportation problems are a special type of distribution-network problem.

Question 12

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

Question 13

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

Question 14

The requirements assumption states that each source has a fixed supply of units,where the entire supply must be distributed to the destinations and that each destination has a fixed demand for units,where the entire demand must be received from the sources.

Question 15

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

Question 16

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

Question 17

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.

Question 18

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.

Question 19

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

Question 20

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

Question 21

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

Question 22

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

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 23

The transportation model method for evaluating location alternatives minimizes:

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

Question 24

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

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 25

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

Question 26

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

Question 27

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

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

Question 28

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

Question 29

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

Question 30

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

Question 31

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

Question 32

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.

Question 33

When formulating a transportation problem on a spreadsheet,which of the following are necessary?

A)A table of data.
B)A network representation.
C)A table for the solution.
D)a and c only.
E)All of the above.

Question 34

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.

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

Question 35

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

Question 36

An assignment problem is a special type of transportation problem

Question 37

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

Question 38

Transportation problems must satisfy which of the following assumptions?

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

Question 39

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

Question 40

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

Question 41

In the linear programming version of a true transportation model:

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

Question 42

An assignment problem:

A)is a special transportation problem.
B)will always have an integer solution.
C)has all supplies and demands equal to 1.
D)None of the above.
E)All of the above.

Question 43

Applications of assignment problems may include:

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 44

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

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 45

Applications of the transportation problem include the areas of: I.shipping goods.
II)assigning plants to products.
III)choosing customers.
IV)evaluating transportation methods.

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 46

Which of the following problems can be reformulated to fit the format for a transportation problem?

A)Certain source-destination combinations cannot be used for distributing units.
B)A destination has both a minimum and maximum demand.
C)The sum of the supplies exceeds the sum of the demands.
D)a and b only.
E)All of the above.

Question 47

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

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

Question 48

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

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.