Documente Academic
Documente Profesional
Documente Cultură
Lucrare2022FIEB (FR)
Lucrare2022FIEB (FR)
3 x1 + x2 − 8 x3 + 2 x4 + x5 = 0, 7 x1 + 2 x2 − x3 − 2 x4 + 2 x5 = 0,
1. 2 x1 − 2 x2 − 3 x3 − 7 x4 + 2 x5 = 0, 2. x1 − 3 x2 + x3 − x4 − x5 = 0,
x + 11x − 12 x + 34 x − 5 x = 0. 2 x + 5 x + 2 x + x + x = 0.
1 2 3 4 5 1 2 3 4 5
x1 + x2 + 10 x3 + x4 − x5 = 0, 6 x1 − 9 x2 + 21x3 − 3 x4 − 12 x5 = 0,
3. 5 x1 − x2 + 8 x3 − 2 x4 + 2 x5 = 0, 4. −4 x1 + 6 x2 − 14 x3 + 2 x4 + 8 x5 = 0,
3x − 3 x − 12 x − 4 x + 4 x = 0. 2 x − 3 x + 7 x − x − 4 x = 0.
1 2 3 4 5 1 2 3 4 5
2 x1 − x2 + 2 x3 − x4 + x5 = 0, 5 x1 − 2 x2 + 3 x3 − 4 x4 − x5 = 0,
5. x1 + 10 x2 − 3 x3 − 2 x4 − x5 = 0, 6. x1 + 4 x2 − 3 x3 + 2 x4 − 5 x5 = 0,
4 x + 19 x − 4 x − 5 x − x = 0. 6 x + 2 x − 2 x4 − 6 x5 = 0.
1 2 3 4 5 1 2
12 x1 − x2 + 7 x3 + 11x4 − x5 = 0, x1 + 2 x2 + x3 + 4 x4 + x5 = 0,
7. 24 x1 − 2 x2 + 14 x3 + 22 x4 − 2 x5 = 0, 8. 2 x1 − x2 + 3 x3 + x4 − 5 x5 = 0,
x + x + x − x + x = 0. x + 3 x − x − 6 x − x = 0.
1 2 3 4 5 1 2 3 4 5
2 x1 − x2 + 3 x3 − x4 − x5 = 0, 8 x1 + x2 + x3 − x4 + 2 x5 = 0,
9. x1 + 5 x2 − x3 + x4 + 2 x5 = 0, 10. 3 x1 − 3 x2 − 2 x3 + x4 − 3 x5 = 0,
x + 16 x − 6 x + 4 x + 7 x = 0. 5 x + 4 x + 3 x − 2 x + 5 x = 0.
1 2 3 4 5 1 2 3 4 5
1
2. x = 6, 12, −1 , p = 1, 3, 0 , q = 2, −1, 1 , r = 0, −1, 2.
punctele A1 , A2 , A3 , A4 .
1. z = 2 x + 8 y − x 2 − 2 y 2 ; 2. z = 3x + 6 y − x 2 − xy − y 2 ; 3. z = x3 − 2 y 2 − 3x + 8 y ;
4. z = x 2 − 2 xy + 4 y 3 ; 5. z = y 3 − 3x 2 − 27 y + 12 x ; 6. z = x 2 − 4 xy + 8 y 3 ;
10. z = x 2 + 2 xy − y 2 − 4 x .
3
7 F( x ) = 3x 1 + 2 x 2 → max 8 F( x ) = 3x 1 + x 2 → max
x 1 1 x 1 1
8x 1 − 2 x 2 −8 2 x 1 + x 2 8
x 2 2 x − x 4
2 1 2
1 2 3 4
9 F( x ) = 4 x 1 + 5x 2 → max 10 F( x ) = 3x 1 − 7 x 2 → min
x 2 5 x 1 + x 2 1
x 1 − 2 x 2 −2 x 1 − 2 x 2 −2
6 x − 2 x 6 3x − x 6
1 2 1 2
4
7 F( x ) = 3x 1 + 2 x 2 → max 8 F( x ) = 4x 1 + x 2 → max
x 1 + 3x 2 15 3x 1 + 5x 2 30
5x + x 15 5x + 3x 30
1 2 1 2
x 1 − x 2 1 x 1 − x 2 2
x 1 0, x 2 0 x 1 0, x 2 0
9 F( x ) = x 1 + 4x 2 → max 10 F( x ) = 2 x 1 + 4 x 2 → max
3x 1 + 5x 2 30 2x 1 + 5x 2 30
5x + 3x 30 5x + 2x 30
1 2 1 2
x 1 − x 2 1 x 1 − x 2 2
x 1 0, x 2 0 x 1 0, x 2 0
7. Se dă o problemă a transportului. Se cere: 1) să se completeze tabelul pentru
PT; 2) să se determine un program de bază X 0 prin metoda colțului Nord-
Vest; 3) să se determine un program de bază X * prin metoda costurilor
unitare minime; 4) să se determine un program optim pornind de la
programul X 0 .
Valorile numerice ale parametrilor problemei sunt date pe variante:
n
1 c11 = 2, c12 = 12, c13 = 4, c14 = 2, b1 = 120, b2 = 80, a1 = 130, a2 = 150,
c21 = 7, c22 = 3, c23 = 9, c24 = 13, b3 = 110,b 4 = 90; a3 = 120;
c31 = 9, c32 = 8, c33 = 11, c34 = 5;
5
4 c11 = 7, c12 = 10, c13 = 12, c14 = 3, b1 = 70, b2 = 110, a1 = 130, a2 = 140,
c21 = 4, c22 = 9, c23 = 14, c24 = 15, b3 = 90,b 4 = 130; a3 = 130;
c31 = 12, c32 = 8, c33 = 15, c34 = 7;
6
4) m=7, r=6; 5) m=8, r=4; 6) m=4, r=5;
7) m=5, r=6; 8) m=6, r=3; 9) m=7, r=5;
10) m=8, r=6;