Universitatea Spiru Haret

Exemplul 1:

[ max ] f = 2 x1 + 4 x2 − x3 + 5 x4

2 x1 + x2 + x3 + x4 = 10

 x1 + 2 x2 + x3 + 3x4 = 15
xi ≥ 0, i = 1,4

Rezolvare:
 2 1 1 1
Matricea sistemului A :  
 1 2 1 1
Problema se va rescrie
[ max ] f = 2 x1 + 4 x2 − x3 + 5 x4 − Mu1 − Mu2
 2 x1 + x2 + x3 + x4 + u1 = 10

 x1 + 2 x2 + x3 + 3 x4 + u2 = 15
xi ≥ 0, i = 1, 4, u1 ≥ 0, u2 ≥ 0

Matricea se rescrie corespunzător

 2 1 1 1 1 0
A= 
1 2 1 3 0 1
B = {u1, u2}
Universitatea Spiru Haret

cj 2 4 -1 5 -M -M
CB B XB x1 x2 x3 x4 u1 u2
- u1 10 2 1 1 1 1 0  10 15 
M min  ,  =
1 3
- u
2 15 1 2 1 3↓ 0 1 15
= → 3 PIVOT
M 3
Zj -3M -3M -2M -4M -M -M
∆j = Cj – Zj 2-3M 3M+4 2M-1 4M+5 0 0 soluŃia nu este
optimă
(∃∆j > 0)
- u1 ← 5 5/3 1/3 2/3 0 1 -1/3
M
5 x4← 5 1/3 2/3 1/3 1 0 1/3  5 5 
min  , =
 5 / 3 1/ 3 
Zj 5/3-5/3M 10/3- 5/3- 5 -M M/3+ 5
= → 5 / 3 PIVOT
M/3 2M/3 5/3 5/3
∆j = Cj – Zj 5/3M+1/3 M/3+2/3 2M/3- 0 0 -4M/3 soluŃia nu este
8/3 -5/3 optimă
(∃∆j > 0)
2 x1 3 1 1/5 2/5 0 3/5 -1/5
5 x4← 4 0 3/5↓ 1/5 1 -1/5 2/5  3 4 
min  , =
 1/5 3 / 5 
Zj 26 2 17/5 9/5 5 1/5 8/5 4
= → 3/ 5 PIVOT
3/5
∆j = Cj – Zj 0 3/5 -14/5 0 -M- -M-8/5 soluŃia nu este
1/5 optimă
(∆j ≤ 0)
2 x1 5/3 1 0 1/3 -1/3 2/3 -1/3
4 x2 20/3 0 1 1/3 5/3 -1/3 2/3
Zj 80/3 2 4 2 6 0 2
∆j = Cj – Zj 0 0 -3 -1 -M -M-2 soluŃia este optimă
(toate diferenŃele
∆j ≤ 0)

SoluŃia max f = 80/3

x1 = 5/3 u1 = u2 = 0
x2 = 20/3
x3 = x4 = 0

Exemplul 2:

[ min ] f = x1 + x2 + x3 + 2 x4 + 3 x5 + 4 x6
 2 x1 + x2 + x3 + x4 + x5 + x6 ≤ 8

 x1 + 2 x2 + x3 + x4 + 3 x5 + x6 = 24
x + x + 2x + x + x + x ≥ 8
 1 2 3 4 5 6

xi ≥ 0, i = 1, 6
Universitatea Spiru Haret

Rezolvare:

Problema se va rescrie introducând variabilele de compensare şi artificiale corespunzătoare

[ min ] f = x1 + x2 + x3 + 2 x4 + 3 x5 + 4 x6 + 0 y1 + 0 y2 + Mu1 + Mu2

 2 x1 + x2 + x3 + x4 + x5 + x6 + y1 = 8

 x1 + 2 x2 + x3 + x4 + 3 x5 + x6 + u1 = 24
x + x + 2x + x + x + x − y + u = 8
 1 2 3 4 5 6 2 2

xi ≥ 0, i = 1, 6, y1 ≥ 0, y2 ≥ 0; u1 ≥ 0; u2 ≥ 0

Matricea sistemului va fi:

2 1 1 1 1 1 1 0 0 0
A : 1 2 1 1 3 1 0 0 1 0

 
 1 1 2 1 1 1 0 − 1 0 1 

Observăm că B = {y1, u1, u2}

cj 1 1 1 2 3 4 0 0 M M
CB B XB x1 x2 x3 x4 x5 x6 y1 y2 u1 u2
0 y1← 8 2 1 1 1 1↓ 1 1 0 0 0
M u1 24 1 2 1 1 3 1 0 0 1 0
M u2 8 1 1 2 1 1 1 0 -1 0 1
Zj 2M 3M 3M 2M 4M 2M 0 -M M M
∆j = Cj – Zj 1-2M 1-3M 1-3M 2-2M 3-4M 4-2M 0 M 0 0

3 x5 8 2 1 1 1 1 1 1 0 0 0
M u1 0 -5 -1 -2 -2 0 -2 -3 0 1 0
M u2 0 -1 0 1 0 0 0 -1 -1 0 1
zj 24 6-6M 3-M 3-M 3-2M 3 3-2M 3-4M -M M M
∆j = Cj – Zj 6M-5 M-2 M-2 2M-1 0 2M+1 4M-3 M 0 0
SoluŃia [min]f = 24
u1 = u2 = 0
y1 = y2 = 0
x1 = x2 = x3 = x4 = x6 = 0
x5 = 8