0% found this document useful (0 votes)
52 views

Transportation Problem Unbalanced

The Solver found an optimal solution to minimize transportation costs. The solution assigns specific supply quantities from warehouses A, B, and C to meet demand quantities of 6, 10, 4, and 5 respectively for products D, E, F, and G. The optimal solution has a minimum total cost of 472 units.

Uploaded by

Vidhi Maheshwari
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
52 views

Transportation Problem Unbalanced

The Solver found an optimal solution to minimize transportation costs. The solution assigns specific supply quantities from warehouses A, B, and C to meet demand quantities of 6, 10, 4, and 5 respectively for products D, E, F, and G. The optimal solution has a minimum total cost of 472 units.

Uploaded by

Vidhi Maheshwari
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 12

Microsoft Excel 16.

0 Answer Report
Worksheet: [Book1]Sheet1
Report Created: 26-09-2021 05:27:04 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.015 Seconds.
Iterations: 11 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
$K$10 Minimum Cost: D 514 472

Variable Cells
Cell Name Original Value Final Value Integer
$K$3 A D 6 0 Contin
$L$3 A E 0 4 Contin
$M$3 A F 0 1 Contin
$N$3 A G 4 5 Contin
$K$4 B D 0 6 Contin
$L$4 B E 4 0 Contin
$M$4 B F 4 3 Contin
$N$4 B G 1 0 Contin
$K$5 C D 0 0 Contin
$L$5 C E 6 6 Contin
$M$5 C F 0 0 Contin
$N$5 C G 0 0 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$K$7 Demand D 6 $K$7>=$B$7 Binding 0
$L$7 Demand E 10 $L$7>=$C$7 Binding 0
$M$7 Demand F 4 $M$7>=$D$7 Binding 0
$N$7 Demand G 5 $N$7>=$E$7 Binding 0
$P$3 A Supply 10 $P$3<=$G$3 Binding 0
$P$4 B Supply 9 $P$4<=$G$4 Binding 0
$P$5 C Supply 6 $P$5<=$G$5 Not Binding 1
Microsoft Excel 16.0 Sensitivity Report
Worksheet: [Book1]Sheet1
Report Created: 26-09-2021 05:27:04 PM

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$K$3 AD 0 1 20 1E+030 1
$L$3 AE 4 0 21 2 0
$M$3 AF 1 0 16 1 0
$N$3 AG 5 0 18 0 20
$K$4 BD 6 0 17 1 21
$L$4 BE 0 9 28 1E+030 9
$M$4 BF 3 0 14 0 1
$N$4 BG 0 0 16 1E+030 0
$K$5 CD 0 8 29 1E+030 8
$L$5 CE 6 0 23 0 2
$M$5 CF 0 1 19 1E+030 1
$N$5 CG 0 0 20 1E+030 0

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$K$7 Demand D 6 21 6 1 1
$L$7 Demand E 10 23 10 1 6
$M$7 Demand F 4 18 4 1 1
$N$7 Demand G 5 20 5 1 5
$P$3 A Supply 10 -2 10 6 1
$P$4 B Supply 9 -4 9 1 1
$P$5 C Supply 6 0 7 1E+030 1
Microsoft Excel 16.0 Limits Report
Worksheet: [Book1]Sheet1
Report Created: 26-09-2021 05:27:04 PM

Objective
Cell Name Value
$K$10 Minimum Cost: D 472

Variable Lower Objective Upper Objective


Cell Name Value Limit Result Limit Result
$K$3 AD 0 0 472 0 472
$L$3 AE 4 4 472 4 472
$M$3 AF 1 1 472 1 472
$N$3 AG 5 5 472 5 472
$K$4 BD 6 6 472 6 472
$L$4 BE 0 0 472 0 472
$M$4 BF 3 3 472 3 472
$N$4 BG 0 0 472 0 472
$K$5 CD 0 0 472 1 501
$L$5 CE 6 6 472 7 495
$M$5 CF 0 0 472 1 491
$N$5 CG 0 0 472 1 492
Microsoft Excel 16.0 Answer Report
Worksheet: [Book1]Sheet1
Report Created: 26-09-2021 05:31:33 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.032 Seconds.
Iterations: 6 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
$K$21 mimimum cost: D 0 24750

Variable Cells
Cell Name Original Value Final Value Integer
$K$15 A D 0 0 Contin
$L$15 A E 0 75 Contin
$M$15 A F 0 100 Contin
$N$15 A G 0 25 Contin
$K$16 B D 0 75 Contin
$L$16 B E 0 25 Contin
$M$16 B F 0 0 Contin
$N$16 B G 0 0 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$K$19 Demand D 75 $K$19<=$B$19 Binding 0
$L$19 Demand E 100 $L$19<=$C$19 Binding 0
$M$19 Demand F 100 $M$19<=$D$19 Binding 0
$N$19 Demand G 25 $N$19<=$E$19 Not Binding 5
$O$15 A Supply 200 $O$15>=$G$15 Binding 0
$O$16 B Supply 100 $O$16>=$G$16 Binding 0
NonNegative
Microsoft Excel 16.0 Sensitivity Report
Worksheet: [Book1]Sheet1
Report Created: 26-09-2021 05:31:33 PM

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$K$15 AD 0 20 90 1E+030 20
$L$15 AE 75 0 90 10 5
$M$15 AF 100 0 100 0 1E+030
$N$15 AG 25 0 100 5 0
$K$16 BD 75 0 50 20 1E+030
$L$16 BE 25 0 70 5 20
$M$16 BF 0 50 130 1E+030 50
$N$16 BG 0 5 85 1E+030 5

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$K$19 Demand D 75 -30 75 25 5
$L$19 Demand E 100 -10 100 25 5
$M$19 Demand F 100 0 100 25 5
$N$19 Demand G 25 0 30 1E+030 5
$O$15 A Supply 200 100 200 5 25
$O$16 B Supply 100 80 100 5 25
Microsoft Excel 16.0 Limits Report
Worksheet: [Book1]Sheet1
Report Created: 26-09-2021 05:31:33 PM

Objective
Cell Name Value
$K$21 mimimum cost: D 24750

Variable Lower Objective Upper Objective


Cell Name Value Limit Result Limit Result
$K$15 AD 0 0 24750 0 24750
$L$15 AE 75 75 24750 75 24750
$M$15 AF 100 100 24750 100 24750
$N$15 AG 25 25 24750 30 25250
$K$16 BD 75 75 24750 75 24750
$L$16 BE 25 25 24750 25 24750
$M$16 BF 0 0 24750 0 24750
$N$16 BG 0 0 24750 5 25175
Microsoft Excel 16.0 Answer Report
Worksheet: [Transportation problem unbalanced.xlsx]Sheet1
Report Created: 30-09-2021 08:56:30 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.032 Seconds.
Iterations: 14 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
$K$33 Minimum Cost: D 0 472

Variable Cells
Cell Name Original Value Final Value Integer
$K$26 A D 0 0 Contin
$L$26 A E 0 4 Contin
$M$26 A F 0 1 Contin
$N$26 A G 0 5 Contin
$O$26 A H 0 0 Contin
$K$27 B D 0 6 Contin
$L$27 B E 0 0 Contin
$M$27 B F 0 3 Contin
$N$27 B G 0 0 Contin
$O$27 B H 0 0 Contin
$K$28 C D 0 0 Contin
$L$28 C E 0 6 Contin
$M$28 C F 0 0 Contin
$N$28 C G 0 0 Contin
$O$28 C H 0 1 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$K$30 Demand D 6 $K$30<=$B$30 Binding 0
$L$30 Demand E 10 $L$30<=$C$30 Binding 0
$M$30 Demand F 4 $M$30<=$D$30 Binding 0
$N$30 Demand G 5 $N$30<=$E$30 Binding 0
$O$30 Demand H 1 $O$30<=$F$30 Binding 0
$P$26 A Supply 10 $P$26>=$G$26 Binding 0
$P$27 B Supply 9 $P$27>=$G$27 Binding 0
$P$28 C Supply 7 $P$28>=$G$28 Binding 0
Microsoft Excel 16.0 Sensitivity Report
Worksheet: [Transportation problem unbalanced.xlsx]Sheet1
Report Created: 30-09-2021 08:56:31 PM

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$K$26 AD 0 1 20 1E+030 1
$L$26 AE 4 0 21 2 0
$M$26 AF 1 0 16 1 0
$N$26 AG 5 0 18 0 1E+030
$O$26 AH 0 2 0 1E+030 2
$K$27 BD 6 0 17 1 1E+030
$L$27 BE 0 9 28 1E+030 9
$M$27 BF 3 0 14 0 1
$N$27 BG 0 0 16 1E+030 0
$O$27 BH 0 4 0 1E+030 4
$K$28 CD 0 8 29 1E+030 8
$L$28 CE 6 0 23 0 2
$M$28 CF 0 1 19 1E+030 1
$N$28 CG 0 0 20 1E+030 0
$O$28 CH 1 0 0 2 1E+030

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$K$30 Demand D 6 -2 6 3 0
$L$30 Demand E 10 0 10 1E+030 0
$M$30 Demand F 4 -5 4 4 0
$N$30 Demand G 5 -3 5 4 0
$O$30 Demand H 1 -23 1 6 0
$P$26 A Supply 10 21 10 0 4
$P$27 B Supply 9 19 9 0 3
$P$28 C Supply 7 23 7 0 6
Microsoft Excel 16.0 Limits Report
Worksheet: [Transportation problem unbalanced.xlsx]Sheet1
Report Created: 30-09-2021 08:56:31 PM

Objective
Cell Name Value
$K$33 Minimum Cost: D 472

Variable Lower Objective Upper Objective


Cell Name Value Limit Result Limit Result
$K$26 AD 0 0 472 0 472
$L$26 AE 4 4 472 4 472
$M$26 AF 1 1 472 1 472
$N$26 AG 5 5 472 5 472
$O$26 AH 0 0 472 0 472
$K$27 BD 6 6 472 6 472
$L$27 BE 0 0 472 0 472
$M$27 BF 3 3 472 3 472
$N$27 BG 0 0 472 0 472
$O$27 BH 0 0 472 0 472
$K$28 CD 0 0 472 0 472
$L$28 CE 6 6 472 6 472
$M$28 CF 0 0 472 0 472
$N$28 CG 0 0 472 0 472
$O$28 CH 1 1 472 1 472
D E F G Supply
A 20 21 16 18 0 10
B 17 28 14 16 0 9
C 29 23 19 20 0 7

Demand 6 10 4 5

D E F G Supply
A 90 90 100 100 200
B 50 70 130 85 100

Demand 75 100 100 30

D E F G H Supply
A 20 21 16 18 0 10
B 17 28 14 16 0 9
C 29 23 19 20 0 7

Demand 6 10 4 5 1
D E F G Supply
A 0 4 1 5 10
B 6 0 3 0 9
C 0 6 0 0 6

Demand 6 10 4 5

Minimum Cost: 472

D E F G Supply
A 0 75 100 25 200
B 75 25 0 0 100

Demand 75 100 100 25

mimimum cost: 24750

D E F G H Supply
A 0 4 1 5 0 10
B 6 0 3 0 0 9
C 0 6 0 0 1 7

Demand 6 10 4 5 1

Minimum Cost: 472

You might also like