Scribd
Upload
82 views22 pages

Uas Applied Statistic

1. The document provides information on a tire vulcanization company including fixed costs, variable costs per unit, selling price per unit, and calculations to determine total profit for different production volumes. 2. It also presents a 6x6 assignment problem and solves it using the Hungarian method to find the minimum total cost of 85. 3. A linear programming problem is formulated with an objective function and constraints to maximize profits, and it is solved using the simplex method through multiple iterations.

Uploaded by

Nicholas V.T
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
82 views22 pages

Uas Applied Statistic

1. The document provides information on a tire vulcanization company including fixed costs, variable costs per unit, selling price per unit, and calculations to determine total profit for different production volumes. 2. It also presents a 6x6 assignment problem and solves it using the Hungarian method to find the minimum total cost of 85. 3. A linear programming problem is formulated with an objective function and constraints to maximize profits, and it is solved using the simplex method through multiple iterations.

Uploaded by

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

UAS APPLIED STATISTIC

Nama : Gary Bennet Samuel


NPM : 825200027
KELAS : A

1. Perusahaan vulkanasi ban mobil

• Biaya tetap tahunan : 60.000 (Cf)


• Biaya variable : 9/unit (VC)
• Harga per unit : 9/unit

a).
V = 12000 Ban Harga Ban = 25
B Total = Cf + Cv.V = 60000 + 9 * 12000 = 168000
Pendapatan Total = Harga dari ban * V = 25 .*12000 = 300000
300000 - 168000 = 132000 (LABA)
b) Volume
V = Cf/P-Cv
V= 60.000/25-9
= 60.000/16
= 3750

2. Menggunakan Metode hungarian minimal

A B C D E F
1 30 24 16 26 30 22
2 22 28 14 30 20 13
3 18 16 25 14 12 22
4 14 22 18 23 21 30
5 25 18 14 16 16 28
6 32 14 10 14 18 20
Dikurangin angka terkecil setiap barisnya
A B C D E F
1 14 8 0 10 14 6
2 9 15 1 17 7 0
3 6 4 13 2 0 10
4 0 8 4 9 7 16
5 11 4 0 2 2 14
6 22 4 0 4 8 10

Yang merah itu dicoret artinya


A B C D E F
1 14 8 0 10 14 6
2 9 15 1 17 7 0
3 6 4 13 2 0 10
4 0 8 4 9 7 16
5 11 4 0 2 2 14
6 22 4 0 4 8 10
A B C D E F
1 14 8-4=4 0 10-2=8 14 6
2 9 15-4=11 1 17-2=15 7 0
3 6 4-4=0 13 2-2=0 0 10
4 0 8-4=4 4 9-2=7 7 16
5 11 4-4=0 0 2-2=0 2 14
6 22 4-4=0 0 4-2=2 8 10

A B C D E F
1 14 4 0(1) 8 14 6
2 9 11 1 15 7 0(2)
3 6 0 13 0 0(3) 10
4 0(4) 4 4 7 7 16
5 11 0 0 0(5) 2 14
6 22 0(6) 0 2 8 10
1 A 16
2 B 13
3 C 12
4 D 14
5 E 16
6 F 14
Total 85

3. Metode simplex (MINIMUM)

Fungsi tujuan
• Z = 6X1 + 3X2

kendala
• 2X1 + 4X2 >= 16
• 4X1 + 3X2 >= 24

KANONIK
• 2X1 + 4X2 -S1 +0S2 +X1 + 0X2
• 4X1 + 3X2 - 0S1 + S2 +0X1 +X2
• Z = 6X1 + 3X2 +0S1 -S2 + 0MX1 +MX2

Cj 6 3 0 0 M M
Ci X1 X2 S1 S2 V1 V2 Bi Ri
M X1 2 4 -1 0 1 0 16
M X2 4 3 0 -1 0 1 24
Zj 6M 7M -M -M M M 40M
Zj-Cj 6M-6 7M-3 -M -M 0 0

Cj 6 3 0 0 M M
Ci X1 X2 S1 S2 V1 V2 Bi Ri
M X1
M X2
Zj
Zj-Cj
NOMOR 4

A B C Supply
1 6 8 10 150
2 7 11 11 175
3 4 5 12 275
Demand 200 100 300 600

a) Barat laut metode

Tabel 1
Mengambil Minimum
Membandingkan (150,200) = 150
Supply = 150-150 = 0
Demand = 200 -150 = 50
A B C Supply
1 6(150) 8 10 0
2 7 11 11 175
3 4 5 12 275
Demand 50 100 300

Tabel 2
Supply = 175-50 =125
Demand = 50-50 = 0
A B C Supply
1 6(150) 8 10 0
2 7(50) 11 11 125
3 4 5 12 275
Demand 0 100 300
Tabel 3
Supply = 125 – 100 = 25
Demand = 100-100 = 0
A B C Supply
1 6(150) 8 10 0
2 7(50) 11(100) 11 25
3 4 5 12 275
Demand 0 0 300

Tabel 4
Supply = 25-25 = 0
Demand = 300-25 = 275
A B C Supply
1 6(150) 8 10 0
2 7(50) 11(100) 11(25) 0
3 4 5 12 275
Demand 0 0 275

Tabel 5
Supply = 275-275 = 0
Demand = 275-275 = 0

A B C Supply
1 6(150) 8 10 0
2 7(50) 11(100) 11(25) 0
3 4 5 12(275) 0
Demand 0 0 0
Tabel Akhir
A B C Supply
1 6(150) 8 10 150
2 7(50) 11(100) 11(25) 175
3 4 5 12(275) 275
Demand 200 100 300

B) METODE Modi
A B C Supply
1 6(150) 8 10 150
2 7(50) 11(100) 11(25) 175
3 4 5 12(275) 275
Demand 200 100 300

Iterasi 1
1) Menemukan Ui dan vj untuk setiap cell terisi
U2 = 0
V1 = C21 – U2 = 7 – 0 -> 7
U1 = C11- V1 = 6-7 -> -1
V2 = C22 – U2 0 -> 11
V3= C23 – U2 -> 11
U3= C33 –V3 -> 1
A B C Supply Ui
1 6(150) 8 10 150 U1 = -1
2 7(50) 11(100) 11(25) 175 U2 = 0
3 4 5 12(275) 275 U3 = 1
Demand 200 100 300
Vj V1 = 7 V2 =11 V3 = 11

2) Menemukan dij untuk cell yang belum terisi


1) d12 = C12 –(U1 + V2) = 8-(-1 + 11) = -2
2) d13 = C13-(U1+V3) =10-(-1+ 11) = 0
3) d31 = C31-(U3+V1) =4-(1+7) = -4
4) d32 = C32-(U3+v2)= 5-(1+11) =-7
A B C Supply Ui
1 6(150) 8 10 150 U1 = -1
2 7(50) 11(100)(-) 11(25)(+) 175 U2 = 0
3 4 5(+) 12(275)(-) 275 U3 = 1
Demand 200 100 300
Vj V1 = 7 V2 =11 V3 = 11

Mendapat nilai negatif yang terkecil = -7 dan membuat jalur tertutup


A B C Supply
1 6(150) 8 10 150
2 7(50) 11 11(125) 175

3 4 5(100) 12(175) 275


Demand 200 100 300

Iterasi ke 2 untuk optimal


U2 = 0
V1 = C21 –U2 = 7- 0 -> 7
U1 =C11 –V1 = 6-7 -> -1
V3 =C23 –U2 = 11- 0 -> 11
U3 =C33 – V3 = 12-11 -> 1
V2 =C32 – U3 =5 -1 -> 4
A B C Supply Ui
1 6(150) 8 10 150 U1 = -1
2 7(50) 11 11(125) 175 U2 = 0
3 4 5(100) 12(175) 275 U3 = 1
Demand 200 100 300
Vj V1 = 7 V2 = 4 V3 =11

d12 = C12 –(U1 + V2) = 8-(-1+4) = 5


d13 = C13-(U1+v3) = 10-(-1 +11) = 0
d22 =C22 –(U2+V2) = 11-(0+4) = 7
d31 = C31-(U3+V1) = 4-(1+7) = -4
A B C Supply Ui
1 6(150) 8[5] 10[0] 150 U1 = -1
2 7(50) 11[7] 11(125) 175 U2 = 0

3 4[-4] 5(100) 12(175) 275 U3 = 1


Demand 200 100 300
Vj V1 = 7 V2 = 4 V3 =11

Mencari nilai negatif terendah yaitu -4 dan membuat jalur tertutup

A B C Supply Ui
1 6(150) 8[5] 10[0] 150 U1 = -1
2 7(50)(-) 11[7] 11(125)(+) 175 U2 = 0
3 4[-4](+) 5(100) 12(175)(-) 275 U3 = 1
Demand 200 100 300
Vj V1 = 7 V2 = 4 V3 =11

Nilai(-) 50 merupakan nilai terendah dan alokasikan (+) buat ditambahkan dan (-) buat dikurangkan
A B C Supply
1 6(150) 8 10 150
2 7 11 11(175) 175

3 4(50) 5(100) 12(125) 275


Demand 200 100 300

Iterasi ke 3
U3 = 0
C31 = 4- 0 = 4 (V1)
C11 = 6-4 =2 (U1)
C32 = 5- 0 = 5(V2)
C33 =12 – 0 = 12(V3)
C23 = 11-12 = -1(U2)
A B C Supply U1
1 6(150) 8 10 150 U1 = 2
2 7 11 11(175) 175 U2 = -1
3 4(50) 5(100) 12(125) 275 U3 = 0
Demand 200 100 300
Vj V1 = 4 V2 = 5 V3 = 12

D12 =8-(2+5) = 1
D13= 10-(2+12) = -4
D21 = 7-(-1+4) = 4
D22 = 11(-1+5) = 7
Menetukan nilai terendah yaitu -4 dan membuat jalur tertutup
A B C Supply U1
1 6(150)(-) 8[1] 10[-4](+) 150 U1 = 2
2 7[4] 11[7] 11(175) 175 U2 = -1

3 4(50)(+) 5(100) 12(125)(-) 275 U3 = 0


Demand 200 100 300
Vj V1 = 4 V2 = 5 V3 = 12

(-) terendah yaitu = 125.Tambahkan yang (+) dan kurangkan yang(-)


A B C Supply
1 6(25) 8 10(125) 150
2 7 11 11(175) 175

3 4(175) 5(100) 12 275


Demand 200 100 300

Iterasi ke 4
U1 = 0
V1 = 6- 0 = 6
U3 =4-6 = -2
V2 = 5+ 2 = 7
V3 = 10 – 0 = 10
U2 =11-10 = 1
A B C Supply Ui
1 6(25) 8 10(125) 150 U1 = 0
2 7 11 11(175) 175 U2 =1
3 4(175) 5(100) 12 275 U3=-2
Demand 200 100 300
Vj V1 = 6 V2 = 7 V3 = 10

D12 = 8-(0+7) = 1
D21 = 7-(1+6) = 0
D22 = 11-(1+7) = 3
D33 = 12-(-2+10) = 4
A B C Supply
1 6(25) 8 10(125) 150
2 7 11 11(175) 175
3 4(175) 5(100) 12 275
Demand 200 100 300

Harga = 6X 25 + 10x125 + 11(175) + 4x(175) + 5(100)


=4525

You might also like