Linear Programming
MO – Additional Modul
Trisakti School of Management
Rully Agusdin, SE.MM.
Linear Programming
Teknik matematis yang membantu
merencanakan dan membuat
keputusan sehubungan dengan
pengalokasian sumber daya penting
Digunakan untuk masalah optimasi,
yaitu memaksimumkan atau
meminimumkan fungsi tujuan yang
bergantung pada sejumlah variabel
input
Dua Macam Fungsi Linear Programming
Objective Function (Fungsi Tujuan) :
mengarahkan analisa untuk mendeteksi
tujuan perumusan masalah
Constraints Function (Fungsi Kendala) :
untuk mengetahui sumber daya yang
tersedia dan permintaan atas sumber daya
tersebut
Formulating LP Problems
Hours Required
to Produce 1 Unit
X-pods BlueBerrys Available Hours
Department (X1) (X2) This Week
Electronic 4 3 240
Assembly 2 1 100
Profit per unit $7 $5
Table B.1
Decision Variables:
X1 = number of X-pods to be produced
X2 = number of BlueBerrys to be produced
Formulating LP Problems
Objective Function:
Maximize Profit = $7X1 + $5X2
There are three types of constraints
Upper limits where the amount used is ≤ the
amount of a resource
Lower limits where the amount used is ≥ the
amount of the resource
Equalities where the amount used is = the
amount of the resource
Formulating LP Problems
First Constraint:
Electronic Electronic
time used is ≤ time available
4X1 + 3X2 ≤ 240 (hours of electronic time)
Second Constraint:
Assembly Assembly
time used is ≤ time available
2X1 + 1X2 ≤ 100 (hours of assembly time)
Corner-Point Method
X2
100 –
2 –
80 –
Number of BlueBerrys
–
60 –
–
3
40 –
–
20 –
–
|– | | | | | | | | | | X1
Figure B.7
1
0 20 40 60 80 100
4
Number of X-pods
Corner-Point Method
The optimal value will always be at a corner
point
Find the objective function value at each corner
point and choose the one with the highest profit
Point 1 : (X1 = 0, X2 = 0) Profit $7(0) + $5(0) = $0
Point 2 : (X1 = 0, X2 = 80) Profit $7(0) + $5(80) = $400
Point 4 : (X1 = 50, X2 = 0) Profit $7(50) + $5(0) = $350
Corner-Point Method
The optimal value will always be at a corner
Solve for the intersection of two constraints
point
Find the 4X 1 + 3X2 ≤ 240 (electronics time)
objective function value at each corner
2X1 + 1X2 ≤ 100 (assembly time)
point and choose the one with the highest profit
4X1 + 3X2 = 240 4X1 + 3(40) = 240
- 4X1 - 2X2 = -200 4X1 + 120 = 240
Point 1 : (X1 = +0, X1X =
2 =2 0)
40 X1 = $0
Profit $7(0) + $5(0) = 30
Point 2 : (X1 = 0, X2 = 80) Profit $7(0) + $5(80) = $400
Point 4 : (X1 = 50, X2 = 0) Profit $7(50) + $5(0) = $350
Corner-Point Method
The optimal value will always be at a corner
point
Find the objective function value at each corner
point and choose the one with the highest profit
Point 1 : (X1 = 0, X2 = 0) Profit $7(0) + $5(0) = $0
Point 2 : (X1 = 0, X2 = 80) Profit $7(0) + $5(80) = $400
Point 4 : (X1 = 50, X2 = 0) Profit $7(50) + $5(0) = $350
Point 3 : (X1 = 30, X2 = 40) Profit $7(30) + $5(40) = $410
Kasus Linear Programming (Maximization)
Masalah di proses produksi perusahaan LG
Elektronik dimana memproduksi 2 macam
produk, yaitu :
• LCD TV
• LCD Monitor
Hitung berapa harus diproduksi dari
masing-masing produk untuk didapatkan
profit yang maksimal dengan kondisi pada
tabel berikut :
Kasus Linear Programming (Maximization)
Jam dibutuhkan
Untuk Produksi 1 Unit
TV Monitor Ketersediaan Jam
Department (X1) (X2) Kerja Minggu ini
Pembuatan 8 6 480
Perakitan 4 2 200
Profit per unit $14 $10
Decision Variables:
X1 = number of TV to be produced
X2 = number of Monitor to be produced
Kasus Linear Programming (Maximization)
JAWABAN di papan tulis !
Kasus Linear Programming (Minimization)
Sebuah Pabrik Farmasi, memproduksi 2 macam produk
obat Batuk.
Produk 1, Obat Batuk Kering dengan biaya produksi
$5000/kg
Produk 2, Obat Batuk Berdahak dengan biaya produksi
$6000/kg
Berdasar rencana produksi, perusahaan harus berproduksi
minimal 60 kg obat Batuk Kering dan 40 kg obat Batuk
Berdahak.
Total produksi keduanya minimal 120 kg
Hitung cost minimum untuk produksi kedua obat tersebut!
