Question: Question Completion Status: 10 11 12 13 14 15 16 17 18 19 20 21 Your company is responsible for transporting units of product from

 Question Completion Status: 10 11 12 13 14 15 16 17
18 19 20 21 Your company is responsible for transporting units of

Question Completion Status: 10 11 12 13 14 15 16 17 18 19 20 21 Your company is responsible for transporting units of product from supply locations in Atlanta, Albany and Albuquerque to demand locations in Boston, Baton Rouge and Bakersfield. The sensitivity report provided below was generated using Solver to determine the optimal solution to this transportation problem. Microsoft Excel 14.0 Sensitivity Report Variable Cells Final Reduced Objective Allowable Allowable Cell Name Value Cost Coefficient Increase Decrease $B$12 Atlanta Boston 0 10 8 1E+30 10 $C$12 Atlanta Baton Rouge 1350 0 3 9 1E+30 $D$12 Atlanta Bakersfield 0 16 13 1E+30 16 $B$13 Albany Boston 1500 0 5 10 7 $C$13 Albany Baton Rouge 100 0 10 2 10 $D$13 Albany Bakersfield 0 11 15 1E+30 11 $B$14 Albuquerque Boston 0 10 17 1E+30 101 $C$14 Albuquerque Baton Rouge 750 0 12 10 2 $D$14 Albuquerque Bakersfield 900 0 6 11 6 Constraints Cell Name $B$15 RECEIVED = Boston $C$15 RECEIVED = Baton Rouge SD$15 RECEIVED = Bakersfield Final Shadow Constraint Allowable Allowable Value Price R.H. Side Increase Decrease 1500 7 1500 100 750 2200 12 2200 350 750 900 6 900 350 900 Cell Name $B$12 Atlanta Boston $C$12 Atlanta Baton Rouge $D$12 Atlanta Bakersfield $B$13 Albany Boston $C$13 Albany Baton Rouge $D$13 Albany Bakersfield $B$14 Albuquerque Boston $C$14 Albuquerque Baton Rouge $D$14 Albuquerque Bakersfield Final Reduced Objective Allowable Allowable Value Cost Coefficient Increase Decrease 0 10 8 1E+30 10 1350 0 3 9 1E+30 0 16 13 1E+30 16 1500 0 5 10 7 100 0 10 2 10 0 11 15 1E+30 11 0 10 17 1E+30 10 750 0 12 10 2 900 0 6 11 6 Constraints Cell Name $B$15 RECEIVED = Boston $C$15 RECEIVED = Baton Rouge $D$15 RECEIVED = Bakersfield $E$12 Atlanta SHIPPED = $E$13 Albany SHIPPED = $E$14 Albuquerque SHIPPED = Final Shadow Constraint Allowable Allowable Value Price R.H. Side Increase Decrease 1500 7. 1500 100 750 2200 12 2200 350 750 900 6 900 350 900 1350 -9 1350 750 350 1600 -2 1600 750 100 1650 0 2000 1E+30 350 Report the optimal minimum cost (z value) Question Completion Status: 10 11 12 13 14 15 16 17 18 19 20 21 Your company is responsible for transporting units of product from supply locations in Atlanta, Albany and Albuquerque to demand locations in Boston, Baton Rouge and Bakersfield. The sensitivity report provided below was generated using Solver to determine the optimal solution to this transportation problem. Microsoft Excel 14.0 Sensitivity Report Variable Cells Final Reduced Objective Allowable Allowable Cell Name Value Cost Coefficient Increase Decrease $B$12 Atlanta Boston 0 10 8 1E+30 10 $C$12 Atlanta Baton Rouge 1350 0 3 9 1E+30 $D$12 Atlanta Bakersfield 0 16 13 1E+30 16 $B$13 Albany Boston 1500 0 5 10 7 $C$13 Albany Baton Rouge 100 0 10 2 10 $D$13 Albany Bakersfield 0 11 15 1E+30 11 $B$14 Albuquerque Boston 0 10 17 1E+30 101 $C$14 Albuquerque Baton Rouge 750 0 12 10 2 $D$14 Albuquerque Bakersfield 900 0 6 11 6 Constraints Cell Name $B$15 RECEIVED = Boston $C$15 RECEIVED = Baton Rouge SD$15 RECEIVED = Bakersfield Final Shadow Constraint Allowable Allowable Value Price R.H. Side Increase Decrease 1500 7 1500 100 750 2200 12 2200 350 750 900 6 900 350 900 Cell Name $B$12 Atlanta Boston $C$12 Atlanta Baton Rouge $D$12 Atlanta Bakersfield $B$13 Albany Boston $C$13 Albany Baton Rouge $D$13 Albany Bakersfield $B$14 Albuquerque Boston $C$14 Albuquerque Baton Rouge $D$14 Albuquerque Bakersfield Final Reduced Objective Allowable Allowable Value Cost Coefficient Increase Decrease 0 10 8 1E+30 10 1350 0 3 9 1E+30 0 16 13 1E+30 16 1500 0 5 10 7 100 0 10 2 10 0 11 15 1E+30 11 0 10 17 1E+30 10 750 0 12 10 2 900 0 6 11 6 Constraints Cell Name $B$15 RECEIVED = Boston $C$15 RECEIVED = Baton Rouge $D$15 RECEIVED = Bakersfield $E$12 Atlanta SHIPPED = $E$13 Albany SHIPPED = $E$14 Albuquerque SHIPPED = Final Shadow Constraint Allowable Allowable Value Price R.H. Side Increase Decrease 1500 7. 1500 100 750 2200 12 2200 350 750 900 6 900 350 900 1350 -9 1350 750 350 1600 -2 1600 750 100 1650 0 2000 1E+30 350 Report the optimal minimum cost (z value)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Accounting Questions!