M1 M2 M3 M4 M5 SUPPLY
F1 7 6 4 5 9 40
F2 8 5 6 7 8 30
F3 6 8 9 6 5 20
F4 5 7 7 8 6 10
100
DEMAND 30 30 15 20 5 100
M1 M2 M3 M4 M5 SUPPLY
F1 5 0 15 20 0 40 40
F2 0 30 0 0 0 30 30
F3 15 0 0 0 5 20 20
F4 10 0 0 0 0 10 10
30 30 15 20 5 100
DEMAND 30 30 15 20 5 100
510
Microsoft Excel 16.0 Answer Report
Worksheet: [Transportation Problem - Labs.xlsx]Exercise - 1
Report Created: 2/19/2024 3:20:12 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.032 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
$B$18 M1 0 510
Variable Cells
Cell Name Original Value Final Value Integer
$B$11 F1 M1 0 5 Contin
$C$11 F1 M2 0 0 Contin
$D$11 F1 M3 0 15 Contin
$E$11 F1 M4 0 20 Contin
$F$11 F1 M5 0 0 Contin
$B$12 F2 M1 0 0 Contin
$C$12 F2 M2 0 30 Contin
$D$12 F2 M3 0 0 Contin
$E$12 F2 M4 0 0 Contin
$F$12 F2 M5 0 0 Contin
$B$13 F3 M1 0 15 Contin
$C$13 F3 M2 0 0 Contin
$D$13 F3 M3 0 0 Contin
$E$13 F3 M4 0 0 Contin
$F$13 F3 M5 0 5 Contin
$B$14 F4 M1 0 10 Contin
$C$14 F4 M2 0 0 Contin
$D$14 F4 M3 0 0 Contin
$E$14 F4 M4 0 0 Contin
$F$14 F4 M5 0 0 Contin
Constraints
Cell Name Cell Value Formula Status Slack
$B$15 M1 30 $B$15=$B$16 Binding 0
$C$15 M2 30 $C$15=$C$16 Binding 0
$D$15 M3 15 $D$15=$D$16 Binding 0
$E$15 M4 20 $E$15=$E$16 Binding 0
$F$15 M5 5 $F$15=$F$16 Binding 0
$G$11 F1 40 $G$11>=$H$11 Binding 0
$G$12 F2 30 $G$12>=$H$12 Binding 0
$G$13 F3 20 $G$13>=$H$13 Binding 0
$G$14 F4 10 $G$14>=$H$14 Binding 0
1 2 3 4 5 SUPPLY
A 4 3 1 2 6 80
B 5 2 3 4 5 60
C 3 5 6 3 2 40
D 2 4 4 5 3 20
DEMAND 60 60 30 40 10
1 2 3 4 5 SUPPLY
A 10 0 30 40 0 80 80
B 0 60 0 0 0 60 60
C 30 0 0 0 10 40 40
D 20 0 0 0 0 20 20
60 60 30 40 10 200
DEMAND 60 60 30 40 10 200
420
Microsoft Excel 16.0 Answer Report
Worksheet: [Transportation Problem - Labs.xlsx]Exercise - 2
Report Created: 2/19/2024 3:33:51 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.032 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
$B$19 0 420
Variable Cells
Cell Name Original Value Final Value Integer
$B$12 A 0 10 Contin
$C$12 A 0 0 Contin
$D$12 A 0 30 Contin
$E$12 A 0 40 Contin
$F$12 A 0 0 Contin
$B$13 B 0 0 Contin
$C$13 B 0 60 Contin
$D$13 B 0 0 Contin
$E$13 B 0 0 Contin
$F$13 B 0 0 Contin
$B$14 C 0 30 Contin
$C$14 C 0 0 Contin
$D$14 C 0 0 Contin
$E$14 C 0 0 Contin
$F$14 C 0 10 Contin
$B$15 D 0 20 Contin
$C$15 D 0 0 Contin
$D$15 D 0 0 Contin
$E$15 D 0 0 Contin
$F$15 D 0 0 Contin
Constraints
Cell Name Cell Value Formula Status Slack
$B$16 60 $B$16=$B$17 Binding 0
$C$16 60 $C$16=$C$17 Binding 0
$D$16 30 $D$16=$D$17 Binding 0
$E$16 40 $E$16=$E$17 Binding 0
$F$16 10 $F$16=$F$17 Binding 0
$G$12 A 80 $G$12>=$H$12 Binding 0
$G$13 B 60 $G$13>=$H$13 Binding 0
$G$14 C 40 $G$14>=$H$14 Binding 0
$G$15 D 20 $G$15>=$H$15 Binding 0
D1 D2 D3 D4 D5 SUPPLY
O1 68 35 4 74 15 18
O2 57 88 91 3 8 17
O3 91 60 75 45 60 19
O4 52 53 24 7 82 13
O5 51 18 82 13 7 15
82
DEMAND 16 18 20 14 14 82
D1 D2 D3 D4 D5 SUPPLY
O1 0 0 18 0 0 18 18
O2 0 0 0 14 3 17 17
O3 5 14 0 0 0 19 19
O4 11 0 2 0 0 13 13
O5 0 4 0 0 11 15 15
16 18 20 14 14 82
DEMAND 16 18 20 14 14 82
2202
Microsoft Excel 16.0 Answer Report
Worksheet: [Transportation Problem - Labs.xlsx]Exercise - 3
Report Created: 2/19/2024 3:49:07 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.031 Seconds.
Iterations: 18 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
$B$20 D1 0 2202
Variable Cells
Cell Name Original Value Final Value Integer
$B$12 O1 D1 0 0 Contin
$C$12 O1 D2 0 0 Contin
$D$12 O1 D3 0 18 Contin
$E$12 O1 D4 0 0 Contin
$F$12 O1 D5 0 0 Contin
$B$13 O2 D1 0 0 Contin
$C$13 O2 D2 0 0 Contin
$D$13 O2 D3 0 0 Contin
$E$13 O2 D4 0 14 Contin
$F$13 O2 D5 0 3 Contin
$B$14 O3 D1 0 5 Contin
$C$14 O3 D2 0 14 Contin
$D$14 O3 D3 0 0 Contin
$E$14 O3 D4 0 0 Contin
$F$14 O3 D5 0 0 Contin
$B$15 O4 D1 0 11 Contin
$C$15 O4 D2 0 0 Contin
$D$15 O4 D3 0 2 Contin
$E$15 O4 D4 0 0 Contin
$F$15 O4 D5 0 0 Contin
$B$16 O5 D1 0 0 Contin
$C$16 O5 D2 0 4 Contin
$D$16 O5 D3 0 0 Contin
$E$16 O5 D4 0 0 Contin
$F$16 O5 D5 0 11 Contin
Constraints
Cell Name Cell Value Formula Status Slack
$B$17 D1 16 $B$17=$B$18 Binding 0
$C$17 D2 18 $C$17=$C$18 Binding 0
$D$17 D3 20 $D$17=$D$18 Binding 0
$E$17 D4 14 $E$17=$E$18 Binding 0
$F$17 D5 14 $F$17=$F$18 Binding 0
$G$12 O1 18 $G$12>=$H$12 Binding 0
$G$13 O2 17 $G$13>=$H$13 Binding 0
$G$14 O3 19 $G$14>=$H$14 Binding 0
$G$15 O4 13 $G$15>=$H$15 Binding 0
$G$16 O5 15 $G$16>=$H$16 Binding 0
A B C SUPPLY
1 2 7 4 5
2 3 3 1 8
3 5 4 7 7
4 1 6 2 14
DEMAND 7 9 18
A B C SUPPLY
1 5 0 0 5 5
2 0 2 6 8 8
3 0 7 0 7 7
4 2 0 12 14 14
7 9 18
DEMAND 7 9 18
76
Microsoft Excel 16.0 Answer Report
Worksheet: [Transportation Problem - Labs.xlsx]Exercise - 6
Report Created: 2/19/2024 4:21:11 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.031 Seconds.
Iterations: 13 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
$B$18 A 0 76
Variable Cells
Cell Name Original Value Final Value Integer
$B$11 A 0 5 Contin
$C$11 B 0 0 Contin
$D$11 C 0 0 Contin
$B$12 A 0 0 Contin
$C$12 B 0 2 Contin
$D$12 C 0 6 Contin
$B$13 A 0 0 Contin
$C$13 B 0 7 Contin
$D$13 C 0 0 Contin
$B$14 A 0 2 Contin
$C$14 B 0 0 Contin
$D$14 C 0 12 Contin
Constraints
Cell Name Cell Value Formula Status Slack
$B$15 A 7 $B$15=$B$16 Binding 0
$C$15 B 9 $C$15=$C$16 Binding 0
$D$15 C 18 $D$15=$D$16 Binding 0
$E$11 5 $E$11>=$F$11 Binding 0
$E$12 8 $E$12>=$F$12 Binding 0
$E$13 7 $E$13>=$F$13 Binding 0
$E$14 14 $E$14>=$F$14 Binding 0
A B C D E F SUPPLY
1 9 12 9 6 9 10 5
2 7 3 7 7 5 5 6
3 6 5 9 11 3 11 2
4 6 8 11 2 2 10 9
22
DEMAND 4 4 6 2 4 2 22
A B C D E F SUPPLY
1 0 0 5 0 0 0 5 5
2 0 4 0 0 0 2 6 6
3 1 0 1 0 0 0 2 2
4 3 0 0 2 4 0 9 9
4 4 6 2 4 2 22
DEMAND 4 4 6 2 4 2 22
112
Microsoft Excel 16.0 Answer Report
Worksheet: [Transportation Problem - Labs.xlsx]Exercise - 7
Report Created: 2/19/2024 4:13:21 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.031 Seconds.
Iterations: 18 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
$B$17 A 0 112
Variable Cells
Cell Name Original Value Final Value Integer
$B$10 A 0 0 Contin
$C$10 B 0 0 Contin
$D$10 C 0 5 Contin
$E$10 D 0 0 Contin
$F$10 E 0 0 Contin
$G$10 F 0 0 Contin
$B$11 A 0 0 Contin
$C$11 B 0 4 Contin
$D$11 C 0 0 Contin
$E$11 D 0 0 Contin
$F$11 E 0 0 Contin
$G$11 F 0 2 Contin
$B$12 A 0 1 Contin
$C$12 B 0 0 Contin
$D$12 C 0 1 Contin
$E$12 D 0 0 Contin
$F$12 E 0 0 Contin
$G$12 F 0 0 Contin
$B$13 A 0 3 Contin
$C$13 B 0 0 Contin
$D$13 C 0 0 Contin
$E$13 D 0 2 Contin
$F$13 E 0 4 Contin
$G$13 F 0 0 Contin
Constraints
Cell Name Cell Value Formula Status Slack
$B$14 A 4 $B$14=$B$15 Binding 0
$C$14 B 4 $C$14=$C$15 Binding 0
$D$14 C 6 $D$14=$D$15 Binding 0
$E$14 D 2 $E$14=$E$15 Binding 0
$F$14 E 4 $F$14=$F$15 Binding 0
$G$14 F 2 $G$14=$G$15 Binding 0
$H$10 5 $H$10>=$I$10 Binding 0
$H$11 6 $H$11>=$I$11 Binding 0
$H$12 2 $H$12>=$I$12 Binding 0
$H$13 9 $H$13>=$I$13 Binding 0
