Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
0 of .
Results for:
P. 1
ALL Tehnici de Optimizare Grile RASPUNSURI

# ALL Tehnici de Optimizare Grile RASPUNSURI

Ratings: (0)|Views: 76|Likes:

### Availability:

See more
See less

12/28/2012

pdf

text

original

1
Tehnici de optimizareProgramare liniara
MULTIPLE CHOICE
1.
Fie problema de programare liniara:
123123123123
[max]51020235242260,1,3
i
f x x x x x x x x x x x x x i
= + ++ + + + + + =
Sa se aduca la forma standard pentru simplex.
a.
123123412351236
[max]51020235242260,1,6
i
f x x x x x x x x x x x x x x x x i
= + ++ + + + + + ≤+ + + =
b.
[max]
f
=
5
x
1
+
10
x
2
+
20
x
3
+
0
x
4
+
0
x
5
+
0
x
6
x
1
+
2
x
2
+
3
x
3
+
x
4
=
52
x
1
+
x
2
+
x
3
+
x
5
=
4
x
1
+
2
x
2
+
2
x
3
+
x
6
=
6
Ï  Ì  Ó  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô
x
i
0,
i
=
1,6
c.
123123412351236
[max]51020235242260,1,6
i
f x x x x x x x x x x x x x x x x i
= + ++ + =+ + − =+ + ==
d.
123456123412351236
[max]51020235242260,1,6
i
f x x x Mx Mx Mx x x x x x x x x x x x x x i
= + + + + ++ + + =+ + + =+ + + ==

22. Fie problema de programare liniara
123123123123
[max]51020235242260,1,3
i
f x x x x x x x x x x x x x i
= + ++ + + + + + =
Prima iteratie a algoritmului simplex este51020000
B
B
B
a
1
a
2
a
3
a
4
a
5
a
6
0
a
4
51231000
a
5
42110100
a
6
6122001
f
j
000000
j
=
c
j
j
51020000Pivotul se afla pe linia corespunzatoare luia.
a
4
b.
a
5
c.
a
6
3. Fie problema de programare liniara
123123123123
[max]51020235242260,1,3
i
f x x x x x x x x x x x x x i
= + ++ + + + + + =
Prima iteratie a algoritmului simplex este51020000
B
B
B
a
1
a
2
a
3
a
4
a
5
a
6
0
a
4
51231000
a
5
42110100
a
6
6122001
f
j
000000
j
=
c
j
j
51020000Stabiliti care este vectorul care iese, respectiv vectorul care intra in bazaa.intra
a
3
, iese
a
4
b.intra
a
3
, iese
a
5
c.intra
a
3
, iese
a
6
d.intra
a
1
, iese
a
6
e.intra
a
1
, iese
a
5

34. Fie problema de programare liniara
123123123123
[max]51020235242260,1,3
i
f x x x x x x x x x x x x x i
= + ++ + + + + + =
Care este solutia optima pentru problema de programare liniara?a.
max
f
=
103
,
x
o
=
0,0,53
ÊËÁÁÁÁÁÁÁˆ¯˜˜˜˜˜˜˜
,
y
o
=
0,73,83
ÊËÁÁÁÁÁÁÁˆ¯˜˜˜˜˜˜˜
b.
max
f
=
1003
,
x
o
=
0,0,53
ÊËÁÁÁÁÁÁÁˆ¯˜˜˜˜˜˜˜
,
y
o
=
0,73,83
ÊËÁÁÁÁÁÁÁˆ¯˜˜˜˜˜˜˜
c.
max
f
=
1003
,
x
o
=
0,73,83
ÊËÁÁÁÁÁÁÁˆ¯˜˜˜˜˜˜˜
,
y
o
=
0,0,53
ÊËÁÁÁÁÁÁÁˆ¯˜˜˜˜˜˜˜
d.alt raspuns5. Fie problema de programare liniara
[max]
f
=
7
x
1
+
8
x
2
2
x
1
+
x
2
5
x
1
+
2
x
2
4
Ï  Ì  Ó  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô
x
1
,
x
2
0
Forma standard pentru simplex a problemei de programare liniara estea.
[max]
f
=
7
x
1
+
8
x
2
2
x
1
+
x
2
+
y
1
=
5
x
1
+
2
x
2
y
2
=
4
Ï  Ì  Ó  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô
x
1
,
x
2
0,
y
1
,
y
2
0
c.
[max]
f
=
7
x
1
+
8
x
2
+
My
1
+
My
2
2
x
1
+
x
2
+
y
1
=
5
x
1
+
2
x
2
+
y
2
=
4
Ï  Ì  Ó  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô
x
1
,
x
2
0,
y
1
,
y
2
0
b.
[max]
f
=
7
x
1
+
8
x
2
+
0
y
1
+
0
y
2
2
x
1
+
x
2
+
y
1
=
5
x
1
+
2
x
2
+
y
2
=
4
Ï  Ì  Ó  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô
x
1
,
x
2
0,
y
1
,
y
2
0
d.
[max]
f
=
7
x
1
+
8
x
2
My
1
My
2
2
x
1
+
x
2
+
y
1
=
5
x
1
+
2
x
2
+
y
2
=
4
Ï  Ì  Ó  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô  Ô
x
1
,
x
2
0,
y
1
,
y
2
0