Transportation Model Testbank
TRUE/FALSE
10.1 The Avis car rental company successfully used the transportation method to move its inventory of cars efficiently.
ANSWER: TRUE
10.2 Transportation and assignment problems are really linear programming techniques called network flow problems.
ANSWER: TRUE
10.3 A typical transportation problem may ask the question, “How many of X should be shipped to point E from source A?”
ANSWER: TRUE
10.4 The objective of a transportation problem solution is to schedule shipments from sources to destinations while minimizing total transportation and production costs.
ANSWER: TRUE
10.5 Assignment problems involve determining the most efficient assignment of people to projects, salesmen to territories, contracts to bidders, and so on.
ANSWER: TRUE
10.6 The objective of an assignment problem solution most often is to minimize total costs or time of performing the assigned tasks.
ANSWER: TRUE
10.7 An important characteristic of assignment problems is that no less than two jobs or two workers are assigned to one machine or project.
ANSWER: FALSE
10.8 The northwest corner rule, stepping-stone, MODI, and Vogel’s methods all produce integer solutions.
ANSWER: TRUE
10.9 The MODI method is the Maximized Optimal Distribution method.
ANSWER: FALSE
10.10 In the assignment problem, the costs for a dummy row will be equal to the lowest cost of the column for each respective cell in that row.
ANSWER: FALSE
10.11 Linear programming techniques can be used to solve transportation problems and are more efficient than special purpose algorithms.
ANSWER: FALSE
10.12 In finding the maximum quantity that can be shipped on the least costly route using the stepping-stone method, one examines the closed path of plus and minus signs drawn and selects the smallest number found in those squares containing minus signs.
10.1 The Avis car rental company successfully used the transportation method to move its inventory of cars efficiently.
ANSWER: TRUE
10.2 Transportation and assignment problems are really linear programming techniques called network flow problems.
ANSWER: TRUE
10.3 A typical transportation problem may ask the question, “How many of X should be shipped to point E from source A?”
ANSWER: TRUE
10.4 The objective of a transportation problem solution is to schedule shipments from sources to destinations while minimizing total transportation and production costs.
ANSWER: TRUE
10.5 Assignment problems involve determining the most efficient assignment of people to projects, salesmen to territories, contracts to bidders, and so on.
ANSWER: TRUE
10.6 The objective of an assignment problem solution most often is to minimize total costs or time of performing the assigned tasks.
ANSWER: TRUE
10.7 An important characteristic of assignment problems is that no less than two jobs or two workers are assigned to one machine or project.
ANSWER: FALSE
10.8 The northwest corner rule, stepping-stone, MODI, and Vogel’s methods all produce integer solutions.
ANSWER: TRUE
10.9 The MODI method is the Maximized Optimal Distribution method.
ANSWER: FALSE
10.10 In the assignment problem, the costs for a dummy row will be equal to the lowest cost of the column for each respective cell in that row.
ANSWER: FALSE
10.11 Linear programming techniques can be used to solve transportation problems and are more efficient than special purpose algorithms.
ANSWER: FALSE
10.12 In finding the maximum quantity that can be shipped on the least costly route using the stepping-stone method, one examines the closed path of plus and minus signs drawn and selects the smallest number found in those squares containing minus signs.