Exam 9: Transportation and Assignment Models
Exam 1: Introduction to Quantitative Analysis63 Questions
Exam 2: Probability Concepts and Applications145 Questions
Exam 3: Decision Analysis119 Questions
Exam 4: Regression Models120 Questions
Exam 5: Forecasting101 Questions
Exam 6: Inventory Control Models113 Questions
Exam 7: Linear Programming Models: Graphical and Computer Methods100 Questions
Exam 8: Linear Programming Applications96 Questions
Exam 9: Transportation and Assignment Models80 Questions
Exam 10: Integer Programming, Goal Programming, and Nonlinear Programming88 Questions
Exam 11: Network Models86 Questions
Exam 12: Project Management123 Questions
Exam 13: Waiting Lines and Queuing Theory Models133 Questions
Exam 14: Simulation Modeling68 Questions
Exam 15: Markov Analysis78 Questions
Exam 16: Statistical Quality Control87 Questions
Select questions type
SE Appliances manufacturers refrigerators in Richmond, Charlotte, and Atlanta. Refrigerators then must be shipped to meet demand in Washington, New York, and Miami. The table below lists the shipping costs, supply, and demand information.
How many units should be shipped from each plant to each retail store in order to minimize shipping costs?

(Essay)
4.8/5
(35)
Which of the following statements concerning transportation and assignment models is false?
(Multiple Choice)
4.7/5
(35)
In the transportation problem, using the stepping-stone method,
(Multiple Choice)
4.9/5
(40)
Which of the following accurately describes steps of the northwest corner rule, after making the initial allocation of units in the northwest cell?
(Multiple Choice)
4.9/5
(35)
In a transshipment problem involving 3 origins, 2 intermediate points, and 4 final destinations, what is the maximum number of decision variables?
(Multiple Choice)
4.8/5
(37)
When using the stepping-stone method, what is the maximum amount that can be shipped on the new route?
(Multiple Choice)
4.8/5
(37)
Transportation and assignment problems are really linear programming techniques called network flow problems.
(True/False)
4.8/5
(43)
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.
(True/False)
4.9/5
(36)
In revising the opportunity cost table of the assignment problem, after drawing lines through all of the zeros,
(Multiple Choice)
4.9/5
(35)
One of the advantages of the stepping-stone method is that if, at a particular iteration, we accidentally choose a route that is not the best, the only penalty is to perform additional iterations.
(True/False)
4.8/5
(37)
Table 9-13
-Table 9-13 provides information about a transportation problem. This problem is

(Multiple Choice)
4.9/5
(34)
In a transportation problem, each destination must be supplied by one and only one source.
(True/False)
4.8/5
(38)
In a transportation problem, a dummy source is given a zero cost, while in an assignment problem, a dummy source is given a very high cost.
(True/False)
4.9/5
(33)
The Hungarian method is designed to solve transportation problems efficiently.
(True/False)
4.9/5
(39)
A typical transportation problem may ask the question, "How many of X should be shipped to point E from source A?"
(True/False)
4.9/5
(33)
Neki Sports Company manufacturers treadmills in factories located in Pittsburgh and Kansas City. These are shipped to regional distribution centers in Chicago, Phoenix, and Philadelphia. Ultimately they are delivered to supply houses in New York and Los Angeles. The available supplies at the factories, demands at the final destinations, and shipping costs are illustrated in the table below.
Determine how many units should be shipped for all possible origin and destination points (final or intermediate) in the distribution network in order to minimize shipping costs.

(Essay)
4.9/5
(36)
Showing 21 - 40 of 80
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)