Linear Programming Metode Simplex
Linear Programming Metode Simplex
Operations Management
OPERATIONS
RESEARCH
William J. Stevenson
8th edition
6s-2 LP Metode Simpleks
Merek I1 I2 Kapasitas
Mesin (X1) (X2) Maksimum
1 2 0 8
2 0 3 15
3 6 5 30
Sumbangan laba 3 5
Fungsi tujuan
Z = 3X1 + 5X2 diubah menjadi Z = 3X1 + 5X2 + 0S1 + 0S2 + 0S3.
Kemudian Fungsi tujuan di nolkan sehingga
Z - 3X1 - 5X2 - 0S1 - 0S2 - 0S3 = 0
6s-8 LP Metode Simpleks
Langkah 2:
Menyusun persamaan-persamaan di dalam tabel
Beberapa Istilah dlm Metode Simplek
NK adalah nilai kanan persamaan, yaitu nilai di belakang tanda sama
Variabel
Dasar Z X1 X2 S1 S2 S3 NK
Z
S1
S2
S3
6s-10 LP Metode Simpleks
Variabel X1 X2
Z S1 S2 S3 NK
Dasar
Z 1
S1 0
S2 0
S3 0
6s-11 LP Metode Simpleks
Variabel X1 X2
Z S1 S2 S3 NK
Dasar
Z 1 -3 -5 0 0 0 0
S1 0
S2 0
S3 0
6s-12 LP Metode Simpleks
Variabel X1 X2
Z S1 S2 S3 NK
Dasar
Z 1 -3 -5 0 0 0 0
S1 0 2 0 1 0 0 8
S2 0
S3 0
6s-13 LP Metode Simpleks
Variabel X1 X2
Z S1 S2 S3 NK
Dasar
Z 1 -3 -5 0 0 0 0
S1 0 2 0 1 0 0 8
S2 0 0 3 0 1 0 15
S3 0
6s-14 LP Metode Simpleks
Variabel X1 X2
Z S1 S2 S3 NK
Dasar
Z 1 -3 -5 0 0 0 0
S1 0 2 0 1 0 0 8
S2 0 0 3 0 1 0 15
S3 0 6 5 0 0 1 30
6s-15 LP Metode Simpleks
Variabel X1 X2
Z S1 S2 S3 NK
Dasar
Z 1 -3 -5 0 0 0 0
S1 0 2 0 1 0 0 8
S2 0 0 3 0 1 0 15
S3 0 6 5 0 0 1 30
6s-16 LP Metode Simpleks
Variabel X1 X2 Keterangan
Z S1 S2 S3 NK (Indeks)
Dasar
Z 1 -3 -5 0 0 0 0
S1 0 2 0 1 0 0 8
S2 0 0 3 0 1 0 15
S3 0 6 5 0 0 1 30
Catatan: Jika pada fungsi tujuan (baris Z) tidak ada memiliki nilai
negatif, maka tabel itu tidak bisa dioptimalkan lagi (sudah optimal).
6s-18 LP Metode Simpleks
Variabel X1 X2 Keterangan
Z S1 S2 S3 NK (Indeks)
Dasar
Z 1 -3 -5 0 0 0 0
S1 0 2 0 1 0 0 8 8/0 = ∞
S2 0 0 3 0 1 0 15 15/3 = 5
S3 0 6 5 0 0 1 30 30/5 = 6
ANGKA KUNCI = 3
6s-20 LP Metode Simpleks
Variabel X1 X2 Keterangan
Z S1 S2 S3 NK
Dasar (Indeks)
Z 1 -3 -5 0 0 0 0
S1 0 2 0 1 0 0 8 8/0 = ∞
S2 0 0 3 0 1 0 15 15/3 = 5
S3 0 6 5 0 0 1 30 30/5 = 6
Z 1
S1 0
X2
S2 0
S3 0
6s-22 LP Metode Simpleks
Variabel X1 X2 Keterangan
Z S1 S2 S3 NK
Dasar (Indeks)
Z 1 -3 -5 0 0 0 0
S1 0 2 0 1 0 0 8 8/0 = ∞
S2 0 0 3 0 1 0 15 15/3 = 5
S3 0 6 5 0 0 1 30 30/5 = 6
Z 1
S1 0
X2 0 0
S3 0
0/3
6s-23 LP Metode Simpleks
Variabel X1 X2 Keterangan
Z S1 S2 S3 NK
Dasar (Indeks)
Z 1 -3 -5 0 0 0 0
S1 0 2 0 1 0 0 8 8/0 = ∞
S2 0 0 3 0 1 0 15 15/3 = 5
S3 0 6 5 0 0 1 30 30/5 = 6
Z 1
S1 0
X2 0 0 1
S3 0
3/3
6s-24 LP Metode Simpleks
Variabel X1 X2 Keteranga
Z S1 S2 S3 NK
Dasar n (Indeks)
Z 1 -3 -5 0 0 0 0
S1 0 2 0 1 0 0 8 8/0 = ∞
S2 0 0 3 0 1 0 15 15/3 = 5
S3 0 6 5 0 0 1 30 30/5 = 6
Z 1
S1 0
X2 0 0 1 0
S3 0
0/3
6s-25 LP Metode Simpleks
Variabel X1 X2 Keteranga
Z S1 S2 S3 NK
Dasar n (Indeks)
Z 1 -3 -5 0 0 0 0
S1 0 2 0 1 0 0 8 8/0 = ∞
S2 0 0 3 0 1 0 15 15/3 = 5
S3 0 6 5 0 0 1 30 30/5 = 6
Z 1
S1 0
X2 0 0 1 0 1/3
S3 0
1/3
6s-26 LP Metode Simpleks
Variabel X1 X2 Keteranga
Z S1 S2 S3 NK
Dasar n (Indeks)
Z 1 -3 -5 0 0 0 0
S1 0 2 0 1 0 0 8 8/0 = ∞
S2 0 0 3 0 1 0 15 15/3 = 5
S3 0 6 5 0 0 1 30 30/5 = 6
Z 1
S1 0
X2 0 0 1 0 1/3 0
S3 0
0/3
6s-27 LP Metode Simpleks
Variabel X1 X2 Keteranga
Z S1 S2 S3 NK
Dasar n (Indeks)
Z 1 -3 -5 0 0 0 0
S1 0 2 0 1 0 0 8 8/0 = ∞
S2 0 0 3 0 1 0 15 15/3 = 5
S3 0 6 5 0 0 1 30 30/5 = 6
Z 1
S1 0
X2 0 0 1 0 1/3 0 5
S3 0
15/3
6s-28 LP Metode Simpleks
Variabel X1 X2 Keteranga
Z S1 S2 S3 NK
Dasar n (Indeks)
Z 1 -3 -5 0 0 0 0
S1 0 2 0 1 0 0 8 8/0 = ∞
S2 0 0 3 0 1 0 15 15/3 = 5
S3 0 6 5 0 0 1 30 30/5 = 6
Z 1
S1 0
X2 0 0 1 0 1/3 0 5
S3 0
Variabel X1 X2 Keteranga
Z S1 S2 S3 NK
Dasar n (Indeks)
Z 1 -3 -5 0 0 0 0
S1 0 2 0 1 0 0 8 8/0 = ∞
S2 0 0 3 0 1 0 15 15/3 = 5
S3 0 6 5 0 0 1 30 30/5 = 6
Z 1
S1 0
X2 0 0 1 0 1/3 0 5
S3 0
6s-30 LP Metode Simpleks
Langkah 6: Mengubah nilai-nilai selain pada baris kunci
Rumusnya :
Baris baru = baris lama – (koefisien pada kolom kunci) x nilai baru baris kunci
Variabel X1 X2 Keteranga
Z S1 S2 S3 NK
Dasar n (Indeks)
Z 1 -3 -5 0 0 0 0
S1 0 2 KOEFISIEN 0 1 0 0 8 8/0 = ∞
BARIS LAMA
S2 0 0 3 0 1 0 15 15/3 = 5
S3 0 6 5 0 0 1 30 30/5 = 6
Z 1 BARIS BARU
S1 0
X2 0 0 1 0 1/3 0 5
S3 0
BARIS BARU KUNCI
6s-31 LP Metode Simpleks
BARIS LAMA Z [ -3 -5 0 0 0, 0]
-5 X [ 0 1 0 1/3 0, 5] _
Nilai Baru = -3 0 0 5/3 0, 25 ]
-5 X 0 = 0 → -3 – 0 = -3
-5 X 1 = -5 → - 5 – (-5) = -5 + 5 = 0
-5 X 0 = 0 → 0 – 0 = 0
-5 X 1/3 = -5/3 → 0 – (-5/3) = 0 + 5/3 = 5/3
-5 X 0 = 0 → 0 – 0 = 0
-5 X 5 = -25 → 0 – (-25) = 0 + 25 = 25
6s-32 LP Metode Simpleks
BARIS LAMA S1 [ 2 0 1 0 0, 8]
0 X [ 0 1 0 1/3 0, 5] _
Nilai Baru = 2 0 1 0 0, 8]
0X0=0→2–0=2
0X1=0→0–0= 0
0X0=0→1–0=1
0 X 1/3 = 0 → 0 – 0 = 0
0X0=0→0–0=0
0X5=0→8–0=8
6s-33 LP Metode Simpleks
BARIS LAMA S3 [ 6 5 0 0 1, 30 ]
5 X [ 0 1 0 1/3 0, 5] _
Nilai Baru = 6 0 0 -5/3 1, 5]
5X0=0→6–0=6
5X1=5→5–5= 0
5X0=0→0–0=0
5 X 1/3 = 5/3 → 0 – 5/3 = -5/3
5X0=0→1–0=1
5 X 5 = 25 → 30 – 25 = 5
6s-34 LP Metode Simpleks
Variabel X1 X2
Z S1 S2 S3 NK
Dasar
Z 1 -3 -5 0 0 0 0
S1 0 2 0 1 0 0 8
S2 0 0 3 0 1 0 15
S3 0 6 5 0 0 1 30
Z 1 -3 0 0 5/3 0 25
S1 0 2 0 1 0 0 8
X2 0 0 1 0 1/3 0 5
S3 0 6 0 0 -5/3 1 5
Variabel Keterangan
Z X1 X2 S1 S2 S3 NK
Dasar (Indeks)
Z 1 -3 0 0 5/3 0 25
S1 0 2 0 1 0 0 8 = 8/2 = 4
X2 0 0 1 0 1/3 0 5
S3 0 6 0 0 -5/3 1 5 = 5/6 (minimum)
Z 1
S1 0
X2 0
-3 X 1 = -3 → -3 – (-3) = -3 + 3 = 0
-3 X 0 = 0 → 0 – 0 = 0
-3 X 0 = 0 → 0 – 0 = 0
-3 X -5/18 = 15/18 → 5/3 – 15/18 = 30/18 - 15/18 = 15/18 = 5/6
-3 X 1/6 = -3/6 → 0 – (-3/6) = 0 + 3/6 = 3/6 = 1/2
-3 X 5/6 = -15/6 → 25 – (-15/6) = 25 + 15/6 = 25 + 2,5 = 27,5
6s-37 LP Metode Simpleks
BARIS LAMA S1 [ 2 0 1 0 0, 8]
2 X [ 1 0 0 -5/18 1/6, 5/6 ] _
Nilai Baru = 0 0 1 5/9 -1/3, 19/3 ]
2X1=2→2–2=0
2X0=0→0–0=0
2X0=0→1–0=1
2 X -5/18 = -10/18 → 0 – (-10/18) = 0 + 10/18 = 10/18= 5/9
2 X 1/6 = 2/6 → 0 – 2/6 = -2/6 = -1/3
2 X 5/6 = 10/6 → 8 – 10/6 = 48/6 - 10/6 = 38/6 = 19/3
6s-38 LP Metode Simpleks
0X1=0→0–0=0
0X0=0→1–0=1
0X0=0→0–0=0
0 X -5/18 = 0 → 1/3 – 0 = 1/3
0 X 1/6 = 0 → 0 – 0 = 0
0 X 5/6 = 0 → 5 – 0 = 5
6s-39 LP Metode Simpleks
Variabel X1 X2
Z S1 S2 S3 NK
Dasar
Z 1 -3 0 0 5/3 0 25
S1 0 2 0 1 0 0 8
X2 0 0 1 0 1/3 0 5
S3 0 6 0 0 -5/3 1 5
Z 1 0 0 0 5/6 1/2 27,5
S1 0 0 0 1 5/9 -1/3 61/3
X2 0 0 1 0 1/3 0 5
X1 0 1 0 0 -5/18 1/6 5/6
Variabel X1 X2
Z S1 S2 S3 NK
Dasar
Z 1 0 0 0 5/6 ½ 271/2
S1 0 0 0 1 5/9 -1/3 61/3
X2 0 0 1 0 1/3 0 5
X1 0 1 0 0 -5/18 1/6 5/6
Baris pertama (Z) tidak ada lagi yang bernilai negatif. Sehingga tabel tidak
dapat dioptimalkan lagi dan tabel tersebut merupakan hasil optimal
Kasus Maksimisasi :
Model Program Linear
1. Fungsi Tujuan :
Maksimumkan : Z=8X1 + 6X2
(Dlm Rp1000)
2. Fungsi Pembatas :
Bahan A : 4X1 + 2X2 ≤ 60
Bahan B : 2X1 + 4X2 ≤ 48
X1, X2 ≥ 0