C0 = r1 x1 + r2 x2 x2 = C0 - r1 x1 slope = -r1
r2 r2 r2
3 kemungkinan optimasi :
‘
x1
-MRTS = - r1 = MRTS = r1
r2 r2
Ini syarat pertama, syarat yang diperlukan, necessary condition
Orde I : L = L1 = f1 - r1 = 0 = f1 = f2 f1 = r1
X1 r1 r2 f2 r2
L = L2 = f2 - r2 = 0
X2
L = C0 – r1 x1 – r2 x2 = 0
MP1 = f1 MRTS = r1
MP2 f2 r2
Orde II : H2 >0 H2 = f11 f12 -r1
-r1 -r2 0
Orde I : Z = Z1 = r1 - f1 = 0 = r1 = r2
x1 f1 f2
Z2 = r2 - f2 = 0
Zx = qo - f (x1, x2) = 0
Contoh :
1. Cost Constraint:
Q = x1 x2 + 2x1
Co = 6000 qo = 128ƛ
r1 = 4
r2 = 2
Ditanyakan : Cari x1 dan x2 Optimum dengan cara:
a. Expansion Path
b. Lagrange Multiplier (Cost Constraint)
c. Output Constraint
Jawab:
a. Expansion Path
Q = x1 x2 + 2x1
f1 = x2 + 2
f2 = x1
f1. r2 - f2.r1 = 0
(x2 + 2) . 2 - x1 . 4 = 0
2 x2 + 4 - 4 x1 = 0
4 x1 = 2 x2 + 4
x1= ½ x2 + 1
Co = r1 x1 + r2 x2
6000 = 4 (1/2 x2 + 1) + 2.x2
6000 = 2 x2 + 4 + 2 x2
4 x2 = 6000 – 4
x2 = 1499
x1 = ½ x2 + 1
x1 = ½ (1499) + 1
x1 = 750,5
b. Dengan Lagrange
L = x1 x2 + 2x1 + ƛ ( 6000 – 4x1 – 2x2)
L1 = x2 + 2 - 4ƛ
L2 = x1 – 2 ƛ ƛ = ¼ (x2 + 2) = ½ x1
x1 = ½ ( x2 + 2)
L ƛ = 6000 – 4x1 – 2x2
0 = 6000 – 4 . ½ (x2 + 2) – 2 x2
0 = 6000 - 2 x2 – 4 – 2x2
4 x2 = 5996
x2 = 1499
x1 = ½ ( 1501) = 750,5
H2 >0
-r1 -r2 0
= 0 1 -4 0 0
1 0 -2 1 0
-4 -2 0 -4 -2
= 8 + 8 - ( 0 ) = 16 > 0
Convex berarti kombinasi x1 dan x2 optimum
c. Output Cosntraint
Jawab:
L = 4 x1 + 2x2 + ƛ ( 128 – x1x2 - 2 x1)
L1 = 4 + ƛ (- x2 – 2) -ƛ (x2 + 2) = - 4 ƛ = 4 / (x2 + 2) *
L2 = 2 + ƛ ( - x1) ƛ x1 = 2 ƛ = 2/ x1 *
L ƛ = 128 – x1 x2 – 2x1
4 2
(x2 + 2) = x1
4 x1 = 2 x2 + 4
x1 = ½ x2 + 1
128 – ( ½ x2 + 1) x2 - 2 ( ½ x2 + 1) = 0
128 – ½ x2 2 – x2 - x2 - 2 = 0
256 - x2 2 - 4 x2 4 = 0
256 - ( x2 2 + 4 x2 + 4 ) = 0
( x2 + 2 )2 = 256
x2 + 2 = 16
x2 = 14
x1 = ½. 14 + 1 = 8
H2 <0
H2 = 0 -ƛ - (x2 +2) 0 -ƛ
-ƛ 0 - x1 -ƛ 0
- (x2 + 2) - x1 0 - (x2 + 2) - x1
Dst dicari