From To Able Capacity

R1 A 75 75
R1 B 65 65
R2 A 20 40
R2 B 25 50
R2 C 60 60
R3 B 80 80
R3 C 70 70
A D 50 60
A E 45 45
B D 70 70
B E 55 55
B F 45 45
C E 70 70
C F 60 90
D T 120 120
E T 170 190
F T 105 130

Total 112425
 Nodes Netflow In/Out
R1 140 =
R2 105 =
R3 150 =
A 0 = 0
B 0 = 0
C 0 = 0
D 0 = 0
E 0 = 0
F 0 = 0
T -395 =

Max flow 395

Microsoft Excel 16.0 Sensitivity Report
Worksheet: [Ôn tập MHKD.xlsx]BÀI 2
Report Created: 9/20/2023 3:00:08 PM

Variable Cells
Final Reduced Objective Allowable Allowable Minimum
Cell Name Value Cost Coefficient Increase Decrease Allowable
$F$8 Product Quantity GC 3.333333333 0 300 100 100
$G$8 Product Quantity WC 3.333333333 0 200 100 50

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$H$4 David 33.33333333 0 40 1E+030 6.666666667
$H$5 LaDeana 40 25 40 13.33333333 13.33333333
$H$6 Lydia 20 33.33333333 20 10 5

Shadow price là giá trị giờ mỗi công nhân làm việc
Best profit gain of Crave wood
Best profit gain of shipping
Maximum
Allowable
 x - the number of Grandfather Clock per week
Variables
y - the number of Wall produce per week Unit Price
Objective Maxprofit = 300*x + 200*y
6*x + 4*y <= 40 David
Constraints 8*x + 4*y <= 40 x, y ≥ 0 LaDeana
3*x + 3*y <= 20 Lydia

Product Quantity

Total profit

Result: The maximum profit is 166

 GC WC
300 200
Time available
6 4 33.33333 <= 40
8 4 40 <= 40
3 3 20 <= 20

3.333333 3.333333

1666.667

ult: The maximum profit is 1666,667 produce 4 grandfather clock, 4 wall clock
 FROM TO ABLE
R1 A 75
R1 B 65
R2 A 20
R2 B 25
R2 C 60
R3 B 80
R3 C 70
A D 50
A E 45
B D 70
B E 55
B F 45
C E 70
C F 60
D T 120
E T 170
F T 105
 CAPACITY NODES NETFLOW SUPPLY/DEMAND
<= 75 R1 140
<= 65 R2 105
<= 40 R3 150
<= 50 A 0 = 0
<= 60 B 0 = 0
<= 80 C 0 = 0
<= 70 D 0 = 0
<= 60 E 0 = 0
<= 45 F 0 = 0
<= 70 T -395 =
<= 55
<= 45 Total 112425
<= 70
<= 90 Maxflow 395
<= 120
<= 190
<= 130
Microsoft Excel 16.0 Sensitivity Report
Worksheet: [Ôn tập Độ nhạy và mạng lưới.xlsx]Ôn tập b2
Report Created: 11/30/2023 10:50:22 PM

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$H$8 Quantity GC 3.333333333 0 300 100 100
$I$8 Quantity WC 3.333333333 0 200 100 50

Constraints
Final Shadow Constraint Allowable Allowable Minimum
Cell Name Value Price R.H. Side Increase Decrease Available
$J$4 David Used 33.33333333 0 40 1E+030 6.666666667 33.33333
$J$5 LaDe Used 40 25 40 13.33333333 13.33333333 26.66667
$J$6 Lydia Used 20 33.33333333 20 10 5 15

Shadow price is the value per hour a worker work

Best profit gain of Crave wood 333.3333333
Best profit gain of Shipping 333.3333333
Maximum Ranging
Available
1E+030 33.33333<=x<=1E+30
53.33333 26.66667<=y<=53.33333
30 15<=z<=30
1. Variables x - the number of grandfather clock GC WC
y - the number of wall clock Unit price 300 200
2. Constrains x,y > 0 Used
6*x + 4*y <= 40 David 6 4 33.33333
8*x + 4*y <= 40 LaDe 8 4 40
3*x + 3*y <= 20 Lydia 3 3 20
3. Objective Maximum profit = 300*x + 200*y
Quantity 3.333333 3.33E+00

Profit 1666.667

4. Result The maximum profit is 1666.667

5. Conclusion If the company want to reach the maximum profit, they will produce 4 grandfather clocks and wall clocks
 GC WC
375 220
Avaible % 0.75 0.2
<= 40 Sum 0.95
<= 40
<= 20

ocks and wall clocks