Input Lindo Dan Hasil Solving No.2
Input Lindo Dan Hasil Solving No.2
Min
12.2x11+12.2x12+6.1x13+6.1x14+6.1x15+20.7x21+20.7x22+10.4x23+10.4x2
4+10.4Xx25+16.5x31+16.5x32+8.3x33+8.3x34+8.3x35+20.7x41+20.7x42+10
.4x43+10.4x44+10.4x45
st
0.04x11+0.17x21+0.06x31+0.12x41<=500
0.05x12+0.14x22+0.14x42<=400
0.06x13+0.13x23+0.05x33+0.10x43<=600
0.05x14+0.21x24+0.02x34+0.10x44<=550
0.03x15+0.15x25+0.04x35+0.15x45<=500
x11+x12+x13+x14+x15=1800
x21+x22+x23+x24+x25=1400
x31+x32+x33+x34+x35=1600
x41+x42+x43+x44+x45=1800
end
HASIL SOLVING
LP OPTIMUM FOUND AT STEP
42980.00
VARIABLE
X11
X12
X13
X14
X15
X21
X22
X23
X24
XX25
X31
X32
X33
X34
X35
X41
X42
X43
X44
X45
X25
VALUE
0.000000
0.000000
0.000000
0.000000
1800.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
0.000000
1600.000000
0.000000
0.000000
1800.000000
0.000000
0.000000
1400.000000
REDUCED COST
6.100000
6.100000
0.000000
0.000000
0.000000
20.700001
20.700001
10.400000
10.400000
10.400000
8.200000
8.200000
0.000000
0.000000
0.000000
10.300001
10.300001
0.000000
0.000000
0.000000
0.000000
5)
6)
7)
8)
9)
10)
550.000000
172.000000
0.000000
0.000000
0.000000
0.000000
NO. ITERATIONS=
0.000000
0.000000
-6.100000
0.000000
-8.300000
-10.400000