(Pemrograman Linier)
Program Studi Statistika
Semester Ganjil 2012/2013
max z 3x1 2 x2
s.t. 1
40 x1 601 x2 1 (AB)
1
50 x1 501 x2 1 (CD)
x1 0, x2 0
Isoprofit line:
z 3x1 2 x2 60
Z=60
( 20,0); (0,30)
LP dengan Multiple optimal Solution
max z 2 x1 x2
s.t. x1 x2 1 (AB)
2 x1 x2 6 (CD)
x1 0, x2 0
Isoprofit line:
z 2 x1 x2 4
(2,0); (0,4)
Brownies/potong 400 3 2 2 50
Chocolate Ice
cream/sendok 200 2 2 4 20
Soda/botol 150 0 4 1 30
Cheesecake/potong 500 0 4 5 80
Minimum Kebutuhan
harian 500 6 10 8
min z 50 x1 20 x2 30 x3 80 x4
Apa fungsi kendala? Kebutuhan minimum harian setiap nutrisi
(kalori, coklat, gula dan lemak)
2 x1 2 x2 4 x3 4 x4 10
Lemak(ons) 2 4 1 5 8
2 x1 4 x2 x3 5x4 8
Batasan tanda bagi peubah keputusan? Jumlah makanan yang
dikonsumsi: harus non negatif
x1, x2 , x3 , x4 0
LP untuk Diet Problem
min z 50 x1 20 x2 30 x3 80 x4
s.t. 400 x1 200 x2 150 x3 500 x4 500
3x1 2 x2 6
2 x1 2 x2 4 x3 4 x4 10
2 x1 4 x2 x3 5x4 8
x1, x2 , x3 , x4 0
Sabtu: x2 x3 x4 x5 x6 16
Minggu: x3 x4 x5 x6 x7 11
min z x1 x2 x3 x4 x5 x6 x7
xi 0, i 1,...,7
LP Masalah Penjadwalan
min z x1 x2 x3 x4 x5 x6 x7
s.t: x1 x4 x5 x6 x7 17
x1 x2 x5 x6 x7 13
x1 x2 x3 x6 x7 15
x1 x2 x3 x4 x7 19
x1 x2 x3 x4 x5 14
x2 x3 x4 x5 x6 16
x3 x4 x5 x6 x7 11
xi 0, i 1,...,7