CHAPTER 2:

LINEAR PROGRAMMING
(PART 2) Slide prepared for University College Sabah Foundation Students
Example

Minimise
Z  x y
subject to x y0
4 x  3 y  12
9 x  11 y  99
x8
x, y  0

2
Constraints
x y0
x  0  y  0 (0, 0)
x  10  y  10 (10, 10)

4 x  3 y  12
x0 y 4 (0, 4)
y 0 x3 (3, 0)

3
 9 x  11y  99
x  0  y  9 (0, 9)
y  0  x  11 (11, 0)

x  8 means the area to the left

of the line x  8.
x, y  0 means x and y
must be positive.

4
y
x 8
9 x y0
9 x  11y  99

4
4 x  3 y  12
F

H
3I E 11 x

5
Coordinates

E: (8, 0)
F : x  8 ------------------------(1)
9 x  11y  99 -----------(2)
Substitute (1) into (2):
9(8)  11y  99
27
y  2.45
11
F  (8, 2.45)
6
G : 9 x  11 y  99 --------------(1)
x  y  0 ---------------(2)
x y
 9 x  11x  99
 20 x  99
 x  4.95
y  x  4.95
G  (4.95, 4.95)

7
H : 4 x  3 y  12 ---------------(1)
x  y  0 ---------------(2)
x y
 4 x  3x  12
 7 x  12
 x  12  1.71
7
from (2) y = 1.71
H  (1.71, 1.71)
8
 I : (3, 0)
Required to minimise Z=x+y
Z (E)  8  0  8
Z ( F )  8  2.45  10.45
Z (G )  4.95  4.95  9.9
Z ( H )  1.71  1.71  3.42
Z (I )  3  0  3
Z has a minimum value of 3 when x
= 3 and y = 0.
9
Let’s try exercise…
Maximize the objective function P = 3x + y subject to the constraints

2x  y  8
2 x  3 y  12
x0
y 0
Solution:
The feasible region is nonempty and bounded.
Evaluating Z at these points, we obtain

Z A   30   0  0
Z B   34   0  12
Z C   33   2  11
Z D   30   4  4
The maximum value of Z occurs when x = 4
and y = 0.