Transportation and Assignment Problems Quiz, Exams of Mathematics

True/false and multiple-choice questions on transportation and assignment problems, focusing on solution procedures like the transportation simplex and Hungarian methods. It covers balanced/unbalanced problems, dummy origins/destinations, and optimal solution properties. The questions test understanding of these methods and their application in optimization. Structured to assess comprehension of principles and techniques, it's valuable for operations research or management science students. Questions require recall, understanding, and application, providing a comprehensive review. The document references national standards and learning objectives, aligning with educational curricula. Questions are categorized by difficulty and bloom's taxonomy, offering a structured learning and evaluation approach.

Typology: Exams

2024/2025

Available from 08/28/2025

AceNurse
AceNurse 🇺🇸

4

(16)

757 documents

1 / 43

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CH 19 - Solution Procedures for Transportation and Assignment Problems
Page 1
True / False
1. The transportation simplex method can be used to solve the
assignment problem.
a.
True
b.
False
ANSWER:
POINTS:
DIFFICULTY:
LEARNING OBJECTIVES:
NATIONAL STANDARDS:
TOPICS:
KEYWORDS:
2. The transportation simplex method is limited to minimization
problems.
a.
True
b.
False
ANSWER:
POINTS:
DIFFICULTY:
LEARNING OBJECTIVES:
NATIONAL STANDARDS:
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a
pf2b

Partial preview of the text

Download Transportation and Assignment Problems Quiz and more Exams Mathematics in PDF only on Docsity!

True / False

  1. The transportation simplex method can be used to solve the assignment problem. a. True b. False ANSWER: True POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.19.02 - 19. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 19.2 Assignment Problem: A Special- Purpose Solution Procedure KEYWORDS: Bloom's: Remember
  2. The transportation simplex method is limited to minimization problems. a. True b. False ANSWER: False POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.19.01 - 19. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking

TOPICS: 19.1 Transportation Simplex Method: A Special-Purpose Solution Procedure KEYWORDS: Bloom's: Remember

  1. For an assignment problem with three agents and four tasks, the assignment matrix will have three rows and four columns. a. True b. False ANSWER: False POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.19.02 - 19. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 19.2 Assignment Problem: A Special- Purpose Solution Procedure KEYWORDS: Bloom's: Understand
  2. The transportation simplex method can be applied only to a balanced problem; if a problem is not balanced, a dummy origin or dummy destination must be added. a. True b. False ANSWER: True POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.19.01 - 19.

DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.19.01 - 19. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 19.1 Transportation Simplex Method: A Special-Purpose Solution Procedure KEYWORDS: Bloom's: Understand

  1. A dummy origin in a transportation problem is used when supply exceeds demand. a. True b. False ANSWER: False POINTS: 1 DIFFICULTY: Moderate LEARNING OBJECTIVES: IMS.ASWC.19.19.01 - 19. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 19.1 Transportation Simplex Method: A Special-Purpose Solution Procedure KEYWORDS: Bloom's: Understand
  2. The net evaluation index for occupied cells in the transportation simplex method is 0. a. True b. False ANSWER: True

POINTS: 1

DIFFICULTY: Moderate LEARNING OBJECTIVES: IMS.ASWC.19.19.01 - 19. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 19.1 Transportation Simplex Method: A Special-Purpose Solution Procedure KEYWORDS: Bloom's: Understand

  1. Optimal assignments are made in the Hungarian method to cells in the reduced matrix that contain a 0. a. True b. False ANSWER: True POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.19.02 - 19. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 19.2 Assignment Problem: A Special- Purpose Solution Procedure KEYWORDS: Bloom's: Understand
  2. 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.
  1. The transportation simplex method is a two-phase method that first finds an initial feasible solution and then makes iterative improvements in the solution until an optimal solution is reached. a. True b. False ANSWER: True POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.19.01 - 19. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 19.1 Transportation Simplex Method: A Special-Purpose Solution Procedure KEYWORDS: Bloom's: Understand
  2. In the transportation simplex method, when total supply is greater than total demand, we introduce a dummy destination with demand less than the excess of supply over demand. a. True b. False ANSWER: False POINTS: 1 DIFFICULTY: Moderate LEARNING OBJECTIVES: IMS.ASWC.19.19.01 - 19. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking

TOPICS: 19.1 Transportation Simplex Method: A Special-Purpose Solution Procedure KEYWORDS: Bloom's: Understand

  1. Finding an initial feasible solution can be done by using a heuristic procedure. a. True b. False ANSWER: True POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.19.01 - 19. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 19.1 Transportation Simplex Method: A Special-Purpose Solution Procedure KEYWORDS: Bloom's: Remember Multiple Choice
  2. A solution to a transportation problem that has less than m + n − 1 cells with positive allocations in the transportation tableau is a(n) a. optimal solution. b. initial feasible solution. c. minimum cost solution. d. degenerate solution.
  1. 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 a. m + n − 2. b. m + n − 1. c. m + n. d. m + n + 1. ANSWER: b POINTS: 1 DIFFICULTY: Moderate LEARNING OBJECTIVES: IMS.ASWC.19.19.02 - 19. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 19.2 Assignment Problem: A Special- Purpose Solution Procedure KEYWORDS: Bloom's: Understand
  2. The per-unit change in the objective function associated with assigning flow to an unused arc in the transportation simplex method is called the a. net evaluation index. b. degenerate value. c. opportunity loss. d. simplex multiplier. ANSWER: a POINTS: 1

DIFFICULTY: Moderate LEARNING OBJECTIVES: IMS.ASWC.19.19.02 - 19. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 19.2 Assignment Problem: A Special- Purpose Solution Procedure KEYWORDS: Bloom's: Remember

  1. The difference between the transportation and assignment problems is that a. total supply must equal total demand in the transportation problem. b. the number of origins must equal the number of destinations in the transportation problem. c. each supply and demand value is 1 in the assignment problem. d. There are many differences between the transportation and assignment problems. ANSWER: c POINTS: 1 DIFFICULTY: Moderate LEARNING OBJECTIVES: IMS.ASWC.19.19.02 - 19. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 19.2 Assignment Problem: A Special- Purpose Solution Procedure KEYWORDS: Bloom's: Understand

NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 19.1 Transportation Simplex Method: A Special-Purpose Solution Procedure KEYWORDS: Bloom's: Understand

  1. Identifying the outgoing arc in phase II of the transportation simplex method is performed using the a. minimum cost method. b. MODI method. c. stepping-stone method. d. matrix reduction method. ANSWER: c POINTS: 1 DIFFICULTY: Moderate LEARNING OBJECTIVES: IMS.ASWC.19.19.01 - 19. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 19.1 Transportation Simplex Method: A Special-Purpose Solution Procedure KEYWORDS: Bloom's: Understand
  2. In order to identify the arc that will cause the largest reduction per unit in the total cost of the current solution, we use the MODI method. The MODI method is used to identify a. an outgoing arc. b. an incoming arc.

c. unoccupied cells. d. an initial feasible solution. ANSWER: b POINTS: 1 DIFFICULTY: Moderate LEARNING OBJECTIVES: IMS.ASWC.19.19.01 - 19. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 19.1 Transportation Simplex Method: A Special-Purpose Solution Procedure KEYWORDS: Bloom's: Understand

  1. To use the transportation simplex method, a transportation problem that is unbalanced requires the use of a. artificial variables. b. one or more transshipment nodes. c. a dummy origin or destination. d. matrix reduction. ANSWER: c POINTS: 1 DIFFICULTY: Moderate LEARNING OBJECTIVES: IMS.ASWC.19.19.01 - 19. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 19.1 Transportation Simplex Method: A Special-Purpose Solution Procedure

DIFFICULTY: Moderate LEARNING OBJECTIVES: IMS.ASWC.19.19.01 - 19. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 19.1 Transportation Simplex Method: A Special-Purpose Solution Procedure KEYWORDS: Bloom's: Understand

  1. The Hungarian method involves a. matrix reduction. b. subtracting and adding appropriate values to yield an optimal solution. c. continuing iteratively until the value of one of the solutions is zero. d. All of these are correct. ANSWER: d POINTS: 1 DIFFICULTY: Moderate LEARNING OBJECTIVES: IMS.ASWC.19.19.02 - 19. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 19.2 Assignment Problem: A Special- Purpose Solution Procedure KEYWORDS: Bloom's: Understand Subjective Short Answer
  1. Develop the transportation tableau for this transportation problem. ANSWER: Destination Origin A B Supply 1

Destination Source X Y Z A 2 3 5 B 9 12 10 ANSWER: Destination Origin 1 2 3 Supply A 200

B 100

Demand 300 300 300 Total shipping cost is $5200. POINTS: 1 DIFFICULTY: Challenging LEARNING OBJECTIVES: IMS.ASWC.19.19.01 - 19. NATIONAL STANDARDS: United States - BUSPROG: Analytic TOPICS: 19.1 Transportation Simplex Method: A Special-Purpose Solution Procedure KEYWORDS: Bloom's: Analyze

  1. Canning Transport is to move goods from three factories (origins) to three distribution centers (destinations). Information about the move is given below. Solve the problem using the transportation simplex method and compute the total shipping cost. Origin Supply DestinationDemand A 200 X 50 B 100 Y 125 C 150 Z 125 Shipping costs are as follows: Destination Origin X Y Z A 3 2 5 B 9 10 – C 5 6 4 (Source B cannot ship to destination Z.) ANSWER: Destination Origin X Y Z Supply A 75

B