Exam 20: Transportation Models
Exam 1: Operations and Productivity134 Questions
Exam 2: Operations Strategy in a Global Environment145 Questions
Exam 3: Project Management131 Questions
Exam 4: Forecasting151 Questions
Exam 5: Design of Goods and Services136 Questions
Exam 6: Managing Quality139 Questions
Exam 7: Process Strategy and Sustainability141 Questions
Exam 8: Location Strategies149 Questions
Exam 9: Layout Strategies171 Questions
Exam 10: Human Resources, Job Design, and Work Measurement202 Questions
Exam 11: Supply-Chain Management152 Questions
Exam 12: Inventory Management178 Questions
Exam 13: Aggregate Planning144 Questions
Exam 14: Material Requirements Planning Mrp and Erp184 Questions
Exam 15: Short-Term Scheduling149 Questions
Exam 16: Lean Operations147 Questions
Exam 17: Maintenance and Reliability139 Questions
Exam 18: Decision-Making Tools107 Questions
Exam 19: Linear Programming110 Questions
Exam 20: Transportation Models104 Questions
Exam 21: Waiting-Line Models145 Questions
Exam 22: Learning Curves121 Questions
Exam 23: Simulation102 Questions
Exam 24: Supply Chain Management Analytics65 Questions
Exam 25: Sustainability in the Supply Chain11 Questions
Exam 26: Statistical Process Control166 Questions
Exam 27: Capacity and Constraint Management117 Questions
Select questions type
In transportation model analysis the stepping-stone method is used to
(Multiple Choice)
4.8/5
(25)
For the data below, construct an initial feasible solution using the northwest-corner rule. COSTS Dest. 1 Dest. 2 Dest 3 Dest. 4 Supply Source 1 12 18 9 111 105 Source 2 19 7 30 15 145 Source 3 8 10 14 16 50 Demand 80 60 70 90 300/300
(Essay)
4.7/5
(32)
A transportation problem has two origins: A can supply 20 units and B can supply 30 units. This problem has two destinations: C requires 25 units and D requires 35 units. Which of the following is true?
(Multiple Choice)
4.9/5
(37)
A transportation problem requires exactly as many origins as destinations.
(True/False)
4.8/5
(32)
How might the transportation method be used to help a firm add a facility to an existing distribution network? You may wish to describe a simple example.
(Essay)
4.8/5
(37)
Suppose the solution for a transportation model fills 5 cells with quantities to be shipped. Which of the following combinations of sources and destinations would be degenerate?
(Multiple Choice)
4.9/5
(33)
For the problem below, what is the quantity assigned to the cell Source 3-Destination 1 using the intuitive method for an initial feasible solution? COSTS Dest. 1 Dest. 2 Dest. 3 Supply Source 1 2 1 3 50 Source 2 4 7 5 40 Source 3 3 12 6 30 Demand 50 45 25 120\backslash120
(Multiple Choice)
4.9/5
(39)
Find the minimum cost shipping solution for the transportation problem data set in the table below. Provide a table of shipping quantities and the minimum value for the objective function. COSTS Dest. 1 Dest. 2 Supply Source 1 6 10 20 Source 2 8 3 30 Source 3 4 6 15 Source 4 12 11 20 Source 5 7 9 25 Demand 70 40 110\backslash110
(Essay)
4.8/5
(31)
In a minimization problem, a positive improvement index in a cell indicates that
(Multiple Choice)
4.8/5
(27)
Source A has capacity of 40, Source B has capacity of 35, Destination 1 has demand of 20 and Destination 2 has demand of 25. Fill in the following table with the correct initial solution for a Northwest-corner method approach.
Destination 1 Destination 2 Dummy Destination Source A 20 20 Source B 5 10
(Essay)
4.7/5
(36)
For the problem data set below, what is the northwest corner allocation to the cell Source 1-Destination 1? COSTS Dest. 1 Dest. 2 Dest. 3 Supply Source 1 2 1 3 30 Source 2 4 2 1 40 Source 3 3 8 6 20 Demand 15 50 25 90\backslash90
(Multiple Choice)
4.8/5
(28)
A transportation problem with 8 sources and 6 destinations will have an optimal solution that uses at most 13 of the 48 possible routes.
(True/False)
5.0/5
(38)
Consider the transportation problem in the data set and optimal solution below. Verify by hand or by calculator (show your work) the value of the objective function. COSTS Dest. 1 Dest 2 Dest. 3 Dest. 4 Supply Source 1 12 18 9 11 105 Source 2 19 7 30 15 145 Source 3 8 10 14 16 50 Demand 80 60 70 90 300/300
Shipments Dest. 1 Dest. 2 Dest. 3 Dest. 4 Row Total Source 1 30 0 70 5 105 Source 2 0 60 0 85 145 Source 3 50 0 0 0 50 Col. Total 80 60 70 90 300\backslash300
(Essay)
4.8/5
(34)
A transportation problem has 10 origins and 37 destinations. How many possible routes are there for this problem? How many routes will be used in the optimal solution?
(Essay)
4.8/5
(34)
A large transportation problem has 220 origins and 1360 destinations. The optimal solution of this problem will fill no more than about ________ of cells with quantities to be shipped.
(Multiple Choice)
4.9/5
(26)
When the number of shipments in a feasible solution is less than the number of rows plus the number of columns minus one
(Multiple Choice)
4.9/5
(28)
When using the stepping-stone method, the improvement index for an unused cell equals the shipping cost associated with that cell.
(True/False)
4.8/5
(42)
Showing 81 - 100 of 104
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)