16
Lampiran 1 Pemecahan masalah pencabangan pada contoh 1 dengan menggunakan Lindo 6.1
a. Pemecahan
LP MAX 5 X1 + 4 X2
SUBJECT TO X1 +X2 = 5
10 X1 + 6 X2 = 45 X1 =0
x2 =0
END LP OPTIMUM FOUND AT STEP 2
OBJECTIVE FUNCTION VALUE 1 23.75000
VARIABLE VALUE REDUCED COST X1 3.750000 0.000000
X2 1.250000 0.000000 ROW SLACK OR SURPLUS DUAL PRICES
2 0.000000
2.500000 3 0.000000
0.250000 4 3.750000
0.000000 5 1.250000
0.000000 NO. ITERATIONS= 2
b. Pemecahan LP
1
MAX 5 X1 + 4 X2 SUBJECT TO
X1 +X2 = 5 10 X1 + 6 X2 = 45
X1 =3 X1 =0
x2 =0
END LP OPTIMUM FOUND AT STEP 2
OBJECTIVE FUNCTION VALUE 1 23.00000
VARIABLE VALUE REDUCED COST X1 3.000000 0.000000
X2 2.000000 0.000000 ROW SLACK OR SURPLUS DUAL PRICES
2 0.000000
4.000000
17
3 3.000000 0.000000
4 0.000000 1.000000
5 3.000000 0.000000
6 2.000000 0.000000
NO. ITERATIONS= 2 c. Pemecahan
LP
2
MAX 5 X1 + 4 X2 SUBJECT TO
X1 +X2 = 5 10 X1 + 6 X2 = 45
X1 =4 X1 =0
x2 =0
END LP OPTIMUM FOUND AT STEP 1
OBJECTIVE FUNCTION VALUE 1 23.33333
VARIABLE VALUE REDUCED COST X1 4.000000 0.000000
X2 0.833333 0.000000 ROW SLACK OR SURPLUS DUAL PRICES
2 0.166667
0.000000 3 0.000000 0.666667
4 0.000000 -1.666667
5 4.000000 0.000000
6 0.833333 0.000000
NO. ITERATIONS= 1 d. Pemecahan
LP
3
MAX 5 X1 + 4 X2 SUBJECT TO
X1 +X2 = 5 10 X1 + 6 X2 = 45
X1 =4 X2 =0
X1 =0 x2 =0
END LP OPTIMUM FOUND AT STEP 2
OBJECTIVE FUNCTION VALUE 1 22.50000
18
VARIABLE VALUE REDUCED COST X1 4.500000 0.000000
X2 0.000000 0.000000 ROW SLACK OR SURPLUS DUAL PRICES
2 0.500000
0.000000 3 0.000000
0.500000 4 0.000000
1.000000 5 4.500000
0.000000 6 0.000000
0.000000 NO. ITERATIONS= 2
e. Pemecahan
LP
4
MAX 5 X1 + 4 X2 SUBJECT TO
X1 +X2 = 5 10 X1 + 6 X2 = 45
X1 =4
X2 =1
X1 =0
x2 =0
END NO FEASIBLE SOLUTION AT STEP 2
SUM OF INFEASIBILITIES= 0.166666671633720 VIOLATED ROWS HAVE NEGATIVE SLACK,
OR EQUALITY ROWS NONZERO SLACKS. ROWS CONTRIBUTING TO INFEASIBILITY
HAVE NONZERO DUAL PRICE. f. Pemecahan
LP
5
MAX 5 X1 + 4 X2 SUBJECT TO
X1 +X2 = 5 10 X1 + 6 X2 = 45
X1 =4
X2 =0
X1 =0
x2 =0
END LP OPTIMUM FOUND AT STEP 2
OBJECTIVE FUNCTION VALUE 1 20.00000
VARIABLE VALUE REDUCED COST X1 4.000000 0.000000
X2 0.000000 0.000000
19
ROW SLACK OR SURPLUS DUAL PRICES 2 1.000000 0.000000
3 5.000000 0.000000 4 0.000000 5.000000
5 0.000000 4.000000 6 4.000000 0.000000
7 0.000000 0.000000 NO. ITERATIONS= 2
g. Pemecahan
