92
Lampiran 11. Hasil Analisis QM for WINDOWS Skenario 1 Module / submodule: Linear Programming – [Solution List]
Problem title: Optimalisasi Usaha Agroindustri Tahu di Kota Pekanbaru Objective: Maximize
Results
X1 X2 RHS
Optimize 215,47 140,24
Constrains 1 0,02488 0.02015 <= 9.187,5
Constrains 2 0,02045 0,01641 <= 6.937,5
Constrains 3 0,03949 0,03222 <= 22.570,875
Constrains 4 0,00005 0,00003 <= 300
Constrains 5 135,21 110,31 <= 77.270.209,31
Ranging
Variable Value Redust Cost Original
Value BoundLower BoundUpper
X1 339.242,1 0 215,47 174,7659 Infinity
X2 0 32,6628 140,24 -Infinity 172,9028
Constraint Dual Value Slack Original Value
Lower Bound
Upper Bound
Constraint 1 0 747,1572 9.187,5 8.440,343 Infinity
Constraint 2 10.536,43 0 6.937,5 0 7.535,693
Constraint 3 0 9.174,212 22.570,875 13.396,67 Infinity
Constraint 4 0 283,0379 300 16,9621 Infinity
Constraint 5 0 31.401.290 77.270.210 45.868.920 Infinity
Solution List
Variable Status Value
X1 Basic 339.242,1
X2 Non Basic 0
Slack 1 Basic 747,1572
Slack 2 Basic 0
Slack 3 Basic 9.174,212
Slack 4 Basic 283,0379
Slack 5 Basic 31.401.290
93
Iterations
215,47 140,24 0 0 0 0 0
X1 X2 Slack 1 Slack 2 Slack 3 Slack 4 Slack 5 Iterations 1
slack 1 0,0249 0,0202 1 0 0 0 0
slack 2 0,0204 0,0164 0 1 0 0 0
slack 3 0,0395 0,0322 0 0 1 0 0
slack 4 0,0 0,0 0 0 0 1 0
slack 5 135,21 110,31 0 0 0 0 1
zj 0 0 0 0 0 0 0
cj – zj 215,47 140,24 0 0 0 0 0
Quantity Iteration 1
slack 1 9.187,5
slack 2 6.937,5
slack 3 22.570,88
slack 4 300
slack 5 77.270.210 zj
cj – zj
Next Iteration…
215,47 140,24 0 0 0 0 0
X1 X2 Slack 1 Slack 2 Slack 3 Slack 4 Slack 5 Iterations 2
slack 1 0 0,0002 1 -1,2166 0 0 0
X1 1 0,8024 0 48,8998 0 0 0
slack 3 0 0,0005 0 -1,9311 1 0 0
slack 4 0 0,0 0 -0,0024 0 1 0
slack 5 0 1,8114 0 -6.611,736 0 0 1
zj 215,47 172,9028 0 10.536,43 0 0 0
cj – zj 0 -32,6628 0 -10.536,43 0 0 0
Quantity Iteration 2
slack 1 747,1577
X1 339.242,1
slack 3 9.174,212
slack 4 283,0379
slack 5 31.401.290 zj
