Добавил:
Upload Опубликованный материал нарушает ваши авторские права? Сообщите нам.
Вуз: Предмет: Файл:
Полшков Ю.Н. Задания по ОММ.doc
Скачиваний:
11
Добавлен:
08.08.2019
Размер:
481 Кб
Скачать
☆

Задание 4. Метод искусственного базиса

Решить методом искусственного базиса задачу линейного программирования. Соста-

вить математическую модель двойственной задачи.

1.

z = 3x1 + 3x2 + 2x3 → max,

2.

z = x1 + x2 + x3 → min,

z = x1 +

3.

x2 +

x3 → min,

⎧ 2x1 + x2

⎪

= 2,

⎧x1 + x2 + x3 = 3,

⎩

⎪

⎧2x1 + 2 x2 + 3x3

⎩

⎪

≥ 6,

⎨− 2x1 +

x2 +

x3 ≥ 2,

⎨x1 − x2 + x3 ≥ 1,

⎨3x1 + 3 x2 + 2x3 ≥ 6,

⎩

⎪ x1 −

x2 + 2x3 ≤ 4,

⎪ x2

+ x3

≤ 1,

⎪ x1 +

x2 +

x3 ≥ 5,

x j ≥ 0

( j = 1,2,3).

x j ≥ 0

( j = 1,2,3).

x j ≥ 0

( j = 1,2,3).

4. 5. 6.

z = 4 x1 + x2 +

3x3 → max,

z = 4x1 +

2x2 +

5x3 → max,

z = 4x1 +

2x2 +

5x3 → max,

⎧4 x1 − x2 − 2 x3 = 3,

⎪

⎧3x1 + 2x2 −

⎨

x3 = 4,

⎧x1 + 2x2 −

⎨

x3 = 4,

⎨3x1

− x2 +

x3 ≤ 12,

⎩ x2 − 3x3 ≤ −3,

⎩ x2 − 3x3 ≤ −3,

⎩

⎪ x1 +

3x2 + x3 ≥ 4,

x j ≥ 0

( j = 1,2,3).

x j ≥ 0

( j = 1,2,3).

x j ≥ 0

( j = 1,2,3).

7.

z = −5x1 + x2 + x3 → min,

8.

z = −3x1 + 2x2 + x3 → max,

9.

z = − x1 + x2 − x3 + x4 + x5 → min,

⎧2 x +

2 x + x

= 6,

⎧ x1 + x2 ≥ 4,

⎧3x1 + 2x2

≥ 12,

1 3 4

⎪

⎨ ⎨ ⎨6 x1

+ x4 + x5 = 9,

⎩5x1 -

x2 + x3 = 14,

⎩ x1 − 2x2 − x3 = − 4,

⎪2 x

− 4 x

+ x + 3x

= 2,

⎩ 1 2 3 4

x j ≥ 0

( j = 1,2,3).

10.

x j ≥ 0

( j = 1,2,3).

11.

x j ≥ 0

( j = 1,2,3,4,5).

12.

z = 2x1 + 3x2 +

2x3 → min,

z = 2x1 + x2 − x3 → max,

z = 3x1 + x2 + 4 x3 → max,

⎧ x1 +

⎪

x2 −

x3 ≤ 2,

⎧ x1 + x2

⎪

+ 2 x3 ≥ 6,

⎧ x1 + 2 x2

⎪

+ 4 x3 ≤ 18,

⎨− 2x1 + 3x2 + 2x3 ≥ 11,

⎨ − x1 + 2x2 + 2 x3 = 4,

⎨ 3x1

− x2 +

x3 ≥ 10,

⎪ 3x1

− x2 + 6x3 = 23,

⎪ 4x

− x − 2x

≤ 6,

⎪ 2 x

+ x − 3x

= 3,

⎩ ⎩ 1 2 3

⎩ 1 2 3

x j ≥ 0

( j = 1,2,3).

x j ≥ 0

( j = 1,2,3).

x j ≥ 0

( j = 1,2,3).

13.

z = 3x1 + 2 x2 + 4 x3 → min,

14.

z = 3x1 + 4 x2 + x3 → max,

15.

z = −2 x1 − 3x2 + x3 → max,

⎧ x1 −

⎪

x2 + 2 x3 = 6,

⎧ x1 +

⎪

⎪

x2 + 3 x3 ≥ 4,

⎧ x1 − 3x2 +

⎩

⎪

x3 = 1,

⎨3x1 +

x2 −

x3 ≤ 4,

⎨ x1 + 3x2 −

x3 ≤ 12,

⎨ 3 x1 + 2 x2 +

x3 ≤ 11,

⎩

⎪ x1 + 2 x2 + 4 x3 ≥ 8,

⎩− 2x1 + 4x2 −

x3 = 3,

⎪− 2 x1 +

x2 + 3 x3 ≥ 13,

x j ≥ 0

( j = 1,2,3).

x j ≥ 0

( j = 1,2,3).

x j ≥ 0

( j = 1,2,3).

16.

z = x1 + x2 − x3 → max,

17.

z = 2 x1 + x2 + 5x3 → max,

18.

z = 3x1 + x2 + x3 → min,

⎧4 x1 +

⎪

x2 −

x3 ≤

24,

⎧4 x1 + 2 x2 + 3 x3 ≤ 12,

⎪

⎧3x1 + x2 +

⎪

x3 ≥ 10,

⎨ x1 + 4 x2 + 2 x3 ≥ 6,

⎨ x1 +

x2 +

x3 ≥ 3,

⎨3x1 − x2 −

x3 ≥ 2,

⎪ x1 −

x2 +

x3 ≥ 1,

⎪2 x

+ 2 x +

x ≥ 4,

⎪ x + x

+ 3x

≥ 6,

⎩ ⎩ 1 2 3

⎩ 1 2 3

x j ≥ 0

( j = 1,2,3).

x j ≥ 0

( j = 1,2,3).

x j ≥ 0

( j = 1,2,3).

19.

z = x1 + x2 + 2 x3 → min,

20.

z = x1 + x2 + x3 → min,

⎧ x1 + 2 x2 −

⎪

x3 ≥ 2,

⎧2 x1 + 2 x2 + 3 x3 ≥ 6,

⎩

⎪

⎨2 x1 +

x2 + 2 x3 ≥ 5,

⎨3x1 + 3x2 +

2 x3 ≥ 6,

⎩

⎪ x1 −

x2 + 2 x3 ≥ 2,

⎪ x1 +

x2 +

x3 ≥ 5,

x j ≥ 0

( j = 1,2,3).

x j ≥ 0

( j = 1,2,3).