Microsoft Excel 16.

0 Answer Report
Worksheet: [Solver_Excel]Q1 A Part
Report Created: 12/13/2020 7:40:11 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.172 Seconds.
Iterations: 3 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Max)

Cell Name Original Value Final Value
$E$6 0 5540

Variable Cells
Cell Name Original Value Final Value Integer
$B$6 X1 0 60 Contin
$C$6 X2 0 80 Contin
$D$6 X3 0 60 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$E$7 A 450 $E$7<=$G$7 Binding 0
$E$8 B 350 $E$8<=$G$8 Binding 0
$E$9 C 50 $E$9<=$G$9 Binding 0
onNegative
Q1 A] [Hart Manufacturing]

X1 X2 X3
60 80 60 5540
A 1.5 3 2 450 <= 450
B 2 1 2.5 350 <= 350
C 0.25 0.25 0.25 50 <= 50

Max 25 28 30

Total Profit = 5540

Microsoft Excel 16.0 Answer Report
Worksheet: [Book2]Question 1 E Part
Report Created: 12/13/2020 9:58:47 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.25 Seconds.
Iterations: 3 Subproblems: 8
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Max)

Cell Name Original Value Final Value
$L$9 Max 0.00 4350.00

Variable Cells
Cell Name Original Value Final Value Integer
$F$8 X1 0 100 Contin
$G$8 X2 0 100 Contin
$H$8 X3 0 0 Contin
$I$8 P1 0.0000 1.0000 Binary
$J$8 P2 0.0000 1.0000 Binary
$K$8 P3 0.0000 0.0000 Binary

Constraints
Cell Name Cell Value Formula Status Slack
$L$11 A 450 $L$11<=$N$11 Binding 0
$L$12 B 300 $L$12<=$N$12 Not Binding 50
$L$13 C 50 $L$13<=$N$13 Binding 0
$L$14 P1 -75 $L$14<=$N$14 Not Binding 75
$L$15 P2 -50 $L$15<=$N$15 Not Binding 50
$L$16 P3 0 $L$16<=$N$16 Binding 0
$I$8=Binary
$J$8=Binary
$K$8=Binary
 X1 X2 X3 P1 P2
100 100 0 1.0000 1.0000
Max 25 28 30 -400 -550

A 1.5 3 2 0 0
B 2 1 2.5 0 0
C 0.25 0.25 0.25 0 0
P1 1 0 0 -175 0
P2 0 1 0 0 -150
P3 0 0 1 0 0

Projected total profit contribution = $ 4,350

profit contribution = 4350 - 3990 = $ 360
 P3
0.0000
-600 4350.00

0 450 <= 450

0 300 <= 350
0 50 <= 50
0 -75 <= 0
0 -50 <= 0
-140 0 <= 0

on = $ 4,350
Microsoft Excel 16.0 Answer Report
Worksheet: [Book2]Sheet14
Report Created: 12/13/2020 10:08:10 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.281 Seconds.
Iterations: 13 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Min)

Cell Name Original Value Final Value
$O$18 Decision Variables 0 3

Variable Cells
Cell Name Original Value Final Value Integer
$C$18 Decision Variables Boston 0 0 Binary
$D$18 Decision Variables New York 0 0 Binary
$E$18 Decision Variables Philadelphia 0 1 Binary
$F$18 Decision Variables Baltimore 0 0 Binary
$G$18 Decision Variables Washington 0 0 Binary
$H$18 Decision Variables Richmond 0 0 Binary
$I$18 Decision Variables Raleigh 0 0 Binary
$J$18 Decision Variables Florence 0 0 Binary
$K$18 Decision Variables Savannah 0 0 Binary
$L$18 Decision Variables Jacksonville 0 1 Binary
$M$18 Decision Variables Tampa 0 1 Binary
$N$18 Decision Variables Miami 0 0 Binary

Constraints
Cell Name Cell Value Formula Status Slack
$O$19 Boston 1 $O$19>=$Q$19 Binding 0
$O$20 New York 1 $O$20>=$Q$20 Binding 0
$O$21 Philadelphia 1 $O$21>=$Q$21 Binding 0
$O$22 Baltimore 1 $O$22>=$Q$22 Binding 0
$O$23 Washington 1 $O$23>=$Q$23 Binding 0
$O$24 Richmond 1 $O$24>=$Q$24 Binding 0
$O$25 Raleigh 1 $O$25>=$Q$25 Binding 0
$O$26 Florence 1 $O$26>=$Q$26 Binding 0
$O$27 Savannah 2 $O$27>=$Q$27 Not Binding 1
$O$28 Jacksonville 2 $O$28>=$Q$28 Not Binding 1
$O$29 Tampa 2 $O$29>=$Q$29 Not Binding 1
$O$30 Miami 1 $O$30>=$Q$30 Binding 0
$C$18:$N$18=Binary
Q.2) B.East Coast Trucking

Boston New YorkPhiladelphiaBaltimoreWashingtonRichmond Raleigh Florence

Boston 0 211 320 424 459 565 713 884
New York 109 213 248 354 502 673
Philadelphia 104 139 245 393 564
Baltimore 35 141 289 460
Washington 106 254 425
Richmond 148 319
Raleigh 171
Florence
Savannah
Jacksonville
Tampa

1 2 3 4 5 6 7 8
Boston New YorkPhiladelphiaBaltimoreWashingtonRichmond Raleigh Florence
Decision V 0 0 1 0 0 0 0 0
Boston 1 1 1 0 0 0 0 0
New York 1 1 1 1 1 1 0 0
Philadelphi 1 1 1 1 1 1 1 0
Baltimore 0 1 1 1 1 1 1 0
Washingto 0 1 1 1 1 1 1 0
Richmond 0 1 1 1 1 1 1 1
Raleigh 0 0 1 1 1 1 1 1
Florence 0 0 0 0 0 1 1 1
Savannah 0 0 0 0 0 0 1 1
Jacksonvill 0 0 0 0 0 0 0 1
Tampa 0 0 0 0 0 0 0 0
Miami 0 0 0 0 0 0 0 0

ANS: The Minimum Number of service facilities required are : 3

Facilities should be located at Philadelphia, Jacksonville and Tempa
SavannahJacksonville Tampa Miami
1056 1196 1399 1669
845 985 1188 1458
736 876 1079 1349
632 772 975 1245
597 737 940 1210
491 631 834 1104
343 483 686 956
172 312 515 785
140 343 613
203 473
270

9 10 11 12
SavannahJacksonville Tampa Miami
0 1 1 0 3
0 0 0 0 1 >= 1
0 0 0 0 1 >= 1
0 0 0 0 1 >= 1
0 0 0 0 1 >= 1
0 0 0 0 1 >= 1
0 0 0 0 1 >= 1
1 0 0 0 1 >= 1
1 1 0 0 1 >= 1
1 1 1 0 2 >= 1
1 1 1 0 2 >= 1
1 1 1 1 2 >= 1
0 0 1 1 1 >= 1
Microsoft Excel 16.0 Answer Report
Worksheet: [Book2]Sheet16
Report Created: 12/13/2020 10:13:40 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.422 Seconds.
Iterations: 17 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Min)

Cell Name Original Value Final Value
$O$4 Decision Variables 0 4

Variable Cells
Cell Name Original Value Final Value Integer
$C$4 Decision Variables Boston 0 1 Binary
$D$4 Decision Variables New York 0 0 Binary
$E$4 Decision Variables Philadelphia 0 0 Binary
$F$4 Decision Variables Baltimore 0 1 Binary
$G$4 Decision Variables Washington 0 0 Binary
$H$4 Decision Variables Richmond 0 0 Binary
$I$4 Decision Variables Raleigh 0 0 Binary
$J$4 Decision Variables Florence 0 0 Binary
$K$4 Decision Variables Savannah 0 1 Binary
$L$4 Decision Variables Jacksonville 0 0 Binary
$M$4 Decision Variables Tampa 0 1 Binary
$N$4 Decision Variables Miami 0 0 Binary

Constraints
Cell Name Cell Value Formula Status Slack
$O$5 Boston 1 $O$5>=$Q$5 Binding 0
$O$6 New York 2 $O$6>=$Q$6 Not Binding 1
$O$7 Philadelphia 1 $O$7>=$Q$7 Binding 0
$O$8 Baltimore 1 $O$8>=$Q$8 Binding 0
$O$9 Washington 1 $O$9>=$Q$9 Binding 0
$O$10 Richmond 1 $O$10>=$Q$10 Binding 0
$O$11 Raleigh 1 $O$11>=$Q$11 Binding 0
$O$12 Florence 1 $O$12>=$Q$12 Binding 0
$O$13 Savannah 1 $O$13>=$Q$13 Binding 0
$O$14 Jacksonville 2 $O$14>=$Q$14 Not Binding 1
$O$15 Tampa 1 $O$15>=$Q$15 Binding 0
$O$16 Miami 1 $O$16>=$Q$16 Binding 0
$C$4:$N$4=Binary
Q.2.C)
1 2 3 4 5 6 7 8
Boston New YorkPhiladelphiaBaltimoreWashingtonRichmond Raleigh Florence
Decision V 1 0 0 1 0 0 0 0
Boston 1 1 0 0 0 0 0 0
New York 1 1 1 1 1 0 0 0
Philadelphi 0 1 1 1 1 1 0 0
Baltimore 0 1 1 1 1 1 1 0
Washingto 0 1 1 1 1 1 1 0
Richmond 0 0 1 1 1 1 1 0
Raleigh 0 0 0 1 1 1 1 1
Florence 0 0 0 0 0 0 1 1
Savannah 0 0 0 0 0 0 0 1
Jacksonvill 0 0 0 0 0 0 0 0
Tampa 0 0 0 0 0 0 0 0
Miami 0 0 0 0 0 0 0 0

ANS: The Minimum Number of service facilities required are : 4

Facilities should be located at Boston, Baltimore, Savannah and Tampa
 9 10 11 12
SavannahJacksonville Tampa Miami
1 0 1 0 4
0 0 0 0 1 >= 1
0 0 0 0 2 >= 1
0 0 0 0 1 >= 1
0 0 0 0 1 >= 1
0 0 0 0 1 >= 1
0 0 0 0 1 >= 1
0 0 0 0 1 >= 1
1 0 0 0 1 >= 1
1 1 0 0 1 >= 1
1 1 1 0 2 >= 1
0 1 1 1 1 >= 1
0 0 1 1 1 >= 1