Microsoft Excel 16.

0 Answer Report
Worksheet: [Lab6.xlsx]Problem 1 - Ch5 Pr9
Report Created: 10-03-2022 00:44:34
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: GRG Nonlinear
Solution Time: 0 Seconds.
Iterations: 0 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Convergence 0.0001, Population Size 100, Random Seed 0, Derivatives Forward, Require Bounds
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Max)

Cell Name Original Value Final Value
$D$3 Profit 372.727274193 372.72727419

Variable Cells
Cell Name Original Value Final Value Integer
$B$2 # Made Bowls 2.72727277038 2.7272727704 Contin
$C$2 # Made Vases 5.90909089185 5.9090908918 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$D$4 Clay 35 $D$4<=$F$4 Binding 0
$D$5 Labor 20.0000000948 $D$5<=$F$5 Binding 0
 Bowls Vases
# Made 2.72727277 5.90909089
Profit 50 40 372.7273 Profit
Clay 2 5 35 <= 35
Labor 3 2 20 <= 20
Microsoft Excel 16.0 Answer Report
Worksheet: [Lab6.xlsx]Problem 1 - Ch5 Pr9 INTEGER
Report Created: 10-03-2022 00:45:37
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.016 Seconds.
Iterations: 1 Subproblems: 6
Solver Options
Max Time 100 sec, Iterations 100, Precision 0.000001
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 0%, Assume NonNegative

Objective Cell (Max)

Cell Name Original Value Final Value
$D$3 Profit 360 360

Variable Cells
Cell Name Original Value Final Value Integer
$B$2 # Made Bowls 4 4 Integer
$C$2 # Made Vases 4 4 Integer

Constraints
Cell Name Cell Value Formula Status Slack
$D$4 Clay 28 $D$4<=$F$4 Not Binding 7
$D$5 Labor 20 $D$5<=$F$5 Binding 0
$B$2:$C$2=Integer
 Problem 1 - Ch5 Pr9 INTEGER

Bowls Vases
# Made 4 4
Profit 50 40 360 Profit
Clay 2 5 28 <= 35
Labor 3 2 20 <= 20

Page 4
Microsoft Excel 16.0 Answer Report
Worksheet: [Lab6.xlsx]Problem 2 - Ch5 Pr14
Report Created: 10-03-2022 00:45:47
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.047 Seconds.
Iterations: 1 Subproblems: 32
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 0%, Assume NonNegative

Objective Cell (Max)

Cell Name Original Value Final Value
$J$4 Profit ($) 1.99 1.99

Variable Cells
Cell Name Original Value Final Value Integer
$B$3 Project Selected? Projects 0 0 Binary
$C$3 Project Selected? 1 1 Binary
$D$3 Project Selected? 0 0 Binary
$E$3 Project Selected? 0 0 Binary
$F$3 Project Selected? 1 1 Binary
$G$3 Project Selected? 1 1 Binary
$H$3 Project Selected? 0 0 Binary
$I$3 Project Selected? 0 0 Binary

Constraints
Cell Name Cell Value Formula Status Slack
$J$5 Expense ($) 287,000 $J$5<=$L$5 Not Binding 13000
$J$6 Scientists required 22 $J$6<=$L$6 Not Binding 18
$J$7 If-Then - $J$7>=$L$7 Binding -
$B$3:$I$3=Binary
 Projects
1 2 3 4 5 6 7 8
Project Selected? 0 1 0 0 1 1 0 0
Profit ($) 0.36 0.82 0.29 0.16 0.56 0.61 0.48 0.41
Expense ($) 60,000 110,000 53,000 47,000 92,000 85,000 73,000 65,000
Scientists required 7 9 8 4 7 6 8 5
If-Then -1 1
 1.99
287,000 <= 300,000
22 <= 40
- >= 0
Microsoft Excel 16.0 Answer Report
Worksheet: [Lab6.xlsx]Problem 3 - Ch5 Pr20
Report Created: 10-03-2022 00:45:58
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.031 Seconds.
Iterations: 6 Subproblems: 6
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 0%, Assume NonNegative

Objective Cell (Min)

Cell Name Original Value Final Value
$AA$3 Obj. Values 720,750,000 720,750,000

Variable Cells
Cell Name Original Value Final Value Integer
$B$2 Value x1A 0 0 Integer
$C$2 Value x1B 12000 12000 Integer
$D$2 Value x1C 0 0 Integer
$E$2 Value x1D 0 0 Integer
$F$2 Value x2A 0 0 Integer
$G$2 Value x2B 0 0 Integer
$H$2 Value x2C 8000 8000 Integer
$I$2 Value x2D 0 0 Integer
$J$2 Value x3A 6000 6000 Integer
$K$2 Value x3B 0 0 Integer
$L$2 Value x3C 0 0 Integer
$M$2 Value x3D 0 0 Integer
$N$2 Value x4A 0 0 Integer
$O$2 Value x4B 2000 2000 Integer
$P$2 Value x4C 0 0 Integer
$Q$2 Value x4D 8000 8000 Integer
$R$2 Value x5A 0 0 Integer
$S$2 Value x5B 0 0 Integer
$T$2 Value x5C 0 0 Integer
$U$2 Value x5D 2000 2000 Integer
$V$2 Value y1 1 1 Binary
$W$2 Value y2 1 1 Binary
$X$2 Value y3 1 1 Binary
$Y$2 Value y4 1 1 Binary
$Z$2 Value y5 1 1 Binary

Constraints
Cell Name Cell Value Formula Status Slack
$AA$4 Plant 1 0 $AA$4<=$AC$4 Binding 0
$AA$5 Plant 2 -10,000 $AA$5<=$AC$5 Not Binding 10000
$AA$6 Plant 3 -8,000 $AA$6<=$AC$6 Not Binding 8000
$AA$7 Plant 4 0 $AA$7<=$AC$7 Binding 0
$AA$8 Plant 5 -14,000 $AA$8<=$AC$8 Not Binding 14000
$AA$9 Warehouse A 6,000 $AA$9=$AC$9 Binding 0
$AA$10 Warehouse B 14,000 $AA$10=$AC$10 Binding 0
$AA$11 Warehouse C 8,000 $AA$11=$AC$11 Binding 0
$AA$12 Warehouse D 10,000 $AA$12=$AC$12 Binding 0
$B$2:$U$2=Integer
$V$2:$Z$2=Binary
 x1A x1B x1C x1D x2A x2B x2C x2D x3A x3B x3C x3D x4A
Value 0 12000 0 0 0 0 8000 0 6000 0 0 0 0
Obj. Values 56000 21000 32000 65000 18000 46000 7000 35000 12000 71000 41000 52000 30000
Plant 1 1 1 1 1
Plant 2 1 1 1 1
Plant 3 1 1 1 1
Plant 4 1
Plant 5
Warehouse A 1 1 1 1
Warehouse B 1 1 1
Warehouse C 1 1 1
Warehouse D 1 1 1
 x4B x4C x4D x5A x5B x5C x5D y1 y2 y3 y4 y5
2000 0 8000 0 0 0 2000 1 1 1 1 1
24000 61000 28000 45000 50000 26000 31000 2,100,000 850,000 1,800,000 1,100,000 900,000
-12000
-18000
-14000
1 1 1 -10000
1 1 1 1 -16000
1
1 1
1 1
1 1
720,750,000
0 <= 0
-10,000 <= 0
-8,000 <= 0
0 <= 0
-14,000 <= 0
6,000 = 6,000
14,000 = 14,000
8,000 = 8,000
10,000 = 10,000
Microsoft Excel 16.0 Answer Report
Worksheet: [Lab6.xlsx]Problem 4B - Ch5Pr40
Report Created: 10-03-2022 00:46:07
Result: Solver found an integer solution within tolerance. All Constraints are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.031 Seconds.
Iterations: 3 Subproblems: 6
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 0%, Assume NonNegative

Objective Cell (Min)

Cell Name Original Value Final Value
$L$15 Hub Selections # Covering This City 3 3

Variable Cells
Cell Name Original Value Final Value Integer
$B$15 Hub Selections Atlanta 1 1 Binary
$C$15 Hub Selections Charlotte 0 0 Binary
$D$15 Hub Selections Cincinnati 0 0 Binary
$E$15 Hub Selections Cleveland 0 0 Binary
$F$15 Hub Selections Indiannapolis 0 0 Binary
$G$15 Hub Selections Louisville 0 0 Binary
$H$15 Hub Selections Nashville 0 0 Binary
$I$15 Hub Selections Pittsburgh 1 1 Binary
$J$15 Hub Selections Richmond 0 0 Binary
$K$15 Hub Selections St. Louis 1 1 Binary

Constraints
Cell Name Cell Value Formula Status
$L$14 Fixed Charge # Covering This City 897 $L$14<=$N$14 Not Binding
$L$4 1. Atlanta # Covering This City 1 $L$4>=$N$4 Binding
$L$5 2. Charlotte # Covering This City 1 $L$5>=$N$5 Binding
$L$6 3. Cincinnati # Covering This City 1 $L$6>=$N$6 Binding
$L$7 4. Cleveland # Covering This City 1 $L$7>=$N$7 Binding
$L$8 5. Indianapolis # Covering This City 1 $L$8>=$N$8 Binding
$L$9 6. Louisville # Covering This City 1 $L$9>=$N$9 Binding
$L$10 7. Nashville # Covering This City 2 $L$10>=$N$10 Not Binding
$L$11 8. Pittsburgh # Covering This City 1 $L$11>=$N$11 Binding
$L$12 9. Richmond # Covering This City 1 $L$12>=$N$12 Binding
$L$13 10. St. Louis # Covering This City 1 $L$13>=$N$13 Binding
$B$15:$K$15=Binary
Slack
3
0
0
0
0
0
0
1
0
0
0
 Cities Within 300 Miles
1 2 3 4 5 6 7
Hub Sites Atlanta Charlotte Cincinnati Cleveland Indiannapolis Louisville Nashville
1. Atlanta 1 1 1
2. Charlotte 1 1
3. Cincinnati 1 1 1 1 1
4. Cleveland 1 1 1
5. Indianapolis 1 1 1 1 1
6. Louisville 1 1 1 1
7. Nashville 1 1 1 1 1
8. Pittsburgh 1 1
9. Richmond 1
10. St. Louis 1 1 1
Fixed Charge 276 253 394 408 282 365 268
Hub Selections 1 0 0 0 0 0 0
 8 9 10
Pittsburgh Richmond St. Louis # Covering This City
1 >= 1
1 1 >= 1
1 1 >= 1
1 1 >= 1
1 1 >= 1
1 1 >= 1
1 2 >= 1
1 1 1 >= 1
1 1 1 >= 1
1 1 >= 1
323 385 298 897 <= 900
1 0 1 3
Microsoft Excel 16.0 Answer Report
Worksheet: [Lab6.xlsx]Problem 4C - Ch5Pr40
Report Created: 10-03-2022 00:46:18
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.031 Seconds.
Iterations: 2 Subproblems: 4
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 0%, Assume NonNegative

Objective Cell (Min)

Cell Name Original Value Final Value
$L$14 Fixed Charge # Covering This City 825 825

Variable Cells
Cell Name Original Value Final Value Integer
$B$15 Hub Selections Atlanta 0 0 Binary
$C$15 Hub Selections Charlotte 1 1 Binary
$D$15 Hub Selections Cincinnati 1 1 Binary
$E$15 Hub Selections Cleveland 0 0 Binary
$F$15 Hub Selections Indiannapolis 0 0 Binary
$G$15 Hub Selections Louisville 0 0 Binary
$H$15 Hub Selections Nashville 1 1 Binary
$I$15 Hub Selections Pittsburgh 0 0 Binary
$J$15 Hub Selections Richmond 0 0 Binary
$K$15 Hub Selections St. Louis 0 0 Binary

Constraints
Cell Name Cell Value Formula Status
$L$4 1. Atlanta # Covering This City 2 $L$4>=$N$4 Not Binding
$L$5 2. Charlotte # Covering This City 1 $L$5>=$N$5 Binding
$L$6 3. Cincinnati # Covering This City 2 $L$6>=$N$6 Not Binding
$L$7 4. Cleveland # Covering This City 1 $L$7>=$N$7 Binding
$L$8 5. Indianapolis # Covering This City 2 $L$8>=$N$8 Not Binding
$L$9 6. Louisville # Covering This City 2 $L$9>=$N$9 Not Binding
$L$10 7. Nashville # Covering This City 2 $L$10>=$N$10 Not Binding
$L$11 8. Pittsburgh # Covering This City 1 $L$11>=$N$11 Binding
$L$12 9. Richmond # Covering This City 1 $L$12>=$N$12 Binding
$L$13 10. St. Louis # Covering This City 1 $L$13>=$N$13 Binding
$B$15:$K$15=Binary
Slack
1
0
1
0
1
1
1
0
0
0
 Cities Within 300 Miles
1 2 3 4 5 6 7
Hub Sites Atlanta Charlotte Cincinnati Cleveland Indiannapolis Louisville Nashville
1. Atlanta 1 1 1
2. Charlotte 1 1
3. Cincinnati 1 1 1 1 1
4. Cleveland 1 1 1
5. Indianapolis 1 1 1 1 1
6. Louisville 1 1 1 1
7. Nashville 1 1 1 1 1
8. Pittsburgh 1 1
9. Richmond 1
10. St. Louis 1 1 1
Fixed Charge 276 253 304 408 282 365 268
Hub Selections 0 1 1 0 0 0 1
 8 9 10
Pittsburgh Richmond St. Louis # Covering This City
2 >= 1
1 1 >= 1
1 2 >= 1
1 1 >= 1
1 2 >= 1
1 2 >= 1
1 2 >= 1
1 1 1 >= 1
1 1 1 >= 1
1 1 >= 1
323 385 298 825
0 0 0