Scribd
Upload
43 views6 pages

Pom For Windows 3

The document describes a linear programming problem involving a bakery that produces three types of bread - pia, bolukismis, and coklatkeju. The bakery aims to maximize total profit by determining optimal production levels of each bread type, subject to minimum production requirements and constraints on available processing time for preparation, mixing, and baking. The problem is formulated as a linear program to calculate the optimal solution that maximizes total profit.

Uploaded by

Purwa Ningsih
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
43 views6 pages

Pom For Windows 3

The document describes a linear programming problem involving a bakery that produces three types of bread - pia, bolukismis, and coklatkeju. The bakery aims to maximize total profit by determining optimal production levels of each bread type, subject to minimum production requirements and constraints on available processing time for preparation, mixing, and baking. The problem is formulated as a linear program to calculate the optimal solution that maximizes total profit.

Uploaded by

Purwa Ningsih
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

PROGRAM LINIER

Nama : SIYUSUF WARUWU


NPM : 16110459
SOAL LATIHAN
1. Maksimumkan Z = 3X1 + 5X2
Kendala :
1) 2X1 < 8
2) 3X2 < 15
3) 6X1 + 5X2 < 30
X1 > 0, X2 > 0
Jawab :

1) 2X1 = 8
X2 = 0 2X1 =8
X1 = 8/2
X1 =4
2) 3X2 = 15
X1 = 0 3X2 = 15
X2 = 15/3
X2 =5
3) 6X1 + 5X2 =30
X1 = 0 6.0 + 5X2 = 30
0 + 5X2 = 30
X2 = 30/5
X2 = 6
X2 = 0 6X1 + 5.0 = 30
6X1 + 0 = 30
X1 = 30/6
X1 =5
 Titik A (kendala 1)
Zmax = 3X1 + 5X2
= 3.4 + 5.0
= 12

 Titik B (kendala 1 & 3)


2X1 =8 |x5
6X1 + 5X2 = 30_| x 0_-
10X1 = 40
X1 = 40/10
X1 =4

6X1 + 5X2 = 30
6.4 + 5X2 = 30
24 + 5X2 = 30
5X2 = 30 – 24
X2 = 6/5
X2 = 1,2

Zmax = 3X1 + 5X2


= 3.4 + 5(1,2)
= 12 + 6
= 18

 Titik C (kendala 2 & 3)


3X2 = 15 | x 6
6X1 + 5X2 = 30_| x 0_-
18X2 = 90
X2 = 90/18
X2 =5

6X1 + 5X2 = 30
6X1 + 5.5 = 30
6X1 + 25 = 30
6X1 = 30 – 25
X1 = 5/6
X1 = 0,83

Zmax = 3X1 + 5X2


= 3(0,83) + 5(5)
= 2,5 + 25
= 27,5

 Titik D (kendala 2)
Zmax = 3X1 + 5X2
= 3.0 + 5.5
= 25
2. Minimumkan Z = 5X1 + 2X2
Kendala :
1. 6X1 + X2 > 6
2. 4X1 + 3X2 > 2
3. X1 + 2X2 > 4
X1 > 0
Jawab :

1) 6X1 + X2 = 6
X1 = 0 6.0 + X2 = 6
X2 = 6
X2 = 0 6X1 + 0 = 6
X1 = 6/6
X1 =1

2) 4X1 + 3X2 = 2
X1 = 0 4.0 + 3X2 = 2
X2 = 2/3
X2 = 0,66
X2 = 0 4X1 + 3.0 = 2
X1 = 2/4
X1 = 0,5

3) X1 + 2X2 = 4
X1 = 0 0 + 2X2 = 4
X2 = 4/2
X2 = 2
X2 = 0 X1 + 2.0 = 4
X1 =4
 Titik A (kendala 3)
Zmin = 5X1 + 2X2
= 5.4 + 2.0
= 20

 Titik B (kendala 1 & 3)


6X1 + X2 =6 |x1
X1 + 2X2 = 4_| x 6
6X1 + X2 =6
6X1 + 12X2 = 24 -
-11X2 = -18
X2 = -18/-11
X2 = 1,636

X1 + 2X2 =4
X1 + 2(1,636) =4
X1 = 4 – 3,272
X1 = 0,728

Zmax = 5X1 + 2X2


= 5(0,728) + 2(1,636)
= 3,64 + 3,272
= 6,912

 Titik C (kendala 1)
Zmax = 5X1 + 2X2
= 5.0 + 2.6
= 12
1. PT. BAKERY memproduksi tiga jenis roti kering, yaitu pia, bolukismis dan
coklatkeju dengan keuntungan tiap jenis produk masing-masing Rp. 150, Rp. 400 dan
Rp. 600. Setiap minggu ditetapkan minimum produksi roti pia 25 unit, bolukismis 130
unit, dan coklatkeju 55 unit. Ketiga jenis roti memerlukan pemrosesan tiga kali yaitu
penyiapan bahan, peracikan dan pengovenan seperti terlihat pada table berikut :
Pemrosesan Jenis Roti Penyediaan max
Pia Bolukismis Coklatkeju (jam)
Penyiapan bahan 4 2 6 130
Peracikan 3 4 9 170
Pengovenan 1 2 4 52
Bagaimana formulasi program linear masalah PT BAKERY tersebut dan hitung solusi
optimalnya!
Jawab :

You might also like