|
Исследование операций и Теория систем
|
bi
|
x11
|
x12
|
x13
|
x21
|
y2
|
x23
|
|
|
-150
|
|
23
|
|
-5
|
|
7/5
|
|
58
|
|
-10
|
|
19/5
|
|
|
|
|
-228/5
|
|
0
|
|
0
|
|
-19/5
|
|
0
|
|
0
|
|
-19/5
|
|
y1
|
8
|
|
1
|
|
0
|
|
0
|
|
1
|
|
0
|
|
0
|
|
|
|
|
0
|
|
0
|
|
0
|
|
0
|
|
0
|
|
0
|
|
0
|
|
x22
|
15
|
|
0
|
|
1
|
|
0
|
|
0
|
|
1
|
|
0
|
|
|
|
|
0
|
|
0
|
|
0
|
|
0
|
|
0
|
|
0
|
|
0
|
|
y3
|
12
|
|
0
|
|
0
|
|
1
|
|
0
|
|
0
|
|
1
|
|
|
|
|
12
|
|
0
|
|
0
|
|
1
|
|
0
|
|
0
|
|
1
|
|
y4
|
-20000
|
|
-45
|
|
-7
|
|
-4
|
|
0
|
|
0
|
|
0
|
|
|
|
|
0
|
|
0
|
|
0
|
|
0
|
|
0
|
|
0
|
|
0
|
|
y5
|
-29895
|
|
0
|
|
7
|
|
0
|
|
-45
|
|
7
|
|
-4
|
|
|
|
|
48
|
|
0
|
|
0
|
|
4
|
|
0
|
|
0
|
|
4
|
|
|
|
bi
|
x11
|
x12
|
x13
|
x21
|
y2
|
y3
|
|
|
-978/5
|
|
23
|
|
-5
|
|
-12/5
|
|
58
|
|
-10
|
|
-19/5
|
|
|
|
|
464
|
|
-58
|
|
0
|
|
0
|
|
-58
|
|
0
|
|
0
|
|
y1
|
8
|
|
1
|
|
0
|
|
0
|
|
1
|
|
0
|
|
0
|
|
|
|
|
8
|
|
1
|
|
0
|
|
0
|
|
1
|
|
0
|
|
0
|
|
x22
|
15
|
|
0
|
|
1
|
|
0
|
|
0
|
|
1
|
|
0
|
|
|
|
|
0
|
|
0
|
|
0
|
|
0
|
|
0
|
|
0
|
|
0
|
|
x23
|
12
|
|
0
|
|
0
|
|
1
|
|
0
|
|
0
|
|
1
|
|
|
|
|
0
|
|
0
|
|
0
|
|
0
|
|
0
|
|
0
|
|
0
|
|
y4
|
-20000
|
|
-45
|
|
-7
|
|
-4
|
|
0
|
|
0
|
|
0
|
|
|
|
|
0
|
|
0
|
|
0
|
|
0
|
|
0
|
|
0
|
|
0
|
|
y5
|
-29847
|
|
0
|
|
7
|
|
4
|
|
-45
|
|
7
|
|
4
|
|
|
|
|
360
|
|
45
|
|
0
|
|
0
|
|
45
|
|
0
|
|
0
|
|
|
|
bi
|
x11
|
x12
|
x13
|
y1
|
y2
|
y3
|
|
|
1342/5
|
|
-35
|
|
-5
|
|
-12/5
|
|
-58
|
|
-10
|
|
-19/5
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
x21
|
8
|
|
1
|
|
0
|
|
0
|
|
1
|
|
0
|
|
0
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
x22
|
15
|
|
0
|
|
1
|
|
0
|
|
0
|
|
1
|
|
0
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
x23
|
12
|
|
0
|
|
0
|
|
1
|
|
0
|
|
0
|
|
1
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
y4
|
-20000
|
|
-45
|
|
-7
|
|
-4
|
|
0
|
|
0
|
|
0
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
y5
|
-29487
|
|
45
|
|
7
|
|
4
|
|
45
|
|
7
|
|
4
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Ответ: Задача не имеет допустимого решения
Задача 2
№ вар
|
с1
|
с2
|
с3
|
с4
|
с5
|
с6
|
b1
|
b2
|
b3
|
Знаки ограничений
|
a11
|
a12
|
a13
|
a14
|
|
|
|
|
|
|
|
|
|
|
|
1
|
2
|
3
|
|
|
|
|
|
8
|
2
|
6
|
2
|
-2
|
2
|
0
|
2
|
6
|
1
|
=
|
=
|
=
|
-1
|
2
|
1
|
0
|
|
№ вар.
|
a15
|
a16
|
a21
|
a22
|
a23
|
a24
|
a25
|
a26
|
a31
|
a32
|
a33
|
a34
|
a35
|
a36
|
Тип экстр.
|
|
8
|
0
|
0
|
2
|
1
|
1
|
1
|
2
|
0
|
1
|
-1
|
0
|
0
|
1
|
0
|
max
|
|
|
1. Основная задача линейного программирования:
Правую часть уравнений (ограничения и целевую функцию) представляем в виде разности между свободным членом и суммой всех остальных:
2. Составим симплекс - таблицу:
|
bi
|
x1
|
x2
|
|
|
2
|
|
-4
|
|
-6
|
|
|
|
|
|
|
|
|
|
|
x3
|
2
|
|
-1
|
|
2
|
|
|
|
|
|
|
|
|
|
|
x4
|
2
|
|
1
|
|
1
|
|
|
|
|
|
|
|
|
|
|
x5
|
1
|
|
1
|
|
-1
|
|
|
|
|
|
|
|
|
|
|
|
Страницы: 1, 2, 3, 4
|
|
|