Question 1

The transportation simplex method is limited to minimization problems.

Accepted Answer

A) True 
 B)False  False

Question 2

The stepping-stone method requires that one or more artificially occupied cells with a flow of zero be created in the transportation tableau when the number of occupied cells is fewer than

Accepted Answer

A) m + n - 2 
B) m + n - 1 
C) m + n 
D) m + n + 1 
A) m + n - 2 
B) m + n - 1 
C) m + n 
D) m + n + 1 B

Question 3

The net evaluation index for occupied cells in the transportation simplex method is 0.

Accepted Answer

A) True 
 B)False  True

Question 4

Using the transportation simplex method, the optimal solution to the transportation problem has been found when

Accepted Answer

A) there is a shipment in every cell. 
B) more than one stepping-stone path is available. 
C) there is a tie for outgoing cell. 
D) the net evaluation index for each unoccupied cell is > 0. 
A) there is a shipment in every cell. 
B) more than one stepping-stone path is available. 
C) there is a tie for outgoing cell. 
D) the net evaluation index for each unoccupied cell is > 0.

Question 5

When an assignment problem involves an unacceptable assignment, a dummy agent or task must be introduced.

Accepted Answer

A) True 
 B)False

Question 6

The optimal solution is found in an assignment matrix when the minimum number of straight lines needed to cover all the zeros equals

Accepted Answer

A) (the number of agents) - 1. 
B) (the number of agents). 
C) (the number of agents) + 1. 
D) (the number of agents) + (the number of tasks). 
A) (the number of agents) - 1. 
B) (the number of agents). 
C) (the number of agents) + 1. 
D) (the number of agents) + (the number of tasks).

Question 7

The MODI method is used to

Accepted Answer

A) identify an outgoing arc. 
B) identify an incoming arc. 
C) identify unoccupied cells. 
D) identify an initial feasible solution. 
A) identify an outgoing arc. 
B) identify an incoming arc. 
C) identify unoccupied cells. 
D) identify an initial feasible solution.

Question 8

To use the Hungarian method, a profit-maximization assignment problem requires

Accepted Answer

A) converting all profits to opportunity losses. 
B) a dummy agent or task. 
C) matrix expansion. 
D) finding the maximum number of lines to cover all the zeros in the reduced matrix. 
A) converting all profits to opportunity losses. 
B) a dummy agent or task. 
C) matrix expansion. 
D) finding the maximum number of lines to cover all the zeros in the reduced matrix.

Question 9

The transportation simplex method can be used to solve the assignment problem.

Accepted Answer

A) True 
 B)False

Question 10

A dummy origin in a transportation problem is used when supply exceeds demand.

Accepted Answer

A) True 
 B)False

Question 11

To use the transportation simplex method, a transportation problem that is unbalanced requires the use of

Accepted Answer

A) artificial variables. 
B) one or more transshipment nodes. 
C) a dummy origin or destination. 
D) matrix reduction. 
A) artificial variables. 
B) one or more transshipment nodes. 
C) a dummy origin or destination. 
D) matrix reduction.

Question 12

An example of a heuristic is the

Accepted Answer

A) minimum-cost method. 
B) stepping-stone method. 
C) Hungarian method. 
D) MODI method. 
A) minimum-cost method. 
B) stepping-stone method. 
C) Hungarian method. 
D) MODI method.

Question 13

The per-unit change in the objective function associated with assigning flow to an unused arc in the transportation simplex method is called the

Accepted Answer

A) net evaluation index. 
B) degenerate value. 
C) opportunity loss. 
D) simplex multiplier. 
A) net evaluation index. 
B) degenerate value. 
C) opportunity loss. 
D) simplex multiplier.

Question 14

For an assignment problem with 3 agents and 4 tasks, the assignment matrix will have 3 rows and 4 columns.

Accepted Answer

A) True 
 B)False

Question 15

Identifying the outgoing arc in Phase II of the transportation simplex method is performed using the

Accepted Answer

A) minimum cost method. 
B) MODI method. 
C) stepping-stone method. 
D) matrix reduction method. 
A) minimum cost method. 
B) MODI method. 
C) stepping-stone method. 
D) matrix reduction method.

Question 16

To handle unacceptable routes in a transportation problem where cost is to be minimized, infeasible arcs must be assigned negative cost values.

Accepted Answer

A) True 
 B)False

Question 17

A solution to a transportation problem that has less than m + n - 1 cells with positive allocations in the transportation tableau is

Accepted Answer

A) an optimal solution. 
B) an initial feasible solution. 
C) a minimum-cost solution. 
D) a degenerate solution. 
A) an optimal solution. 
B) an initial feasible solution. 
C) a minimum-cost solution. 
D) a degenerate solution.

Question 18

The transportation simplex method is more efficient than general-purpose linear programming for solving large-sized transportation problems.

Accepted Answer

A) True 
 B)False

Question 19

If a transportation problem has four origins and five destinations, one of the destinations will not be fully supplied.

Accepted Answer

A) True 
 B)False

Question 20

Using the Hungarian method, the optimal solution to an assignment problem is found when the minimum number of lines required to cover the zero cells in the reduced matrix equals the number of agents.

Accepted Answer

A) True 
 B)False

Exam 19: Solution Procedures for Transportation and Assignment Problems

The transportation simplex method is limited to minimization problems.

The stepping-stone method requires that one or more artificially occupied cells with a flow of zero be created in the transportation tableau when the number of occupied cells is fewer than

The net evaluation index for occupied cells in the transportation simplex method is 0.

Using the transportation simplex method, the optimal solution to the transportation problem has been found when

When an assignment problem involves an unacceptable assignment, a dummy agent or task must be introduced.

The optimal solution is found in an assignment matrix when the minimum number of straight lines needed to cover all the zeros equals

The MODI method is used to

To use the Hungarian method, a profit-maximization assignment problem requires

The transportation simplex method can be used to solve the assignment problem.

A dummy origin in a transportation problem is used when supply exceeds demand.

To use the transportation simplex method, a transportation problem that is unbalanced requires the use of

An example of a heuristic is the

The per-unit change in the objective function associated with assigning flow to an unused arc in the transportation simplex method is called the

For an assignment problem with 3 agents and 4 tasks, the assignment matrix will have 3 rows and 4 columns.

Identifying the outgoing arc in Phase II of the transportation simplex method is performed using the

To handle unacceptable routes in a transportation problem where cost is to be minimized, infeasible arcs must be assigned negative cost values.

A solution to a transportation problem that has less than m + n - 1 cells with positive allocations in the transportation tableau is

The transportation simplex method is more efficient than general-purpose linear programming for solving large-sized transportation problems.

If a transportation problem has four origins and five destinations, one of the destinations will not be fully supplied.

Using the Hungarian method, the optimal solution to an assignment problem is found when the minimum number of lines required to cover the zero cells in the reduced matrix equals the number of agents.

Introduction

Introduction to Linear Programming

LP Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications

Advanced Linear Programming Applications

Distribution and Network Problems

Integer Linear Programming

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Forecasting

Markov Processes

LP: Simplex Method

Simplex-Based Sensitivity Analysis and Duality

Minimal Spanning Tree

Dynamic Programming

Filters