b. Untuk Perencanaan Juni
INPUT MIN DB11 + DB12 + DB13 + DB14 + DA1 + DA2 + DA3 + DA4 + DA5 + DA6 + DA7 + DA8 + DA9
+ DA10 SUBJECT TO
2 -DA11 + DB11 + X1 = 3901 3 -DA12 + DB12 + X2 = 926
4 -DA13 + DB13 + X3 = 888 5 -DA14 + DB14 + 350000X1 + 375000X2 + 400000X3 = 2141348000
6 -DA1 + DB1 + 2X1 + 2.3X2 + 2.7X3 = 21120 7 -DA2 + DB2 + 0.6X1 + 0.5X2 +0.5X3 = 4500
8 -DA3 + DB3 + 0.0795X1 + 0.0745X2 + 0.077X3 = 600 9 -DA4 + DB4 + 0.2565X1 + 0.288X2 + 0.3X3 = 1950
10 -DA5 + DB5 + 0.02X1 + 0.03X2 + 0.016X3 = 180 11 -DA6 + DB6 + 0.01X1 + 0.02X2 + 0.016X3 = 120
12 -DA7 + DB7 + 0.01X1 + 0.02X2 + 0.026X3 = 150 13 -DA8 + DB8 + 0.0105X1 + 0.028X2 + 0.03X3 = 180
14 -DA9 + DB9 + 0.01X1 + 0.03X2 + 0.025X3 = 180 15 -DA10 + DB10 + 0.0035X1 + 0.009X2 + 0.006X3 = 60
END OUTPUT
LP OPTIMUM FOUND AT STEP 3 OBJECTIVE FUNCTION VALUE
1 0.0000000E+00 VARIABLE VALUE REDUCED COST
DB11 0.000000 1.000000 DB12 0.000000 1.000000
DB13 0.000000 1.000000 DB14 0.000000 1.000000
DA1 0.000000 1.000000 DA2 0.000000 1.000000
DA3 0.000000 1.000000 DA4 0.000000 1.000000
DA5 0.000000 1.000000 DA6 0.000000 1.000000
DA7 0.000000 1.000000 DA8 0.000000 1.000000
DA9 0.000000 1.000000 DA10 0.000000 1.000000
DA11 0.000000 0.000000 X1 3901.000000 0.000000
DA12 0.000000 0.000000 X2 926.000000 0.000000
DA13 183.869919 0.000000 X3 1071.869873 0.000000
DA14 0.000000 0.000000 DB1 8294.151367 0.000000
DB2 1160.465088 0.000000 DB3 138.349533 0.000000
DB4 361.144501 0.000000 DB5 57.050079 0.000000
DB6 45.320080 0.000000 DB7 64.601379 0.000000
DB8 80.955399 0.000000 DB9 86.413254 0.000000
DB10 31.581280 0.000000 ROW SLACK OR SURPLUS DUAL PRICES
2 0.000000 0.000000 3 0.000000 0.000000
4 0.000000 0.000000 5 0.000000 0.000000
6 0.000000 0.000000 7 0.000000 0.000000
8 0.000000 0.000000 9 0.000000 0.000000
10 0.000000 0.000000 11 0.000000 0.000000
12 0.000000 0.000000 13 0.000000 0.000000
14 0.000000 0.000000 15 0.000000 0.000000
NO. ITERATIONS= 3
c. Untuk Perencanaan Juli
Kategori