Graphical Method Practice Problems

Solve the following problems using the Graphical Method

Problem No1:
Max Z = 4x1+ 3x2
Subject to:
6 x1 + 8x2 ≥300
x1 + x2 ≤ 80
-x1 + x2 ≤ 20
x1 ≥ 25
x1, x2 ≥ 0

Problem No 2:
Min Z = x1+ x2
Subject to:
2x1 + 2x2 ≥ 10
x1 + x2 ≤ 5
-x1 + x2 ≤ 3
x1 - x2 ≤ 3
x1, x2 ≥ 0

Problem No 3:
Min Z = 40x1+ 60x2
Subject to:
2x1 + x2 ≤ 70
x1 + x2 ≤ 40
x1 + 3x2 ≤ 90
x1 + x2 ≥ 20
x1 + x2 ≤ 80
x1, x2 ≥ 0

Problem No 4:
Max Z = 2x1+ 2x2
Subject to:
x1 + x2 ≤ 40
-x1 + x2 ≥ 0
x1 - x2 ≥ 20
x1, x2 ≥ 0

1
Problem No 5:
Max Z = x1+ 2x2
Subject to:
x1 + 2x2 ≤ 31
x1 ≤ 21
2 x1 - x2 ≥ 2
x1, x2 ≥ 0

Problem No 6:
Min Z = x1+ 2x2
Subject to:
x1 + 3x2 ≥ 90
8x1 + 2x2 ≥ 160
3x1 + 2x2 ≥ 120
x2 ≤ 70
x1, x2 ≥0

Problem No 7:
Max Z = 1.80x1+ 2.20x2
Subject to:
5x1 + 8x2 ≤ 200
15x1 + 6x2 ≥ 240
4x1 + 12x2 ≥ 180
x2 ≥ 10
x1, x2 ≥ 0

Problem No 8
Min Z = 24x1+ 28x2
Subject to:
5x1 + 4x2 ≤ 2,000
x1 ≥ 80
x1 + x2 ≥ 300
x2 ≥ 100
x1, x2 ≥ 0

Problem No 9
Max Z = 30x1+ 40x2
Subject to:
4x1 + 2x2 ≤ 16
2x1 - x2 ≥ 2
x2 ≤ 2
x1, x2 ≥ 0

2
Problem No 10
Min Z = 3x1+ 3x2
Subject to:
x1 + 3x2 ≥ 60
x1 + 3x2 ≤ 60
-x1 + x2 ≤ 20
x1 - x2 = 20
x1, x2 ≥ 0

Problem No 11
Max Z = 2x1+ 3x2
Subject to:
x1 ≥ 4
x2 ≤ 4
2x1 + 2x2 ≥ 16
x1, x2 ≥ 0

Problem No 12:
Max Z = 3x1+ 3x2
Subject to:
x1 - x2 ≤5
x1 + 2x2 ≤6
x1 + x2 ≥0
x1 - x2 ≥0
x1, x2 ≥ 0

Problem no. 13
Min Z = 2x1 + 3x2
Subject to:

7x1 + 6 x2 ≤ 42
3x1 -7x2 ≥ 21
x2 ≤ 4
x1, x2 ≥ 0

Problem No. 14
Min Z = 4x1 + 3x2
Subject to:
x1 ≤ 7
x2 ≤ 8
10x1 + 9x2 ≤ 90
2x1 + 3x2 ≥ 6
x1, x2 ≥ 0

3
Problem No. 15
Min Z = 2x1 + 7x2
Subject to:
X1 +x2 ≤ 5
X1 ≤ 3
X2 ≤ 6
x1, x2 ≥ 0

Problem No. 16
Min Z = 2x1 -3x2
Subject to:
4x1 – 2x2 ≤ 12
X1 + x2 ≤ 5
-2x1 +3x2 ≤ 6
x1, x2 ≥ 0

Solution to Graphical Method Practice Problems

Example 3 in the section: x1 = 66⅔ x2 = 13⅓ Z = 306⅔

Problem No. 1: x1 = 80 x2 = 0 Z = 320

Problem No. 2: Special Case: Alternative Optimal Solutions

x1 = 4 x2 = 1 Z= 5
x1 = 1 x2 = 4 Z= 5

Problem No. 3: x1 = 20 x2 = 0 Z = 800

Problem No. 4: Special case of infeasibility

Problem No. 5: Special Case: Alternative Optimal Solutions

x1 = 21 x2 = 5 Z = 31
x1 = 7 x2 = 12 Z = 31

Problem No. 6: x1 = 25.74 x2 = 21.42 Z = 68.58

This problem has a bounded solution

Problem No. 7: x1 = 24 x2 = 10 Z = 65.2

Problem No.8: x1 = 200 x2 = 100 Z = 7,600

Problem No.9: x1 = 3 x2 = 2 Z = 170

4
Problem No.10: x1 = 30 x2 = 10 Z = 120 (the solution is only one point)

Problem No.11: the solution is only one point and its is special case of unboundedness

Problem No.12: x1 = 5⅓ x2 = ⅓ Z = 17