0% found this document useful (0 votes)
17 views5 pages

Cost Destination Problem

The document presents a distribution problem with the goal of minimizing costs. There are 3 distribution centers and 3 plants. The optimal solution assigns shipments from each plant to distribution centers to minimize total distribution costs of $414,200 while respecting the capacity constraints of each distribution center.

Uploaded by

Dhani Almahendra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
17 views5 pages

Cost Destination Problem

The document presents a distribution problem with the goal of minimizing costs. There are 3 distribution centers and 3 plants. The optimal solution assigns shipments from each plant to distribution centers to minimize total distribution costs of $414,200 while respecting the capacity constraints of each distribution center.

Uploaded by

Dhani Almahendra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd

DISTRIBUTION PROBLEM

Cost Table MIN $ 414,200


Distribution Center
DC 1 DC 2 DC 3 Capacity DC 1 DC 2
PLANT A $ 80 $ 100 $ 215 1400 PLANT A 1400 0
PL

PLANT B $ 108 $ 233 $ 100 1900 PLANT B 700 0


AN

PLANT C $ 57 $ 68 $ 102 1600 PLANT C 200 1400


TS

LHF 2300 1400


Demand 2300 1400 1200 Demand 2300 1400
DC 3 LHF Capacity
0 1400 1400
1200 1900 1900
0 1600 1600
1200
1200
Microsoft Excel 16.0 Answer Report
Worksheet: [Book2]Sheet1
Report Created: 24/12/2023 22:03:25
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0,031 Seconds.
Iterations: 7 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$2 MIN 0 414200

Variable Cells
Cell Name Original Value Final Value Integer
$J$5 PLANT A DC 1 0 1400 Contin
$K$5 PLANT A DC 2 0 0 Contin
$L$5 PLANT A DC 3 0 0 Contin
$J$6 PLANT B DC 1 0 700 Contin
$K$6 PLANT B DC 2 0 0 Contin
$L$6 PLANT B DC 3 0 1200 Contin
$J$7 PLANT C DC 1 0 200 Contin
$K$7 PLANT C DC 2 0 1400 Contin
$L$7 PLANT C DC 3 0 0 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$J$8 LHF DC 1 2300 $J$8=$J$9 Binding 0
$K$8 LHF DC 2 1400 $K$8=$K$9 Binding 0
$L$8 LHF DC 3 1200 $L$8=$L$9 Binding 0
$M$5 PLANT A LHF 1400 $M$5=$N$5 Binding 0
$M$6 PLANT B LHF 1900 $M$6=$N$6 Binding 0
$M$7 PLANT C LHF 1600 $M$7=$N$7 Binding 0
Microsoft Excel 16.0 Sensitivity Report
Worksheet: [Book2]Sheet1
Report Created: 24/12/2023 22:03:25

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$J$5 PLANT A DC 1 1400 0 80 9 1E+030
$K$5 PLANT A DC 2 0 9 100 1E+030 9
$L$5 PLANT A DC 3 0 143 215 1E+030 143
$J$6 PLANT B DC 1 700 0 108 114 53
$K$6 PLANT B DC 2 0 114 233 1E+030 114
$L$6 PLANT B DC 3 1200 0 100 53 1E+030
$J$7 PLANT C DC 1 200 0 57 53 9
$K$7 PLANT C DC 2 1400 0 68 9 1E+030
$L$7 PLANT C DC 3 0 53 102 1E+030 53

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$J$8 LHF DC 1 2300 108 2300 0 700
$K$8 LHF DC 2 1400 119 1400 0 700
$L$8 LHF DC 3 1200 100 1200 0 1200
$M$5 PLANT A LHF 1400 -28 1400 700 0
$M$6 PLANT B LHF 1900 0 1900 0 1E+030
$M$7 PLANT C LHF 1600 -51 1600 700 0
Microsoft Excel 16.0 Limits Report
Worksheet: [Book2]Sheet1
Report Created: 24/12/2023 22:03:25

Objective
Cell Name Value
$K$2 MIN 414200

Variable Lower Objective Upper Objective


Cell Name Value Limit Result Limit Result
$J$5 PLANT A DC 1 1400 1400 414200 1400 414200
$K$5 PLANT A DC 2 0 0 414200 0 414200
$L$5 PLANT A DC 3 0 0 414200 0 414200
$J$6 PLANT B DC 1 700 700 414200 700 414200
$K$6 PLANT B DC 2 0 0 414200 0 414200
$L$6 PLANT B DC 3 1200 1200 414200 1200 414200
$J$7 PLANT C DC 1 200 200 414200 200 414200
$K$7 PLANT C DC 2 1400 1400 414200 1400 414200
$L$7 PLANT C DC 3 0 0 414200 0 414200

You might also like