Scribd
Upload
11 views26 pages

20240315-C4

The document outlines production capacity, demand, and costs for four quarters, detailing production and inventory costs. It includes a transportation cost analysis for shipping units from various origins to destinations, with a total transportation cost calculated. Additionally, it presents maximum flow and route length data for logistics management.

Uploaded by

05 Đào Ngọc Lan Chi
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
11 views26 pages

20240315-C4

The document outlines production capacity, demand, and costs for four quarters, detailing production and inventory costs. It includes a transportation cost analysis for shipping units from various origins to destinations, with a total transportation cost calculated. Additionally, it presents maximum flow and route length data for logistics management.

Uploaded by

05 Đào Ngọc Lan Chi
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
You are on page 1/ 26

Quarter Production Capacity Demand Production cost Inventory cost

1 600 400 2 0.25


2 300 500 5 0.25
3 500 400 3 0.25
4 400 400 3 0.25

POINT
Cost per mit
1 2 3 4
1 1.00E+10 1.00E+10 1.00E+10 1.00E+10
2 1.00E+10 1.00E+10 1.00E+10 1.00E+10
3 1.00E+10 1.00E+10 1.00E+10 1.00E+10
4 1.00E+10 1.00E+10 1.00E+10 1.00E+10
POINT
5 1.00E+10 1.00E+10 1.00E+10 1.00E+10
6 1.00E+10 1.00E+10 1.00E+10 1.00E+10
7 1.00E+10 1.00E+10 1.00E+10 1.00E+10
8 1.00E+10 1.00E+10 1.00E+10 1.00E+10

POINT
Number per mit
1 2 3 4
1 0 0 0 0
2 0 0 0 0
3 0 0 0 0
4 0 0 0 0
POINT
5 0 0 0 0
6 0 0 0 0
7 0 0 0 0
8 0 0 0 0
Total IN 0 0 0 0

Max

POINT
Cost per mit
1 2 3 4
1 0 0 0 0
2 0 0 0 0.00E+00
3 0 0 0 0
4 0 0 0 0
POINT
5 0 0 0 0
6 0 0 0 0
7 0 0 0 0
8 0 0 0 0
TỒNG COST 5150
POINT
5 6 7 8
2 1.00E+10 1.00E+10 1.00E+10
1.00E+10 5 1.00E+10 1.00E+10
1.00E+10 1.00E+10 3 1.00E+10
1.00E+10 1.00E+10 1.00E+10 3
1.00E+10 0.25 1.00E+10 1.00E+10
1.00E+10 1.00E+10 0.25 1.00E+10
1.00E+10 1.00E+10 1.00E+10 0.25
1.00E+10 1.00E+10 1.00E+10 1.00E+10

POINT
5 6 7 8 total OUT Max
600 0 0 0 600 <= 600
0 300 0 0 300 <= 300
0 0 400 0 400 <= 500
0 0 0 400 400 <= 400
0 200 0 0 200
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
400 500 400 400 1700
= = = =
400 500 400 400

POINT
5 6 7 8
1200 0 0 0
0 1500 0 0
0 0 1200 0
0 0 0 1200
0 50 0 0
0 0 0 0
0 0 0 0
0 0 0 0
POINT
MAXIMUM FLOW
1 2 3 4 5 6
1 0 5 6 5 0 0
2 0 0 2 0 3 0
3 0 2 0 3 3 7
POINT 4 0 0 0 0 0 5
5 0 0 0 0 0 1
6 0 0 0 0 1 0
7 1000 0 0 0 0 0

POINT
FLOW
1 2 3 4 5 6
1 0 5 6 3 0 0
2 0 0 2 0 3 0
3 0 0 0 0 3 5
POINT 4 0 0 0 0 0 3
5 0 0 0 0 0 0
6 0 0 0 0 1 0
7 14 0 0 0 0 0
TOTAL (IN) 14 5 8 3 7 8
7
0
0
0
0
8
7
0

7 TOTAL (OUT)
0 14
0 5
0 8
0 3
7 7
7 8
0 14
14
Point
Length
1 2 3 4 5
1 1E+03 25 20 1E+03 1E+03
2 1E+03 1E+03 3 5 1E+03
3 1E+03 3 1E+03 1E+03 6
POINT
4 1E+03 5 1E+03 1E+03 4
5 1E+03 1E+03 6 4 1E+03
6 1E+03 1E+03 1E+03 1E+03 1E+03

Point
ROUTE
1 2 3 4 5
1 0 0 1 0 0
2 0 0 0 1 0
POINT 3 0 1 0 0 0
4 0 0 0 0 0
5 0 0 0 0 0
6 0 0 0 0 0
TOTAL (in) 0 1 1 1 0

End point

Point
ROUTE LENGTH
1 2 3 4 5
1 0 0 20 0 0
2 0 0 0 5 0
3 0 3 0 0 0
POINT
4 0 0 0 0 0
5 0 0 0 0 0
6 0 0 0 0 0
TOTAL (in) 32
t
6
1E+03
14
1E+03
4
7
1E+03

t
6 TOTAL (out) Begin point
0 1 = 1
0 1
0 1
1 1
0 0
0 0
1
=
1
do nó là điểm nhận cuối nên nó k
nhận chỉ đi thôi nên =1
t
6
0
0
0
4
0
0
do nó là nguồn nên nó k nhận chỉ
đi thôi nên =1
Transportation cost per units Destination points
1 2 3
1 10 15 9
ORIGIN 2 9 18 5
3 6 14 3

Destination points
Number of units shipped
1 2 3 Total (sent)
1 0 1 0 1 <=
ORIGIN 2 0 0 1 1 <=
3 1 0 0 1 <=
Total (sent) 1 1 1
= = =
Required demand 1 1 1

Destination points
Transportation cost
1 2 3
1 0 15 0
ORIGIN 2 0 0 5
3 6 0 0

TOTAL COST 26
Maximum capacity
1
1
1
1 2 3 4 5 6 7 8
1 1E+10 1E+10 2 3 1E+10 1E+10 1E+10 1E+10
2 1E+10 1E+10 3 1 1E+10 1E+10 1E+10 4
3 1E+10 1E+10 1E+10 1E+10 2 6 3 6
4 1E+10 1E+10 1E+10 1E+10 4 4 6 5
5 1E+10 1E+10 1E+10 1E+10 1E+10 1E+10 1E+10 1E+10
6 1E+10 1E+10 1E+10 1E+10 1E+10 1E+10 1E+10 1E+10
7 1E+10 1E+10 1E+10 1E+10 1E+10 1E+10 1E+10 1
8 1E+10 1E+10 1E+10 1E+10 1E+10 1E+10 1E+10 1E+10

1 2 3 4 5 6 7 8
1 0 0 600 0 0 0 0 0
2 0 0 0 100 0 0 0 300
3 0 0 0 0 200 50 350 0
4 0 0 0 0 0 100 0 0
5 0 0 0 0 0 0 0 0
6 0 0 0 0 0 0 0 0
7 0 0 0 0 0 0 0 0
8 0 0 0 0 0 0 0 0
Total(received) 0 0 600 100 200 150 350 300
= = = =
200 150 350 300

1 2 3 4 5 6 7 8
1 0 0 1200 0 0 0 0 0
2 0 0 0 100 0 0 0 1200
3 0 0 0 0 400 300 1050 0
4 0 0 0 0 0 400 0 0
5 0 0 0 0 0 0 0 0
6 0 0 0 0 0 0 0 0
7 0 0 0 0 0 0 0 0
8 0 0 0 0 0 0 0 0
total cost 4650
Total (sent) Maximum capacity
600 <= 600
400 <= 400
600 = 600
100 = 100
0
0
0
0
Transportation Warahouse
cost per units 3 4
1 2 3
Origin 2 3 1

Number of units Warehouse


shipped 3 4 Total
Origin 1 550 50 600
2 0 400 400

Total (received) 550 450

Transportation Warehouse
cost 3 4
Origin 1 1100 150
2 0 400

Total cost 5200


Transportation
cost per units
3
Origin 4

Number of units
Maximum shipped
<= 600 Origin 3
<= 400 4

Total (received)

Required demand

Transportation
cost
3
Warehouse 4
Warahouse
5 6 7 8
2 6 3 6
4 4 6 5

Warehouse
5 6 7 8 total
200 0 350 0 550
0 150 0 300 450

200 150 350 300


= = = =
200 150 350 300

Destination points
5 6 7 8
400 0 1050 0
0 600 0 1500
Transportation cost per units Destination points

1 2 3 4
1 3 2 7 6
ORIGIN 2 7 5 2 3
3 2 5 4 5

Destination points
Number of units shipped
1 2 3 4
1 3500 1500 0 0
ORIGIN 2 0 2500 2000 1500
3 2500 0 0 0
Total (sent) 6000 4000 2000 1500
= = = =
Required demand 6000 4000 2000 1500

Destination points
Transportation cost
1 2 3 4
1 10500 3000 0 0
ORIGIN 2 0 12500 4000 4500
3 5000 0 0 0

TOTAL COST 39500


1
Nếu như đường 1 nối 1 bị kẹt thì tăng lên từ 3 lên suy ra -> 1 100000
số cực lớn rồi chạy lại ví dụ tăng lên 10000 để khi
chạy nó tránh đường đó ra 2 7
3 2
Hoặc bật solver lên gán var 1=0
CÁCH 2
Total (sent) Maximum capacity
5000 <= 5000
6000 <= 6000
2500 <= 2500

Nếu như chạy lại thì ta sẵn sàng


2 3 4
2 7 6
5 2 3
5 4 5

Gán var 1=0

Nếu như chạy lại thì ta sẵn sàng trả 10k500 mà hén k chịu thì mình trả thêm 49k-39,5k
Microsoft Excel 16.0 Answer Report
Worksheet: [20240315-C4.xlsx]Sheet1
Report Created: 3/15/2024 6:25:23 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.031 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
$C$22 TOTAL COST Destination points 39500 39500

Variable Cells
Cell Name Original Value Final Value Integer
$C$9 ORIGIN Destination points 3500 3500 Contin
$D$9 ORIGIN 1500 1500 Contin
$E$9 ORIGIN 0 0 Contin
$F$9 ORIGIN 0 0 Contin
$C$10 Destination points 0 0 Contin
$D$10 2500 2500 Contin
$E$10 2000 2000 Contin
$F$10 1500 1500 Contin
$C$11 Destination points 2500 2500 Contin
$D$11 0 0 Contin
$E$11 0 0 Contin
$F$11 0 0 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$C$12 Total (sent) Destination points 6000 $C$12=$C$14 Binding 0
$D$12 Total (sent) 4000 $D$12=$D$14 Binding 0
$E$12 Total (sent) 2000 $E$12=$E$14 Binding 0
$F$12 Total (sent) 1500 $F$12=$F$14 Binding 0
$G$9 ORIGIN Total (sent) 5000 $G$9<=$I$9 Binding 0
$G$10 Total (sent) 6000 $G$10<=$I$10 Binding 0
$G$11 Total (sent) 2500 $G$11<=$I$11 Binding 0
$C$9 ORIGIN Destination points 3500 $C$9>=0 Not Binding 3500
$D$9 ORIGIN 1500 $D$9>=0 Not Binding 1500
$E$9 ORIGIN 0 $E$9>=0 Binding 0
$F$9 ORIGIN 0 $F$9>=0 Binding 0
$C$10 Destination points 0 $C$10>=0 Binding 0
$D$10 2500 $D$10>=0 Not Binding 2500
$E$10 2000 $E$10>=0 Not Binding 2000
$F$10 1500 $F$10>=0 Not Binding 1500
$C$11 Destination points 2500 $C$11>=0 Not Binding 2500
$D$11 0 $D$11>=0 Binding 0
$E$11 0 $E$11>=0 Binding 0
$F$11 0 $F$11>=0 Binding 0
Microsoft Excel 16.0 Sensitivity Report
Worksheet: [20240315-C4.xlsx]Sheet1
Report Created: 3/15/2024 6:25:23 PM

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$C$9 ORIGIN Destination points 3500 0 3 1 4
$D$9 ORIGIN 1500 0 2 3 1
$E$9 ORIGIN 0 8 7 1E+030 8
$F$9 ORIGIN 0 6 6 1E+030 6
$C$10 Destination points 0 1 7 1E+030 1
$D$10 2500 0 5 1 3
$E$10 2000 0 2 6 1E+030
$F$10 1500 0 3 6 1E+030
$C$11 Destination points 2500 0 2 4 1E+030
$D$11 0 4 5 1E+030 4
$E$11 0 6 4 1E+030 6
$F$11 0 6 5 1E+030 6

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$C$12 Total (sent) Destination points 6000 6 6000 0 2500
$D$12 Total (sent) 4000 5 4000 0 2500
$E$12 Total (sent) 2000 2 2000 0 2000
$F$12 Total (sent) 1500 3 1500 0 1500
$G$9 ORIGIN Total (sent) 5000 -3 5000 2500 0
$G$10 Total (sent) 6000 0 6000 1E+030 0
$G$11 Total (sent) 2500 -4 2500 2500 0
Microsoft Excel 16.0 Limits Report
Worksheet: [20240315-C4.xlsx]Sheet1
Report Created: 3/15/2024 6:25:23 PM

Objective
Cell Name Value
$C$22 TOTAL COST Destination points 39500

Variable Lower Objective Upper Objective


Cell Name Value Limit Result Limit Result
$C$9 ORIGIN Destination points 3500 3500 39500 3500 39500
$D$9 ORIGIN 1500 1500 39500 1500 39500
$E$9 ORIGIN 0 0 39500 0 39500
$F$9 ORIGIN 0 0 39500 0 39500
$C$10 Destination points 0 0 39500 0 39500
$D$10 2500 2500 39500 2500 39500
$E$10 2000 2000 39500 2000 39500
$F$10 1500 1500 39500 1500 39500
$C$11 Destination points 2500 2500 39500 2500 39500
$D$11 0 0 39500 0 39500
$E$11 0 0 39500 0 39500
$F$11 0 0 39500 0 39500

You might also like