Tugas RSPK 5
Tugas RSPK 5
Diketahui :
Decision Variables
X1 = The number of Walkmans produced
X2 = The number of Television produced
Objective Function
Optimize Profits = $7 X₁ + $5 X₂
Constraints
Subject to LP constraints = 2 X₁ + 1 X₂ ≤ 100
4 X₁ + 3 X₂ ≤ 240
Ditanya :
Maksimalkan keuntungan
Jawab :
Slack Variables = S₁ & S₂
The first constraints becomes equation as :
2 X₁ + 1 X₂
and the second becomes :
4 X₁ + 3 X₂
Cj $7 $5 $0 $0
Solution Mix X₁ X₂ S₁ S₂ QUANTITY
$0 S₁ 2 1 1 0 100
$0 S₂ 4 3 0 1 240
Zj $0 $0 $0 $0
Cj-Zj $7 $5 $0 $0
1'ST TABLEAU
Step 1 & 2 (The Pivot Column and Row)
Cj $7 $5 $0 $0
Solution Mix X₁ X₂ S₁ S₂ QUANTITY
$0 S₁ 2 1 1 0 100
$0 S₂ 4 3 0 1 240
Zj $0 $0 $0 $0
Cj-Zj $7 $5 $0 $0
Pivot Kolom
Cj
Solution Mix X₁ X₂ S₁ S₂ QUANTITY
$7 X₁ 1 0.5 0.5 0 50
S₂
Numb.
S2 old Under X1 new S2
PR
4 4 1 0
3 4 0.5 1
0 4 0.5 -2
1 4 0 1
240 4 50 40
Cj
Solution Mix X₁ X₂ S₁ S₂ QUANTITY
$7 X₁ 1 0.5 0.5 0 50
0 S₂ 0 1 -2 1 40
Cj $7 $5 $0 $0
Solution Mix X₁ X₂ S₁ S₂ QUANTITY
$7 X₁ 1 0.5 0.5 0 50
$0 S₂ 0 1 -2 1 40
Zj $7 $3.5 $3.5 $0
Cj-Zj $0 $1.5 -$3.5 $0
2'ND TABLEAU
Cj $7 $5 $0 $0
Solution Mix X₁ X₂ S₁ S₂ QUANTITY
$7 X₁ 1 0.5 0.5 0 50
$0 S₂ 0 1 -2 1 40
Zj $7 $3.5 $3.5 $0
Cj-Zj $0 $1.5 -$3.5 $0
2'ND TABLEAU
Step 1 & 2 (The Pivot Column and Row)
Cj $7 $5 $0 $0
Solution Mix X₁ X₂ S₁ S₂ QUANTITY
$7 X₁ 1 0.5 0.5 0 50
$0 S₂ 0 1 -2 1 40
Zj $7 $3.5 $3.5 $0
Cj-Zj $0 $1.5 -$3.5 $0
Pivot Kolom
Cj
Solution Mix X₁ X₂ S₁ S₂ QUANTITY
$7 X₁
$0 X₂ 0 1 -2 1 40
X₁ old X₁ X₂ new X₁
1 0.5 0 1
0.5 0.5 1 0
0.5 0.5 -2 1.5
0 0.5 1 -0.5
50 0.5 40 30
Cj
Solution Mix X₁ X₂ S₁ S₂ QUANTITY
$7 X₁ 1 0 1.5 -0.5 30
$5 S₂ 0 1 -2 1 40
Cj $7 $5 $0 $0
Solution Mix X₁ X₂ S₁ S₂ QUANTITY
$7 X₁ 1 0 1.5 -0.5 30
$5 X₂ 0 1 -2 1 40
Zj $7 $5.0 $0.5 $1.5 $410
Cj-Zj $0 $0.0 -$0.5 -$1.5
Solution :
X₁ = 30 Walkmans
X₂ = 40 Televisions
S₁ = 0 Slack in first resource
Slack in second
S₂ = 0
resource
Profit = $410
+ S₁ = 100
+ S₂ = 240
+ 1 S₁ + 0 S₂ = 100
+ 0 S₁ + 1 S₂ = 240
+ $0 S₁ + $0 S₂
50 Pivot Row
60
Because not all numbers in the Cj - Zj row of this latest Tableau are zero or
negative, the solution (that is, X1 = 50, S2 = 40, X2 = 0, S1 = 0; profit =
$350) is not optimal. We then proceed to a third tableau and repeat the five
steps.
Pivot Row
Because every number in the
third tableau’s Cj - Zj row is zero or negative, we
have reached an optimal solution.
MODEL PROGRAM LINEAR
Diketahui :
Decision Variables
X1 = The number pounds of phostphate in the mixture
X2 = The number pounds of potasium in the mixture
Objective Function
Minimize cost = $5 X₁ + $6 X₂
Constraints
Subject to LP constraints
= 1 X₁ + 1 X₂ = 1000
1 X₁ ≤ 300
1 X₂ ≥ 150
Ditanya :
Minimize cost
Jawab :
Constraint in Simplex Form
1 X₁ + 1 X₂
1 X₁ + 1
1 X₂
1'ST TABLEAU Cj 5 6 0 0 M M
Solution Mix X₁ X₂ S₁ S₂ A₁ A₂ QUANTITY
M A₁ 1 1 0 0 1 0 1000
0 S₁ 1 0 1 0 0 0 300
M A₂ 0 1 0 -1 0 1 150
Zj M 2M 0 -M M M 1150M
Zj-Cj M-5 2M-6 0 M 0 0
Pivot Kolom
A₁ Prev. P A₁ New A₁
1 1 0 1
1 1 1 0
0 1 0 0
0 1 -1 1
1 1 0 1
0 1 1 -1
1000 1 150 850
S₁ Prev. P S₁ New S₁
1 0 0 1
0 0 1 0
1 0 0 1
0 0 -1 0
0 0 0 0
0 0 1 0
300 0 150 300
2'ND TABLEAU Cj 5 6 0 0 M M
Solution Mix X₁ X₂ S₁ S₂ A₁ A₂ QUANTITY
M A₁ 1 0 0 1 1 -1 850
0 S₁ 1 0 1 0 0 0 300
6 X₂ 0 1 0 -1 0 1 150
Zj M 6 0 M-6 M -M+6 850M+900
Zj-Cj M-5 0 0 M-6 0 6
Pivot Kolom
A₁ Prev. P X₂ New A₁
1 1 1 0 0
0 1 0 0 0
0 1 1 -1 -1
1 1 0 1 1
1 1 0 1 1
-1 1 0 -1 -1
850 1 300 550 550
X₂ Prev. P X₂ New S₁
0 0 1 0 0
1 0 0 1 1
0 0 1 0 0
-1 0 0 -1 -1
0 0 0 0 0
1 0 0 1 1
150 0 300 150 150
3'RD TABLEAU Cj 5 6 0 0 M M
Solution Mix X₁ X₂ S₁ S₂ A₁ A₂ QUANTITY
M A₁ 0 0 -1 1 1 -1 550
5 X₁ 1 0 1 0 0 0 300
6 X₂ 0 1 0 -1 0 1 150
Zj 5 6 -M+5 M-6 M -M+6 550M+900
Zj-Cj 0 0 -M+6 M-6 0 6
Pivot Kolom
X₁ Prev. P X₂ New A₁
1 0 0 1 1
0 0 0 0 0
1 0 -1 1 1
0 0 1 0 0
0 0 1 0 0
0 0 -1 0 0
300 0 550 300 300
X₂ Prev. P X₂ New S₁
0 -1 0 0 0
1 -1 0 1 1
0 -1 -1 -1 -1
-1 -1 1 0 0
0 -1 1 1 1
1 -1 -1 0 0
150 -1 550 700 700
4'TH TABLEAU Cj 5 6 0 0 M M
Solution Mix X₁ X₂ S₁ S₂ A₁ A₂ QUANTITY
0 S₂ 0 0 -1 1 1 -1 550
5 X₁ 1 0 1 0 0 0 300
6 X₂ 0 1 -1 0 1 0 700
Zj 5 6 -1 0 6 0 5700
Zj-Cj 0 0 -1 0 -M+6 -M
Solution :
X₁ = 300 pounds of phostphate
X₂ = 700 pounds of potasium
Minimize cost:
Z = $5 X₁ + $6 X₂ + $0
Z = $5,700
+ 1 A₁ = 1000
S₁ = 300
- 1 S₂ + 1 A₂ = 150
X₂ + $0 S₁ + $0 S₂ + $MA₁ + $MA₂
QUANTITY RATIO
1000
N/A
150 Pivot Row
QUANTITY
QUANTITY RATIO
850
300 Pivot Row
N/A
850M+900
QUANTITY RATIO
550 Pivot Row
N/A
N/A
550M+900
Because not all numbers in the Zj-Cj row of this latest
Tableau are zero or negative, the solution is not optimal.
We then proceed next tableau and repeat the five steps.
QUANTITY
QUANTITY
=> CORRECT
=> CORRECT
=> CORRECT
S₁ + $0 S₂ + $MA₁ + $MA₂
row of this latest
ution is not optimal.
eat the five steps.
row of this latest
ution is not optimal.
eat the five steps.
negative, we