Professional Documents
Culture Documents
U EKONOMIJI I MENADŽMENTU
Vježbe br. 14
Linearno programiranje
Simpleks metoda
Simpleks algoritam LP
Cs A X b Ab
S b
B A As
f Cb X b
Cb Ab Xb Kbs Sb
As K bs Ab
b
f (Cs-f
N s
)
So
Sb X b K bs 0 N
Cs f s Cs Cb K bs S 0 f (C s f s ) 0
s 1
b s 1
Zadatak 1:
max f 140 x1 80 x2 0 x3 0 x4 0 x5 0 x6
3 x1 2 x2 1x3 0 x4 0 x5 0 x6 24 000
2,5 x1 5 x2 0 x3 1x4 0 x5 0 x6 35 000
1x1 0 x2 0 x3 0 x4 1x5 0 x6 6 000
0 x1 1x2 0 x3 0 x4 0 x5 1x6 5 000
x1 , x2 , x3 , x4 , x5 , x6 0
Rješenje:
C0 B A0
A1 A2 A3 A4 A5 A6
Cs - fs
1 = 6000 Korisni vektori 1 ·(C1-f1) = 6000 ·140 =840000
140 80 0 0 0 0
C0 B A0
A1 A2 A3 A4 A5 A6
0 X3 24000 3 2 1 0 0 0
0 X4 35000 2,5 5 0 1 0 0
0 X5 6000 1 0 0 0 1 0
0 X6 5000 0 1 0 0 0 1
Cs -- ffs
C 0 140 80 0 0 0 0
s s
140 80 0 0 0 0
C0 B A0
A1 A2 A3 A4 A5 A6
0 X3 24000 3 2 1 0 0 0
0 X4 35000 2,5 5 0 1 0 0
0 X5 60001 0 0 0 1 0
0 X6 5000 0 1 0 0 0 1
C s - fs 0 140 80 0 0 0 0
140 80 0 0 0 0
C0 B A0
A11 A22 A33 A44 A55 A66
0 X3 6000 0 2 1 0 -3 0
0 X4 20000 0 5 0 1 -2,5 0
140 X1 6000 1 0 0 0 1 0
0 X6 5000 0 1 0 0 0 1
Css –
C – ffss 840000 0 80 0 0 -140 0
Korisni vektori =
140 80 0 0 0 0
C0 B A0
A1 A2 A3 A4 A5 A6
0 X3 6000 0 2 1 0 -3 0
0 X4 20000 0 5 0 1 -2,5 0
140 X1 6000 1 0 0 0 1 0
0 X6 5000 0 1 0 0 0 1
C s – fs 840000 0 80 0 0 -140 0
140 80 0 0 0 0
C0 B A0
A1 A2 A3 A4 A5 A6
0 X3 6000 0 2 1 0 -3 0
0 X4 20000 0 5 0 1 -2,5 0
140 X1 6000 1 0 0 0 1 0
0 X6 5000 0 1 0 0 0 1
C s – fs 840000 0 80 0 0 -140 0
140 80 0 0 0 0
C0 B A0
A1 A2 A3 A4 A5 A6
C s – fs
Optimalne vrijednosti:
Primal:
Dual:
140 80 0 0 0 0
C0 B A0
A1 A2 A3 A4 A5 A6
80 X2 3000 0 1 1/2 0 -3/2 0
0 X4 5000 0 0 -5/2 1 5 0
140 X1 6000 1 0 0 0 1 0
*
max f 10 x1 10 x 2 0 x3 0 x 4 0 x5 Mx5
2 x1 x 2 x3 450
2 x1 2 x 2 x4 600
x1 x5 x5 * 100
*
x1 , x 2 , x3 , x 4 , x5 0 ; x5 0
Rješenje:
10 10 0 0 0 -M
C0 B A0
A1 A2 A3 A4 A5 A5*
0 X3 450 2 1 1 0 0 0
0 X4 600 2 2 0 1 0 0
-M X5* 100 1 0 0 0 -1 1
Cs - fs -100M 10+M 10 0 0 -M 0
1 = 100 2 = 300
Rješenje:
10 10 0 0 0 -M
C0 B A0
A1 A2 A3 A4 A5 A6
0 X3 250 0 1 1 0 2 -2
0 X4 400 0 2 0 1 2 -2
10 X1 100 1 0 0 0 -1 1
-M+
Cs - fs 1000 0 10 0 0 10
10
Optimalno rješenje:
10 10 0 0 0 -M
C0 B A0
A1 A2 A3 A4 A5 A6
0 X3 50 0 0 1 -1/2 1 -1
10 X2 200 0 1 0 ½ 1 -1
10 X1 100 1 0 0 0 -1 1
Cs - fs 3000 0 0 0 -5 0 -M
II optimalno rješenje:
10 10 0 0 0 -M
C0 B A0
A1 A2 A3 A4 A5 A6
0 X3 50 0 0 1 -1/2 1 -1
10 X2 150 0 1 -1 1 0 0
10 X1 150 1 0 1 -1/2 0 0
Cs - fs 3000 0 0 0 -5 0 -M
Primjer 7 (simpleks metoda)
x1 x2 x3 1000
x1 x2 x3 100
x2 x3 200
x1 , x2 , x3 0
Standardizacija
*
min f 80 x1 120 x2 80 x3 0 x4 Mx5 0 x6 Mx6
1x1 1x2 1x3 1x4 0 x5 0 x6 0 x6 1000
*
*
1x1 1x2 1x3 0 x4 1x5 0 x6 0 x6 100
*
0 x1 1x2 1x3 0 x4 0 x5 1x6 1x6 200
*
x1 , x2 , x3 , x4 , x6 0 ; x5 , x6 0