Documente Academic
Documente Profesional
Documente Cultură
OPTIMIZRI LINIARE
BREVIAR TEORETIC
Considerm problema de programare liniar scris sub forma
standard:
[opt ] f = cx
(*)
Ax = b ,
x0
unde
A M m, n (R ), b M m,1 (R ), c M 1, n (R ), c M 1, n (R ), x M n,1 (R ) .
(*) ,
X p= x R n / Ax = b, x 0 .
Definiia 2. Se numete soluie posibil de baz a problemei (*) ,
( )
atunci
soluia
k =1
k =1
optim
general
are
forma:
x 0 = k x ok , k 0, k = 1 .
[max] f
= 4 x1 + 7 x 2
x1 + x 2 6
x x 2
1
2
1
x
2
x1 , x 2 0
C
(d3)
S3
S5
A
x1
O
S1
(d1)
(d2)
B = d 2 d 3 ; rezolvnd sistemul
x1 x 2 = 2
x2 = 1
Analog, C = d1 d 2 = C (4, 2 ) .
D = d1 Ox 2 D(0, 6 ) .
Deoarece mulimea X p este mrginit, rezult c:
[max] f
= 2 x1 + 3x 2
2 x1 + 5 x 2 2
2 x1 + 3 x 2 6
x , x 0
1 2
Rezolvare:
I. Determinm mulimea soluiilor posibile ale problemei.
Scriem ecuaiile ataate celor trei inecuaii i reprezentm
grafic dreptele care le corespund acestora n plan:
d1 : 2 x1 + 5 x 2 = 2 , care taie axele n punctele 0, 2 i ( 1, 0 ) .
( 5)
x2
S3
S2
B
C
S4
A
S1
x1
(d1)
(d2)
( 5)
(2 )
A 0, 2 , B(0, 2 ) i C 3 ,1 .
II. Calculm valoarea funciei obiectiv n vrfurile mulimii X p .
( 5)
Avem c f ( A) = f 0, 2 = 6 ; f (B ) = f (0, 2 ) = 6 ; f (C ) = f
5
(32 ,1) = 6 .
(2 )
(2 )
t
X o = (0, 2 )t + (1 ) 3 ,1 , [0,1] , adic segmentul [BC ] .
[min] f
= 9 x1 + 5 x 2
x1 + x 2 1
x1 + 2 x 2 1
x , x 0
1 2
Rezolvare:
Determinm mulimea soluiilor posibile ale problemei.
Dreptele ce determin semiplanele ataate celor dou inecuaii sunt:
d1 : x1 + x 2 = 1 , care taie axele n punctele (0,1) i ( 1, 0 ) .
( 2 ) i (1, 0) .
Intersectm semiplanele S1 : x1 + x 2 1 , S 2 : x1 + 2 x 2 1 ,
S 3 : x1 0 , S 4 : x 2 0 .
x2
S3
(d1)
S2
S4
x1
O
(d2)
S1
[max] f
= 3 x1 + 5 x 2
x1 - 3 x 2 3
2 x1 + x 2 2
x , x 0
1 2
Rezolvare:
Determinm mulimea soluiilor posibile ale problemei.
Dreptele ce determin semiplanele ataate celor dou inecuaii sunt:
d1 : x1 3 x 2 = 3 , care taie axele n punctele (0, 1) i (3, 0 ) .
d 2 : 2 x1 + x 2 = 2 care taie axele n punctele (0, 2 ) i ( 1, 0 ) .
Mulimea X p a soluiilor posibile ale problemei este reprezentat
de suprafaa haurat.
x2
S3
S2
S4
O
S1
x1
(d1)
(d2)
PROBLEME REZOLVATE
S se rezolve prin dou metode problema de programare liniar:
[max ] f
= 5 x1 + 3 x2
2 x1 + x2 8
x1 + 2 x2 7
x , x 0
1 2
Rezolvare:
A. Algoritmul simplex primal
Pasul I.
a) Aducem problema la forma standard:
[max] f
= 5 x1 + 3x2 + 0 x3 + 0 x4
2 x1 + x2 + x3 = 8
x1 + 2 x2 + x4 = 7
xi 0, i = 1,4
A =
1 2 0 1
CB
a3
a4
0
0
fj
XB
8
7
0
j
a1
a2
a3
a4
2
1
0
5
1
2
0
3
1
0
0
0
0
1
0
0
8:2
7:1
0 8
f 0 = = 0 8 + 0 7 = 0 ;
0 7
0 2
f 1 = = 0 2 + 0 1 = 0 .
0 1
j se calculeaz astfel:
j = C j f j , pentru probleme de maxim;
j = f j C j , pentru probleme de minim;
{2 1}
CB
a1
a4
5
0
fj
XB
4
3
20
j
a1
a2
a3
a4
1
0
5
0
1/2
3/2
5/2
1/2
1/2
-1/2
5/2
-5/2
0
1
0
0
8
2
CB
a1
a2
5
3
fj
XB
3
2
21
j
a1
a2
a3
a4
1
0
5
0
0
1
3
0
2/3
-1/3
7/3
-7/3
-1/3
2/3
1/3
-1/3
B. Metoda grafic
Dreptele ce determin semiplanele ataate restriciilor sunt:
d1 : 2 x1 + x 2 = 8 , care taie axele n punctele (0, 8) i (4, 0) .
d 2 : x1 + 2 x 2 = 7 , care taie axele n punctele 0, 7 i (7, 0) .
( 2)
S2
C
B
S4
O
x1
A
S1
(d1)
(d2)
( 2)
( )
Avem c: f (0, 0) = 0 , f 0, 7 =
2
21 ,
2
f (3, 2) = 21 i f (4, 0) = 20 .
Prin urmare, soluia optim a problemei este: X O = (3, 2)t , f max = 21.
x1 + x2 1
x , x 0
1 2
Rezolvare:
Se aduce problema la forma standard:
[max ] f
= 5 x1 + 2 x2 + 0 x3 + 0 x4
2 x1 + 3 x2 + x3 = 6
x1 + 2 x2 x4 = 1
xi 0, i = 1,4
A =
1
1 1 0 1
din aceast cauz la restricia a doua vom aduga o variabil
artificial y .
[max ] f
= 5 x1 + 2 x2 + 0 x3 + 0 x4 My
2 x1 + 3 x2 + x3 = 6
x1 + 2 x2 x4 + y = 1
xi 0, i = 1,4
a3
a5
0
-M
fj
6
1
-M
j
a3
a1
0
5
fj
4
1
5
j
a4
a1
0
5
fj
2
6
30
j
-M
a2
a3
a4
a5
3
2
1
1
-M
-M
5+M 2+M
0
1
1
1
5
5
0
-3
0
1/2
1
3/2
5
15/2
0
-11/2
1
0
0
0
1
0
0
0
1/2
1/2
5/2
-5/2
0
-1
M
-M
2
-1
-5
5
1
0
0
0
0
1
-M
0
-2
1
5
-M-5
-1
0
0
-M
3
1
2
-
Discuie:
Dup ce algoritmul simplex a luat sfrit, dac unei variabile
artificiale i corespunde n coloana X B o valoare nenul, atunci
problema nu are soluie.
Dup ce algoritmul simplex a luat sfrit, dac toate variabilele
artificiale sunt egale cu 0, atunci decizia este optim finit, iar soluia
problemei se citete din coloana XB.
Rezultatele obinute n ultima iteraie sunt: x1 = 6 , x 2 = 0 , x3 = 0 ,
x 4 = 2 , y = 0 . Cum variabila artificial este y = 0 , rezult c
problema are soluie optim: X o = (6,0,0,2) t i f max = 30 .
PROBLEME REZOLVATE
[max] f
= 8 x1 + 5 x2 + 2 x3
x1 + x2 + x3 12
3 x + 2 x + x = 30
2
3
1
2 x + x + x 22
3
1 2
x 0, i = 1,3
i
Rezolvare:
Forma standard a problemei este:
[max ] f
= 8 x1 + 5 x2 + 2 x3 + 0 x4 + 0 x 5
x1 + x2 + x3 x4 = 12
3 x + 2 x + x = 30
2
3
1
2 x + x + x + x = 22
2
3
5
1
x 0, i = 1,5
i
1 1 1 1 0
A = 3 2 1 0 0 ;
2 1 1 0 1
0
1
Deoarece lipsesc vectorii e1 = 0 i e2 = 1 , la prima i la a
0
0
doua restricie vom aduga variabilele artificiale y1 i y 2 .
Rezult forma standard de lucru:
[max] f
= 8 x1 + 5 x2 + 2 x3 + 0 x4 + 0 x My1 My2
x1 + x2 + x3 x4 + y1 = 12
3 x1 + 2 x2 + x3 + y2 = 30
2 x + x + x + x = 22
3
5
1 2
x 0, i = 1,5
i
Tabelul simplex:
B
CB
a6
a7
a5
-M
-M
0
fj
a6
a1
a5
-M
8
0
fj
a3
a1
a5
2
8
0
fj
-M
-M
a1
a2
a3
a4
a5
a6
a7
12
30
22
1
3
2
1
2
1
-1
0
0
0
0
1
1
0
0
0
1
0
-42M
-4M
-3M
-M
-M
8+4M 5+3M
2+2M
-M
2
10
2
0
1
0
2/3 -1
1/3
0
1/3
0
0
0
1
1
0
0
-1/3
1/3
-1/3
80-2M
16 M
3
M 1
3
3
9
1
78
0
1
0
8
0
1/2
1/2
-1/2
5
0*
XB
1/3
2/3
-1/3
1
1
1
-2M
-M
2M 2
3
-M
1
0
0
2
0
-3/2
1/2
1/2
1
-1
0
3/2 -1/2
0 -1/2 1/2
1 -1/2 -1/2
0
-1
3
0 -M+1 -M-3
8 2M
3
12
10
11
3
30
6
8+ M
3
8 4M
3
6
18
-
fj
78
j
a2
a1
a5
5
8
0
fj
6
6
4
78
j
8
0
0
1
0
8
0
5
0*
1
0
0
5
0
2
0
2
-1
1
2
0
1
-1
-3
2
-1
1
-1
0
0
0
0
1
0
0
-1
3
-M+1 -M-3
3
-1
-2
1
1
-1
-1
3
-M-1 -M-3
[min ] f
= 7 x1 + 4 x2
x1 + x2 1
x1 + 2 x2 1
x , x 0
1 2
Rezolvare:
[min ] f
= 7 x1 + 4 x2 + 0 x3 + 0 x4 + My
x1 + x2 x3 + y = 1
x1 + 2 x2 + x4 = 1
xi 0, i = 1,4
B
a1
a2
a3
a4
a5
1
1
M
-1
1
1
2
-1
0
0
1
1
0
-M-7
1/2
1/2
M/3+2
-3/2
1/2
2-3M/2
-5-3M/2
XB
CB
a3
a4
M
0
fj
a1
a4
M
4
fj
-M
-M
M-4
-M
-1
0
-M
-M
-1/2
1/2
2-M/2
2-M/2
1
0
M
0
0
1
4
0
1/1
1/2
iteraie sunt: x1 = 0, x2 = 1 / 2, x3 = 0, x4 = 0, y = 1 / 2.
Deoarece variabilei artificiale y i corespunde o valoare nenul,
rezult c problema nu are soluie.
III. Probleme cu optim infinit
PROBLEME REZOLVATE
[max ] f
= 3 x1 + 5 x2
x1 3 x2 3
- 2 x1 + x2 2
x , x 0
1 2
Rezolvare:
Forma standard de lucru a problemei este:
[max ] f = 3x1 + 5 x2 + 0 x3 + 0 x4 My
x1 3 x2 x3 + y = 3
- 2 x1 + x2 + x4 = 2
xi 0, i = 1,4
B
a5
a4
CB
-M
0
fj
XB
3
2
-3M
j
a1
a4
3
0
fj
3
8
9
j
a1
a2
a3
a4
1
-2
-M
3+M
1
0
3
0
-3
1
3M
5-3M
-3
-5
-9
14
-1
0
-M
-M
-1
-2
-3
3
0
1
0
0
0
1
0
0
-M
a5
1
0
-M
0
1
2
3
-M-3
3
-
PROBLEME PROPUSE
[max] f
= 7 x1 + 8 x 2
2 x1 + x 2 5
x1 + 2 x 2 4
x ,x 0
1 2
1.
[min ] f
R: x1 = 2, x 2 = 1; f max = 22 .
= 6 x1 + 7 x 2
2.
x1 + x 2 1
x1 2 x 2 1
x ,x 0
1 2
[max ] f = 4 x1 + 6 x 2
R: x1 = 0, x 2 = 1; f min = 7 .
3.
2 x1 + 3 x 2 6
- 2 x1 + 6 x 2 3
x ,x 0
1 2
[max] f = 3x1 + 7 x 2
R: x1 = 1, x 2 = 3 ; f max = 13 .
2
4.
2 x1 + 3 x 2 6
x1 2 x 2 4
x , x 0
1 2
[max] f
5.
6.
= 2 x1 + 3 x 2
2 x1 + 5 x 2 2
2 x1 + 3 x 2 6
x ,x 0
1 2
[min ] f = 5 x1 + 2 x2
2 x1 + 3 x2 6
x1 + x2 1
x ,x 0
1 2
R: x1 = 1, x 2 = 3 ; f max = 13 .
2
2
R: x1 = 0, x2 = 1; f min = 2 .
[min] f = 3 x1 + 4 x2
7.
4 x1 7 x 2 28
5 x1 + 2 x 2 10
x , x 0
1 2
[max] f = 3 x1 + 4 x2
8.
9.
2 x1 + x2 12
x1 + 2 x2 4
x , x 0
1 2
[max] f = 3 x1 + 5 x 2
3 x1 + 2 x 2 6
2 x1 + x 2 6
x , x 0
1 2
[opt ] f = 3 x1 + 5 x2
R: x1 = 4, x2 = 4; f max = 28 .
R: x1 = 0, x2 = 3; f max = 15 .
x1 + 2 x2 8
2 x + 3x 6
10.
1
2
3 x1 + x 2 18
x1 , x 2 0
R: x1 = 4, x 2 = 6; f max = 42 dac problema este de maxim;
x1 = 3, x 2 = 0; f min = 9 dac problema este de minim.
[max] f = 2 x1 + 5 x2
11.
2 x1 + x 2 5
x1 + 4 x 2 6
x , x 0
1 2
R: x1 = 2, x2 = 1; f max = 9 .
[max] f = 2 x1 + 3 x 2
12.
5 x1 + 3 x 2 30
x1 + 3 x2 12
x , x 0
1 2
R: x1 = 9 , x2 = 5 ; f max = 33 .
2
2
2
13.
3 x1 + x3 + x4 4
2 x1 + x 2 x3 + x4 = 1
x1 + 2 x3 + 2 x 4 + x5 = 2
x 0, i = 1,5
i
R: x1 = 1 , x 2 = 0, x3 = 0, x 4 = 0, x5 = 3 ; f max = 11
2
[max] f = 5 x1 + 2 x2 + 8 x3
14.
x1 + x2 + x3 18
2 x1 + x 2 + 3 x3 = 45
x + x + 2 x 33
2
3
1
x 0, i = 1,3
i
2
2
[min] f = x1 2 x 2 + 3 x3 + 2 x 4
3 x1 + x 2 + x 4 = 2
15.
x + x + x + 2x = 3
2
3
4
1
x + x + x 1
2
4
1
x 0, i = 1,4
i
R: x1 = 1 , x2 = 1 , x3 = 2, x 4 = 0; f min = 11
2
2
2
16.
[max] f = 3 x1 + 5 x 2 + x 3 + 6 x 4
x1 + x 3 + 2 x 4 40
2 x1 + x 2 + 3x 3 16
x + x + 2 x 48
2
3
1
x 0, i = 1,4
i
[max] f = 5 x1 + 4 x 2 + 3 x3 + 2 x 4 + x5
2 x1 + x 2 + x3 + 3 x 4 + 2 x5 = 40
x1 + 2 x 2 + 3 x3 + x 4 + 3 x5 = 50
xi 0, i = 1,5
[min] f = x1 + 3x2 + 2 x3 + 5 x4 + 4 x5
3x1 + 2 x2 + x3 + 2 x4 + 3x5 = 63
x1 + 3x2 + 2 x3 + x4 + 2 x5 = 42
xi 0, i = 1,5
R: x1 = 15, x 2 = 9, x3 = 0, x 4 = 0, x5 = 0; f max = 42
19.
[min] f = 10 x1 + 5 x 2 + x3
x1 + x 2 + x3 5
2 x x
2 x3 1
1
x + 3x 2 x 4
2
3
1
x 0, i = 1,3
i
R: x1 = 0, x 2 = 14 , x3 = 11 ; f min = 81
5
[min] f = 8 x1 + 4 x 2 + 12 x3 + 6 x 4
20.
2 x1 + x 2 + 2 x3 x 4 10
x + 2 x + x + 3 x 9
2
3
4
1
x
x
x
x
2
+
+
3
+
1
2
3
4 8
x 0, i = 1,3
i
R: x1 = 1 , x 2 = 9, x3 = 0, x 4 = 0; f min = 40
2
[max] f = 9 x1 + 10 x 2 + 8 x3
21.
3 x1 x2 + x3 30
x1 + 2 x2 + 3 x3 60
2 x1 + x 2 + x3 20
x + 2 x 2 x 40
2
3
1
xi 0, i = 1,3
x1 + 2 x2 + 3 x3 5
2 x + x + x 4
22.
2
3
1
x + 2x + 2x 6
2
3
1
x 0, i = 1,3
i
R: x1 = 0, x 2 = 0, x3 = 5 ; f max = 100
3
3
23.
[min] f = 2 x1 x 2 + x 3 x 4 + 3 x 5
x1 + x 2 + x 3 x 4 + 2 x 5 12
x1 + 2 x 2 + x 3 + x 4 + x 5 = 12
3 x + x + x x x 8
2
3
4
5
1
x 0, i = 1,5
i
R: x1 = 4 , x2 = 28 , x3 = 0, x 4 = 0, x5 = 0; f min = 5
5
5
[min] f = x1 + 2 x 2 x3 + 3 x 4 + x 5
24.
2 x1 + x 2 + x3 x 4 + x5 10
x1 + 2 x 2 + 3 x3 + x 4 x5 = 12
x + x + x + x + x 14
2
3
4
5
1
x 0, i = 1,5
i
R: x1 = 0, x2 = 0, x3 = 11 , x 4 = 2, x5 = 13 ; f min = 7
2
2
[max] f = x1 + 2 x2 + 3x3 + 4 x4 + 5 x5
25. 2 x1 + 3x2 + x3 + x4 + 2 x5 = 28
3x1 + x2 + 3x3 + 2 x4 + x5 = 35
xi 0, i = 1,5
R: x1 = 0, x2 = 0, x3 = 0, x4 = 14, x5 = 7; f max = 35
26.
[min] f = x1 + 2 x 2 + 4 x3 + 2 x 4 + x5
x1 + 3 x 2 + 2 x 3 + 3 x 4 + x 5 = 2
2 x1 + x 2 + 3 x 3 + 2 x 4 + 3 x5 = 3
xi 0, i = 1,5
R: x1 = 0, x2 =, x3 = 0, x 4 = 3 , x5
7
[max] f = x1 + 2 x 2 + 3 x 3 + 4 x 4 + 5 x 5
= 5 ; f min = 11
7
7
27. 2 x1 + x 2 + 2 x3 + 3x 4 + 3x5 = 30
x1 + 2 x 2 + 2 x 3 + 2 x 4 + x 5 = 40
xi 0, i = 1,5
R: x1 = 0, x 2 = 18, x3 = 0, x4 = 0, x5 = 4; f max = 56
[min] f = 3 x1 + x2 + 5 x3 + 2 x4 + x5
28. x1 + 2 x2 + 3x3 + 2 x4 + x5 = 20
2 x1 + x2 + x3 + 3 x4 + 3 x5 = 30
xi 0, i = 1,5
R: x1 = 0, x2 = 6, x3 = 0, x 4 = 0, x5 = 8; f min = 14
[max] f = x1 2 x 2 + 3 x 3 + 2 x 4
3 x1 + x 2 + x 4 = 2
29.
x1 + x 2 + x 3 + 2 x 4 = 3
x + x + x 1
2
4
1
x 0, i = 1,4
i
R: x1 = 2 , x 2 = 0, x3 = 7 , x 4 = 0; f miax = 23 .
3
3
3
[min] f = 5 x1 + 4 x 2 + 3 x 3
x1 + x 2 + x 3 6
30.
3 x1 + 2 x 2 + x 3 2
x + x + 2x 1
2
3
1
x 0, i = 1,3
i
R: x1 = 0, x2 = 0, x3 = 6; f min = 18 ;
[max] f = 5 x1 + 6 x 2 + 7 x 3
2 x1 + x 2 + x 3 3
31.
x1 + x 2 + 3 x 3 5
x + x + 2x 4
2
3
1
x 0, i = 1,3
i
R: x1 = 0, x2 = 2, x3 = 1; f max = 19 ;
[min] f = 3 x1 2 x 2 + 7 x 3
x1 + 3 x 2 x 3 3
32.
2 x1 x 2 + 2 x 3 2
3 x + 2 x x 4
2
3
1
x 0, i = 1,3
i
R: x1 = 6 , x2 = 5 , x3 = 0; f min = 8 ;
7
7
7
[max] f = 4 x1 + 5 x 2 2 x 3
2 x1 + x 2 + x 3 6
33.
x1 + 3 x 2 + 2 x 3 4
3 x + x x 1
2
3
1
x 0, i = 1,3
i
R: x1 = 14 , x2 = 2 , x3 = 0; f max = 66 ;
5
5
5
[min] f = x1 + 3 x 2 + 2 x 3
x1 + x 2 + x 3 3
34.
2 x1 + 3 x 2 + x 3 4
x + 2 x + 3 10
2
3
1
x 0, i = 1,3
i
R: x1 = 2 , x2 = 0, x3 = 16 ; f min = 34 ;
5
5
5
[max] f = 6 x1 + 5 x 2 + 4 x 3
x1 + x 2 + 2 x 3 7
35.
x1 + x 2 + 3 x 3 5
2 x + 3 x + x 3
2
3
1
x 0, i = 1,3
i
R: x1 = 4 , x2 = 0, x3 = 13 ; f min = 4 ;
7
[min] f = x1 + 3 x 2 2 x 3
x1 + x 2 + x 3 = 2
36.
x1 + 2 x 2 + 3 x 3 5
x + x + 2 x 1
2
3
1
x 0, i = 1,3
i
R: x1 = 1 , x2 = 0, x3 = 3 ; f min = 5 ;
2
2
2
[max] f = 4 x1 + 3 x 2 + 10 x3
x1 + x 2 + 3 x3 2
37.
2 x1 + x 2 + x3 1
3 x + x + 2 x 3
2
3
1
x 0, i = 1,3
i
R: x1 = 1 , x 2 = 0, x3 = 3 ; f max = 34 ;
5
5
5
[max] f = 5 x1 + x 2 + 4 x 3
2 x1 + 3 x 2 + x 3 6
38.
x1 + 2 x 2 + 3 x 3 5
2 x + x + x 2
2
3
1
x 0, i = 1,3
i
R: x1 = 1 , x 2 = 0, x3 = 8 ; f max = 37 ;
5
5
5
[max] f = 4 x1 x 2 + 6 x 3 + 2 x 4
x1 + x 2 + x 3 + 2 x 4 = 3
39.
2 x1 + 3 x 2 + x 4 6
2 x + 2 x x 2
2
4
1
x 0, i = 1,4
i
R: x1 = 1, x 2 = 0, x3 = 2, x4 = 0; f max = 16 ;
[min] f = 3 x1 4 x 2 + x 3 + 5 x 4
x1 x 3 + 2 x 4 2
40.
2 x1 x 2 + 3 x 4 = 3
x + x 2x 1
3
4
2
x 0, i = 1,4
i
R: x1 = 0, x 2 = 9, x3 = 0, x 4 = 4; f min = 16 .
PROBLEME REZOLVATE
1. S se scrie duala urmtoarei probleme de programare liniar:
[min ] f
= 3 x1 7 x 2 + 2 x3 x 4
2 x1 + 3 x 2 + x 4 9
4x x + 2x = 2
1
2
3
3
+
+
2
x
x
x
2
3 5x4 4
1
x1 0, x 2 0, x 3 R, x 4 0
Rezolvare:
Asociem fiecrei restricii din problema primal cte o variabil:
u1 , u 2 , u3 .
[min ] f
PP :
= 3 x1 7 x 2 + 2 x3 x 4
2 x1 + 3 x 2 + x 4 9
4 x1 x 2 + 2 x3 = 2
3 x1 + x 2 + 2 x3 5 x 4 4
x 0, x 0, x R, x 0
2
3
4
1
u1
u2
u3
[max ] f
dual PD :
= 9u1 + 2u 2 + 4u 3
2u1 + 4u 2 + 3u 3 3
3u 1 u 2 + u 3 7
2u 2 + 2u 3 = 2
u 5u 1
1
3
u1 0, u 2 R, u 3 0
[max ] f
= 8 x1 + 3 x 2 + 4 x3
5 x1 + 3 x 2 + 2 x 4 9
4 x1 x 2 + 3 x3 2
6 x1 + 5 x 2 4 x3 1
3 x + x + 2 x 4
1
2
3
xi 0, i = 1,3
Rezolvare:
[max ] f
= 8 x1 + 3 x 2 + 4 x3
5 x1 + 3 x 2 + 2 x 4 9
4 x1 x 2 + 3 x3 2
6 x1 + 5 x 2 4 x3 1
3 x1 + x 2 + 2 x3 4
x 0, i = 1,3
i
PP :
u1
u2
u3
u4
[min ] f
PD :
= 9u1 + 2u 2 + u 3 + 4u 4
5u1 + 4u 2 + 6u 3 3u 4 8
3u 1 u 2 + 5u 3 + u 4 3
2u + 3u 4u + 2u 4
2
3
4
1
u 0, i = 1,4
i
[min ] f
= 30 x1 + 12 x 2 + 36 x3
x1 + 2 x 2 + x3 3
x 2 + x3 5
+ 2 x3 1
x1
2 x + x
6
2
1
xi 0, i = 1,3
[max ] f
a ) PD :
= 3u1 + 5u 2 + u 3 + 6u 4
u1 + u 3 + 2u 4 30
2u + u + u 12
2
4
1
u + u + 2u 36
2
3
1
u 0, i = 1,4
i
2
u
u
u
u
+
+
+
3
7 = 36
1 2
u 0, i = 1,7
i
CB
a5
a6
a7
0
0
0
gj
UB
a1
a2
a3
a4
a5
a6
a7
30
12
36
0
1
2
1
0
3
-3
2
1
12
-9
-3
2
4
9
-6
-1/3
2/3
4/3
31/3
-22/3
0
1
1
0
5
-2
1
1
6
-1
-2
1
3
4
1
0
0
1
5
0
2
1
0
0
6
0
1
0
6
0
0
1
0
12
0
0
1
0
6
0
1
0
0
0
1
0
0
0
1
0
0
0
0
0
0
1
-2
0
0
1
0
0
0
1
0
6
0
0
0
0
1
-2
0
0
1
0
-1
2
1
1
4
0
-1
-4
0
1/3 -2/3 0
1/3
1/3
0
-1/3 2/3 1/3
2/3 14/3 5/3
-2/3 -14/3 -5/3
j
a5
a4
a7
0
6
0
gj
6
12
36
72
j
a3
a4
a7
1
6
0
gj
6
12
30
78
j
a3
a4
a2
1
6
5
gj
26
2
10
88
j
1
0
1
0
1
1
0
1
0
1
1
0
0
6
-5
1
0
0
1
0
15
12
-
6
36
12
10
[max ] f
1.
= 5 x1 x 2 + 4 x3 + 3 x 4
4 x1 + 3 x 2 + 5 x 4 6
7 x x + 2 x = 5
1
2
3
3 x1 + x 2 + 2 x3 5 x 4 4
x1 0, x 2 0, x3 R, x 4 0
[min ]g = 6u1 + 5u 2 + 4u 3
R:
2.
4u1 + 7u 2 + 3u 3 5
PD :
3u 1 u 2 + u 3 1
2u 2 + 2u 3 = 4
5u 5u 3
3
1
u1 0, u 2 R, u 3 0
[min ] f = 3x1 7 x 2 + 2 x3 x 4
2 x1 + 3 x 2 + x 4 2
4x x + 2x 1
1
2
3
+
+
x
x
x
3
2
2
3 5x4 = 3
1
x1 0, x 2 R, x3 0, x 4 0
[max ]g = 2u1 + u 2 + 3u 3
2u1 + 4u 2 + 3u 3 3
3u u + u = 7
2
3
R: PD
1
u
u
+
3
2
2
2
3
u 5u 1
3
1
u1 0, u 2 0, u 3 R
[min ] f = 8 x1 + 6 x 2 + 3x3 x 4
3.
2 x1 + 3 x 2 + x 4 7
3 x1 + x 2 + 2 x3 5 x 4 4
x R, x 0, x 0, x 0
2
3
4
1
[max ]g = 7 x1 + 4 x 2
2u1 + 3u 2 = 8
3u + u 6
2
R: PD :
1
2u 2 3
u 5u 1
2
1
u 1 0, u 2 0
[max ] f = 2 x1 + 7 x 2 + 2 x3
2 x1 + 3 x 2 4
4x x + 2x = 2
1
2
3
x
x
x
3
3
+
+
2
3 1
1
x1 0, x 2 0, x3 R
[min ]g = 4u1 + 2u 2 + u 3
4.
R:
2u1 + 4u 2 + 3u 3 2
3u u + u 7
1
2
3
2
3
2
u
u
+
=
3
2
u1 0, u 2 R, u 3 0
[min ] f
= 5 x1 + 2 x 2 + 6 x3
x1 + 2 x 2 + x3 3
6
2 x1 + x 2
x 2 + x3 5
x
+ 2 x3 1
1
xi 0, i = 1,3
[max ]g = 3u1 + 6u 2 + 5u 3 + u 4
R: a ) PD :
u1 + 2u 2 + u 4 5
2u + u + 2u 2
2
3
1
3u + 3u + 2u 6
3
4
1
u 0, i = 1,4
i
[max ] f
= 3 x1 + 2 x 2 + 4 x3
x1 + 2 x 2 + x3 3
2 x + x
6
2
1
x 2 + x3 5
x 0, i = 1,3
i
[min ]g = 3u1 + 6u 2 + 5u 3
R: a) PD :
u1 + 2u 2 3
2u + u + u 2
2
3
1
u + u 4
3
1
u 0, i = 1,3
i
2 x1 + x 2 + 2 x3 x4 10
x + 2 x + x + 3 x 9
2
3
4
1
2 x + x + 3 x + x 8
1
2
3
4
x 0, i = 1,3
i
a) S se construiasc problema dual.
b) S se rezolve problema dual.
c) S se determine soluiile optime ale cuplului de probleme
primal-dual.
[max ]g = 10u1 + 9u 2 + 8u 3
R: a ) PD :
2u1 u 2 2u 3 8
u1 + 2u 2 + u 3 4
2u1 + u 3 + 3 x3 12
u + 3u + x 6
3
3
1
u i 0, i = 1,4
3 x1 x 2 + x3 7
x1 2 x 2 + 3 x3 3
2 x1 x2 x3 2
x + 2 x 2 x 8
2
3
1
xi 0, i = 1,3
a) S se construiasc problema dual.
b) S se determine soluiile optime ale cuplului de probleme
primal-dual.
[min ]g = 7u1 + 3u 2 + 2u 3 + 8u 4
R: a ) PD :
3u1 + u 2 + 2u 3 u 4 7
;
u1 2u 2 u 3 + 2u 4 9
u + 3u u 2u 8
2
3
4
1
u 0, i = 1,4
i
t
b) X o = 9 , 0, 4 ; f max = 95 ; U o = 0,
7
7
7
t
23 13
, ,0 ;
7 7
g max = 95 .
7
[min ] f
= 3 x1 + 2 x 2 + 4 x 3 + x 4
5 x1 + x 2 4 x 3 + 2 x 4 12
3 x x 3 x + x 9
1
2
3
4
x1 + 2 x 2 2 x 3 x 4 15
x 0, i = 1,4
i
Rezolvare:
Forma standard de lucru a problemei este:
[min ] f
= 3 x1 + 2 x 2 + 4 x 3 + x 4 + 0 x 5 + 0 x 6 + 0 x 7
5 x1 + x 2 4 x 3 + 2 x 4 + x 5 = 12
3 x x 3 x + x + x = 9
1
2
3
4
6
x
x
x
x
x
+
2
2
2
3
4
7 = 15
1
x 0, i = 1,7
i
0
0
0
Baza
a5
a6
a7
fj
XB
-12
-9
-15
0
j
a1
a2
a3
a4
a5
a6
a7
-5
-3
-1
0
-3
1
-1
2
0
-2
-4
-3
-2
0
-4
2
1
-1
0
-1
1
0
0
0
0
0
1
0
0
0
0
0
1
0
0
{1
2 1
Baza
0
0
1
a5
4
0
1
a3
a6
a4
fj
XB
-42
-24
15
15
j
a6
a4
fj
21/4
9/4
9/2
51/2
j
a1
a2
a3
a4
a5
a6
a7
-8
-5
2
2
-2
1
0
0
0
0
1
1
0
0
0
1
1
0
0
0
0
-1/8
-5/8
1/4
0
1
0
0
0
0
1
0
2
1
-1
-1
-1
-1/4
-1/4
-1/2
4
0
1
0
-1/4
-1/4
0
0
-3/2
-3/2
-7
-4
1
1
-2
7/8
3/8
5
1
-2
-2
-4
-5/8
-17/8
3/4 -3/4
11/4
-1/4
-13/4
-21/4
t
problema are soluie optim: X o = 0, 0, 21 , 9 , 0, 9 , iar valoarea
4
f min = 4 21 + 1 9 = 51 .
4
PROBLEME PROPUSE
S se rezolve urmtoarele probleme de programare liniar folosind,
acolo unde este posibil, algoritmul simplex dual:
[min] f = 3 x1 + 4 x2 + 5 x3
1. x1 2 x2 x3 2
R: X o = (0, 1, 0 )t ; f min = 4
2. x1 + 2 x 2 3x3 x 4 6
R: X o = (0, 0, 2, 0 )t ; f max = 2
2 x1 x2 3 x3 1
xi 0, i = 1,3
[max] f = x1 2 x 2 x 3 3 x 4
2 x1 x 2 x 3 2 x 4 2
x i 0, i = 1,4
[min] f = 3 x1 + x 2 + 2 x 3 + 5 x 4
3. 2 x1 + x 2 2 x 3 x 4 2
t
R: X o = 0, 4 , 7 , 0 ; f min = 18
5 5
5
x1 2 x 2 x 3 2 x 4 3
x i 0, i = 1,4
[max] f = x1 2 x 2 + 3 x 3 4 x 4 + 5 x 5
4. 2 x1 + x 2 + x 4 + x 5 = 5
x1 x 2 + x 3 3 x 4 = 4
x i 0, i = 1,5
t
R: X o = 0, 0, 11 11 , 5 11 , 11 , [0, 1] ; f max = 13
3
3
[min] f = 5 x1 + 4 x 2 + 3 x 3
2 x1 + 2 x 2 x 3 4
5.
x1 x 2 x 3 6
R: X o = (7, 5, 0 )t ; f min = 55
x x + 2 x 12
2
3
1
x 0, i = 1,3
i
[min] f = 4 x1 + 3 x 2 + 2 x 3 + x 4
6. 2 x1 x 2 x3 3x 4 = 3
x1 2 x 2 3 x 3 + x 4 = 3
xi 0, i = 1,4
t
se obine soluia optim X o = 0, 0, 6 , 3 , pentru care f min = 3 .
5 5
[max] f = 6 x1 + 3 x2 + 2 x3
7. x1 x2 2 x3 4
3 x1 x2 x3 2
xi 0, i = 1,3
[min] f = 5 x1 + 3 x 2 + 2 x 3
x1 x 2 x 3 5
8.
x1 x 2 + 2 x 3 4
2 x x x 1
2
3
1
x 0, i = 1,3
i
t
R: X o = 1 , 7 , 0 ; f max = 27 .
2 2
2
t
R: X o = 0, 14 , 1 ; f min = 44 .
3 3
3
[max] f = 3 x1 x 2 3 x3 x 4
9. x1 x 2 x3 3x 4 = 3
2 x1 2 x 2 + 3 x3 + x 4 = 3
xi 0, i = 1,4
t
folosind ASP , se obine soluia optim X o = 0, 12 , 0, 3 , pentru
care f max = 15 .
7
[opt ] f = x1 2 x 2 + 3 x 3 4 x 4
10. 2 x1 x 2 + x 3 x 4 = 4 R: Dac problema este de maxim,
x1 x 2 3 x3 x 4 = 3
xi 0, i = 1,4
X o = (3, 0, 2, 0)t , f max = 9 ; dac problema este de minim,
t
X o = 1 , 0, 0, 10 , f min = 13 .
3
3
[min] f = 8 x1 + 3 x 2
11. x1 x 2 1
x1 + 2 x 2 1
x i 0, i = 1,2
6.5. REOPTIMIZRI
PROBLEME REZOLVATE
[max ] f
= 7 x1 + 4 x 2
2 x1 + 3 x 2 9
x x 3
1
2
x + x 9
1
2
x 0, i = 1,2
i
[max ] f
= 7 x1 + 4 x 2 + 0 x 3 + 0 x 4 + 0 x 5
2 x1 +
x
1
x +
1
x 0,
i
3x 2 + 0 x3 = 9
x2 + x4 = 3
x2 +
i = 1,5
x5 = 9
0
0
0
Baza
a3
a4
a5
fj
XB
9
3
9
0
j
0
7
0
a3
a1
a5
fj
15
3
6
21
j
0
7
4
a3
a1
a2
fj
12
6
3
54
j
a1
a2
a3
a4
a5
-2
1
1
0
7
0
1
0
7
0
0
1
0
7
0
3
-1
1
0
4
1
-1
2
-7
11
0
0
1
4
0
1
0
0
0
0
1
0
0
0
0
1
0
0
0
0
0
1
0
0
0
2
1
-1
7
-7
5/2
1/2
-1/2
3/2
-3/2
0
0
1
0
0
0
0
1
0
0
-1/2
1/2
1/2
11/2
-11/2
0
4
3
Baza
a3
a1
a2
fj
XB
12
6
3
33
j
a1
a2
a3
a4
a5
1
0
0
0
0
5/2
1/2
-1/2
1/2
-1/2
-1/2
1/2
1/2
7/2
-7/2
0
1
0
4
0
0
0
1
3
0
0
5
5
Baza
a3
a1
a2
fj
XB
12
6
3
45
j
0
5
5
a4
a1
a2
fj
24/5
18/5
27/5
45
j
a1
a2
a3
a4
a5
0
1
0
5
0
0
1
0
5
0
0
0
1
5
0
0
0
1
5
0
1
0
0
0
0
2/5
-1/5
1/5
0
0
5/2
1/2
-1/2
0
0
1
0
0
0
0
-1/2
1/2
1/2
5
-5
-1/5
3/5
2/5
5
-5
CB
a3
0
1
6
a1
a2
fj
XB
12
6
3
24
j
0
1
6
a4
a1
a2
fj
24/5
18/5
27/5
36
j
a1
a2
a3
a4
a5
0
0
1
6
0
0
0
1
5
0
1
0
0
0
0
2/5
-1/5
1/5
1
-1
0
1
0
1
0
0
1
0
5
0
5/2
1/2
-1/2
-5/2
5/2*
1
0
0
0
0
-1/2
1/2
1/2
7/2
-7/2
-1/5
3/5
2/5
3
-3
~
1
1
2 = 52 0 , deci
{a3 , a1 , a 2 } , este: X B = 0
2
2
1
1
1 3
2
0 2
2
soluia optim a problemei modificate este dat de:
x3 = 92 , x1 = 52 , x 2 = 12 , x 4 = x5 = 0 , sau
~
~
X o = ( 52 , 12 , 92 ,0,0) t , f max = 7 52 + 4 12 =
39
2
~
c 2 ) b = (5,3,1) t
~
~
Dup formula X B = B 1 b avem c soluia de baz a sistemului
~
de restricii cu termenii liberi dai de b , corespunztoare bazei
{a3 , a1 , a 2 } , este:
5
12 5 12
1
2
~
1
1
X B = 0
2
2 3 = 2 , care are i o component
1
1
1 1
2
0 2
negativ; prin urmare, vom aplica n continuare algoritmul simplex
dual.
CB
0
7
4
Baza
a3
a1
a2
fj
XB
12
2
-1
10
j
0
7
0
a3
a1
a4
fj
7
1
2
7
j
a1
a2
a3
a4
a5
0
0
1
4
0
5
1
-2
7
-3
1
0
0
0
0
1
0
0
0
0
0
1
0
7
0
0
1
0
7
0
5/2
1/2
-1/2
3/2
-3/2
0
0
1
0
0
-1/2
1/2
1/2
11/2
-11/2
2
1
-1
7
-7
PROBLEME PROPUSE
1. Se consider problema de programare liniar:
[max ] f
= 5 x1 + 9 x 2
3 x1 + 2 x 2 12
- x + x 8
2
1
x + x 6
2
1
x 0, i = 1,2
i
(5 5 )
[min ] f
= 5 x1 + 3 x 2
4 x1 + 3 x 2 24
x x 3
2
1
x + x 9
1
2
x 0, i = 1,2
i
PROBLEME REZOLVATE
[min ] f
= 5 x1 + 4 x2 + 6 x3
x1 + 3 x2 + x3 6
2 x + x + 2 x 12
2
3
1
3 x + x + 2 x 24
2
3
1
x 0, i = 1,3
i
Rezolvare:
[min ] f
CB
M
M
M
5
M
M
5
0
M
Baza
a7
a1
a2
a3
a4
a5
a6
a7
a8
a9
0
-1
0
0
0
-1
1
0
0
0
1
0
0
0
1
a9
1 2
2
1
3
1
1 -1
2 0
2 0
fj
42M
6M
5M
-M
-M
-M
-M
-M
a9
6
0
6
1
0
0
2 1 -1 0
-3 0 2 -1
-5 -1 3 0
0
0
-1
1
-2
-3
0
1
0
0
0
1
fj
6M+30
-M
-5M+5
0 -8M+6
-M
-6M+5
6
0
6
1 1/2 1
0 -3/2 0
0 -1/2 -1
1/2
1/2
-3/2
0
0
1
6M+30
5 -M/2+5/2 -M+5 0
3M/2-5/2 -M
-M
8
2
4
40
1 1/3 2/3 0
0 -5/3 -1/3 1
0 -1/3 -2/3 0
0 -1/3 0
0 -1/3 -1
1 -2/3 0
5/3
10/3
-7/3
-8/3
a1
a8
a1
a4
a9
fj
a1
a4
a5
fj
6
12
24
a8
5
0
0
XB
4M
-M-1 5M-5 -M
0 -1/2 0 0
1 -1/2 0 -1
0 3/2 -1 0
-5/3
-5/3
1/3
1/3
2/3
5/3
-M 5/3 -M
[max]g = 6 y1 + 12 y 2 + 24 y 3
y1 + 2y 2 + 3 y 3 5
2 y + y + y 4
2
3
1
y + 2y + 2 y 6
2
3
1
y 0, i = 1,3
i
0
0
-1
0
-M
6
6
8
-3M/2+5/2 M
-5M/2+5/2
0
2
6
18
-
[max ]g = 6 y1 + 12 y 2 + 24 y 3 + 0 y 4 + 0 y 5 + 0 y 6
y1 + 2y 2 + 3 y 3 + y 4 = 5
2 y + y + y + y = 4
2
3
5
1
y1 + 2y 2 + 2 y 3 + y 6 = 6
y 0, i = 1,6
i
0
0
0
Baza
a4
a5
a6
fj
YB
5
4
6
0
j
24
0
0
a3
a5
a6
fj
5/3
7/3
8/3
40
j
12
24
a1
a2
a3
a4
a5
a6
1
2
1
0
6
1/3
5/3
1/3
8
-2
2
1
2
0
12
2/3
1/3
2/3
16
-4
1
0
0
0
0
1/3
-1/3
-2/3
8
-8
0
1
0
0
0
0
1
0
0
0
0
0
1
0
0
0
0
1
0
0
3
1
2
0
24
1
0
0
24
0
5/3
4
3
0
2
[min ] f
= 5 x1 + 4 x 2 + 6 x 3
x1 3 x 2 x 3 6
- 2 x x 2 x 12
1
2
3
3 x x 2 x 24
1
2
3
x 0, i = 1,3
i
[min ] f
= 5 x1 + 4 x 2 + 6 x3 + 0 x 4 + 0 x5 + 0 x 6
x1 3 x 2 x3 + x 4 = 6
- 2 x x 2 x + x = 12
1
2
3
5
+
3
2
x
x
x
x
1
2
3
6 = 24
x 0, i = 1,6
i
0
0
0
Baza
a4
a5
a6
fj
XB
-6
-12
-24
0
j
0
0
5
a4
a5
a1
fj
2
4
8
40
j
a1
a2
a3
a4
a5
a6
0
1
0
0
0
0
1
0
0
0
0
0
1
0
0
-1/3
-2/3
-1/3
-5/3
-5/3
-1
-2
-3
0
-5
0
0
1
5
0
-2
-1
-1
0
-4
-5/3
-1/3
1/3
5/3
-7/3
-1
-2
-2
0
-6
-1/3
-2/3
2/3
10/3
-8/3
1
0
0
0
0
1
0
0
0
0
PROBLEME PROPUSE
[min] f = 5 x1 9 x 2
2x x 4
2. 1 2
x1 + 3 x 2 3
x , x 0
1 2
[max] f = 4 x1 + 3 x 2
3.
2 x1 + x 2 5
x1 + 2 x 2 4
x , x 0
1 2
[min] f = 4 x1 + x 2
3 x 2 x 2 12
4. 1
x1 + x 2 5
x , x 0
1 2
R: X o = (22, 27 )t ; f min = 61 .
[max] f = 3 x1 + 4 x 2
5. 2 x1 + x 2 12
x1 + 2 x 2 4
x , x 0
1 2
[min] f = 3 x1 + 8 x 2
6. 3x1 2 x 2 3
x1 + x 2 2
x , x 0
1 2
[max] f = 7 x1 x 2
7. 3 x1 + x 2 6
x1 + 2 x 2 4
x , x 0
1 2
[max] f = 3x1 + 5 x2
x1 + 2 x 2 8
8. 2 x1 + 3 x2 6
3x1 + x2 18
x1,2 0
R: X o = (4, 6 )t ; f max = 42 .
[min] f = 3 x1 + 2 x 2 + x3
2 x1 + x 2 + 3 x3 = 6
9. x1 + x 2 + x3 3
R: X o = (2, 2, 0 )t ; f max = 10 .
x + x + 2x 4
2
3
1
x 0, i = 1,3
i
[min] f = 6 x1 x 2 + 5 x3
x1 + x3 + 2 x 4 2
10. 2 x1 x 2 = 4
x + x x 1
3
4
2
x 0, i = 1,4
i
[min] f = 2 x1 x 2 + 2 x3
x1 + x 2 + x3 2
11. x 2 x + x 3
2
3
1
x + x 2x 3
2
3
1
x 0, i = 1,3
i
[min] f = 4 x1 3 x 2 + x3
x1 + x 2 + x3 4
12. 2 x x + 3x = 4
R: X o = (0, 11, 5)t ; f min = 28 .
2
3
1
x1 x 2 + 2 x3 1
x 0, i = 1,3
i
[max] f = 2 x1 + 8 x 2 + 5 x3
x1 + 3 x 2 + 2 x3 = 30
13. x + 2 x + x 22
2
3
1
x1 + x 2 + x3 12
x 0, i = 1,3
i
R: X o = (3 , 6 + 3 , 6 6 )t , [0,1] ; f max = 78 .
[max] f = x1 + 2 x 2 + 4 x3
x1 + 2 x 2 6
14. 2 x1 + x 2 + x3 6
x + 2x 5
3
1
x 0, i = 1,3
i
t
R: X o = 0, 3, 5 ; f max = 16 .
2
[min] f = 3 x1 + 2 x 2 + 4 x3
2 x1 + x3 1
15. x + 3 x x 3
2
3
1
x + 2x 4
3
2
x 0, i = 1,3
i
PROBLEME REZOLVATE
1. Un produs trebuie transportat de la furnizorii F1 , F2 ctre
beneficiarii B1 , B2 , B3 . Cantitile de care dispun cei trei furnizori,
necesarul fiecrui beneficiar i costurile unitare de transport sunt
date n tabelul urmtor:
F1
F2
Necesar
B1
3
4
40
B2
2
5
50
B3
2
6
40
Disponibil
60
70
20
30
40
u1 =0
v1 =
v2 =
v3 =
2
5
u2 =
u 2 + v 2 = 5
u2 = 3 .
v2 = 2
u1 + v 2 = 2
v2 = 2 ;
u1 = 0
u2 + v3 = 6
v3 = 3 .
u2 = 3
u1 =0
u2 =3
v1 =3
v2 =2
v3 =3
3
6
2
5
3
6
Toate calculele din etapa III .2) se pot sintetiza n urmtorul tabel:
v1 =3
v2 =2
v3 =3
u1 =0
u2 =3
X0
40
+
20
30
-
40
ij = C ij C ij
v2 =2
v3 =5
u1 =0
u2 =1
-2
v1 =0
v2 =2
v3 =2
u1 =0
-3
u2 =4
v1 =1
v2 =2
v3 =2
1
4
2
5
2
5
X1
10
30
+
50
40
X2
40
50
+
10
30
-
X3
40
20
30
40
u1 =0
u2 =3
ij = C ij C ij
ij = C ij C ij
ij = C ij C ij
-2
0
0
0
0
-1
40
40
B1
4
2
1
1
5
7
B3
3
6
4
70
80
50
Disponibil
60
40
100
Rezolvare:
Etapa 1. Se observ c problema este echilibrat.
a)
f 0 = 960
u .m .
30
50
50
60
20
50
f 2 = 470
u .m .
60
20
-
20
30
f 3 = 470
70
u .m .
60
20
-
20
30
v2 =1
v3 =2
u1 =0
-1
-5
-1
u2 =4
u3 =2
-4
X0
60
+
70
-
20
20
30
+
ij = C ij C ij
Etapa IV.
X1
20
50
60
20
u1 =0
u2 =4
50
u3 =3
v1 =-2
v2 =1
v3 =1
-2
2
1
1
5
4
1
5
4
ij = C ij C ij
-6
0
0
0
0
-3
-2
-1
0
X O:
60
20
20
50
50
F1
F2
Necesar
B1
1
2
24
3
1
12
Disponibil
B3
2
3
36
42
30
Rezolvare:
Etapa 1. Se observ c problema este echilibrat.
Etapa II. Determinm o soluie iniial de baz.
a) Prin metoda colului de nord-vest rezult soluia X 0 :
24
-
f 0 = 162
b)
12
-
6
30
u .m .
f 1 = 126
12
18
18
u .m .
v2 =0
v3 =2
u1 =0
-3
u2 =1
X1
24
12
+
18
18
-
ij = C ij C ij
36
12
B1
5
2
40
1
6
50
Disponibil
B3
3
4
60
30
80
Rezolvare:
Etapa I. Problema este neechilibrat (D < N ) .
Pentru echilibrare se introduce un furnizor fictiv, avnd
disponibilul egal cu N D = 40 i costurile unitare de transport
nule. Obinem problema:
B1
F1
F2
F3
5
2
0
1
6
0
B3
3
4
0
Necesar
40
50
60
Disponibil
30
80
40
Etapa II. Determinm cte o soluie iniial de baz prin cele patru
metode.
a ) Prin metoda colului de nord-vest rezult soluia X 0 :
30
10
-
f 0 = 550
u .m .
50
-
20
60
f 1 = 270
40
u .m .
30
20
40
20
30
20
-
20
40
f 2 = 310 u . m .
d ) Prin metoda costului minim n tabel obinem soluia X3 :
70
60
20
-
20
30
f 3 = 470 u . m .
Alegem X1 drept soluie iniial de baz.
Etapa III. Aceast soluie este nedegenerat, rmne s verificm
optimalitatea.
v1 =-1
v2 =1
v3 =1
-1
2
-2
1
4
0
1
4
0
ij = C ij C ij
X1
40
-
30
20
40
20
u1 =0
u2 =3
u3 =-1
-6
0
-2
30
20
40
20
0
-2
0
-2
0
0
B1
7
5
12
3
6
24
B3
6
4
18
Disponibil
24
30
Rezolvare:
Etapa 1. Se observ c problema este echilibrat.
24
-
18
B1
7
5
12
B2
3
4
24
B3
6
6
18+2
Disponibil
24+
30+
24
-
18+
12
24
-
u1 =0
18+
u2 =0
v1 =5
v2 =3
v3 =6
5
5
3
3
6
6
ij = C ij C ij
-2
0
0
-1
0
0
18
B1
3
4
2
B2
5
4
6
B3
5
7
7
5
20
6
70
6
70
9
7
5
8
70
Disponibil
30
60
50
90
Rezolvare:
Etapa I. Avem D = N = 230 u.m. , deci problema este echilibrat.
Etapa II. Determinm o soluie de baz prin metoda costului
minim pe coloan i obinem X 0 :
20
-
10
60
-
20
50
30
40
v1 = 4
v2 = 5
v3 = 5
v4 = 7
u1 = 0
-2
u 2 = 1
-1
-3
-1
u 3 = 2
-3
-4
u4 = 1
X0
+
10
20
60
20
50
+
+
30
40
-
ij = C ij C ij
10
60
50
20
70
10
60
50
20
70
10
60
u1 = 0
u 2 = 1
70
50
u3 = 2
20
u4 = 1
v1 = 3
v2 = 5
v3 = 5
v4 = 7
3
2
1
4
5
4
3
6
5
4
3
6
7
6
5
8
ij = C ij C ij
0
-2
-1
-1
0
0
-3
0
0
-3
-4
0
-2
-1
0
0
10
60
50
20
70
PROBLEME PROPUSE
B1
4
5
50
3
6
60
B3
3
7
50
Disponibil
Disponibil
80
80
R: X :
30
30
50
50
2.
B1
F1
F2
F3
4
7
1
6
5
2
B3
3
1
4
Necesar
100
40
60
50
80
70
R: X o :
50
20
20
50
60
3.
B1
F1
F2
F3
6
4
2
8
5
7
B3
3
1
9
Necesar
70
80
50
B1
4
2
1
1
5
7
B3
3
6
4
70
20
50
Disponibil
60
40
100
R: X :
10
40
30
70
50
4.
F1
F2
F3
Necesar
R: X :
20
70
40
10
40
20
Disponibil
60
40
100
5.
B1
F1
F2
F3
Necesar
5
3
2
2
6
8
B3
4
7
5
10
Disponibil
8
6
12
R: X :
8
2
9
4
3
f min = 89 u.m.
6.
F1
F2
F3
Necesar
B1
3
4
9
8
5
7
B3
3
6
4
60
80
50
Disponibil
60
40
60
X :
60
40
10
30
50
7.
B1
F1
F2
F3
5
1
7
2
4
1
B3
6
3
4
Necesar
80
70
50
Disponibil
40
60
100
R: X o :
20
60
20
50
50
8.
B1
F1
F2
F3
2
3
1
4
3
5
B3
4
6
6
F4
4
10
5
60
5
60
Necesar
Disponibil
20
7
6
4
50
40
7
60
80
R: X o :
10
10
10 10
50
10 10
50 + 10
40
20
9.
B1
F1
F2
F3
7
1
2
3
4
6
B3
5
6
1
F4
5
30
9
55
7
70
Necesar
Disponibil
30
8
7
5
60
50
4
60
80
R: X :
25 + 5
30
30 5
5 5
5
50
15
60
10.
B1
F1
F2
F3
1
4
2
4
2
5
B3
5
7
3
F4
4
90
6
70
6
65
Necesar
9
7
5
8
70
Disponibil
20
55
40
90
R: X o :
20
55
40
70
15
20 15
15 15
5 + 15
70
F1
F2
F3
6
4
2
5
3
6
B3
4
7
7
F4
4
25
6
70
3
90
Necesar
20
25
30
70
5
9
5
5
8
85
R: X o :
15
50
55
Disponibil
35
50
55
70
12.
B1
F1
F2
F3
3
8
5
2
4
6
B3
6
2
7
F4
Necesar
1
20
6
40
4
95
F1
F2
F3
B1
2
4
2
B2
6
4
6
B3
5
7
1
3
35
2
65
6
70
5
7
6
3
60
Disponibil
80
35
50
20
13.
F4
Necesar
9
4
5
8
80
Disponibil
30
55
70
90