Unlock access to all the studying documents.
View Full Document
304 BUSINESS ANALYTICS MODULE C TRA N S P O R T A T I O N MO D E L S
A2 5 10 15 8 2
B3 14 15 8 6 1
→ + − + − = +
→ + − + − = +
Copyright ©2014 Pearson Education, Inc.
306 BUSINESS ANALYTICS MODULE C TR A N S P O R T A T I O N MO D E L S
C.18 Considering Fontainebleau, we have:
Optimal cost = $1,530,000
Considering Dublin, we have:
308 BUSINESS ANALYTICS MODULE C TR A N S P O R T A T I O N MO D E L S
(a) Existing pattern:
Initial solution—Northwest corner rule:
3 labor hours to build, then $3 (3 1) should be deducted
from each price quoted for shipments from Madison.
Copyright ©2014 Pearson Education, Inc.
310 BUSINESS ANALYTICS MODULE C TR A N S P O R T A T I O N MO D E L S
ADDITIONAL CASE STUDY*
CONSOLIDATED BOTTLING: B
180 and solve for the total cost, as shown in the table.
Clearly, the solution is to add 180 to San Francisco. The new and
old routes can be compared from the solution Tables 1 and 2,
below. (Note: All numbers are in thousands.)
Optimal cost = 3,175 miles
Optimal solution:
Total cost = 200 10 + 100 20 + 100 + 50 15 + 150 1
+ 150 30 = $11,400
Minimum total cost = 4,037 Note: Alternate optimal solutions exist.
Copyright ©2014 Pearson Education, Inc.
306 BUSINESS ANALYTICS MODULE C TR A N S P O R T A T I O N MO D E L S
C.18 Considering Fontainebleau, we have:
Optimal cost = $1,530,000
Considering Dublin, we have:
308 BUSINESS ANALYTICS MODULE C TR A N S P O R T A T I O N MO D E L S
(a) Existing pattern:
Initial solution—Northwest corner rule:
3 labor hours to build, then $3 (3 1) should be deducted
from each price quoted for shipments from Madison.
Copyright ©2014 Pearson Education, Inc.
310 BUSINESS ANALYTICS MODULE C TR A N S P O R T A T I O N MO D E L S
ADDITIONAL CASE STUDY*
CONSOLIDATED BOTTLING: B
180 and solve for the total cost, as shown in the table.
Clearly, the solution is to add 180 to San Francisco. The new and
old routes can be compared from the solution Tables 1 and 2,
below. (Note: All numbers are in thousands.)
Optimal cost = 3,175 miles
Optimal solution:
Total cost = 200 10 + 100 20 + 100 + 50 15 + 150 1
+ 150 30 = $11,400
Minimum total cost = 4,037 Note: Alternate optimal solutions exist.