Consider linear programming problem as follows:

Maximize Z  10 x1  20 x2
Subject to
 x1  2 x2  15
x1  x2  12
5 x1  3 x2  45
and
x1  0, x2  0

The objective is to solve the problem using graphical method.

Draw the feasible region corresponding to the constraints.

The non- negative constraints x1  0, x2  0 represents that the feasible region lies in first
quadrant only.

Consider the inequation  x1  2 x2  15 as equation  x1  2 x2  15 .

If x1  0 ,
 x1  2 x2  15
0  2 x2  15
15
x2   7.5
2
The extreme point is
 0, 7.5 .
If x2  0 ,
 x1  2 x2  15
 x1  2  0   15
x1  15

The extreme point is

 15, 0  .

Consider the inequation x1  x2  12 as equation x1  x2  12 .

If x1  0 ,
x1  x2  12
0  x2  12
x2  12

The extreme point is

 0,12  .
If x2  0 ,
x1  x2  12
x1  0  12
x1  12

The extreme point is

 12, 0  .

Consider the inequation 5 x1  3 x2  45 as equation 5 x1  3 x2  45 .

If x1  0 ,
5 x1  3 x2  45
0  3 x2  45
45
x2   15
3
The extreme point is
 0,15  .
If x2  0 ,
5 x1  3 x2  45
5 x1  0  45
45
x1  9
5
The extreme point is
 9, 0 

Draw the region corresponding to inequalities  x1  2 x2  15, x1  x2  12 and

5 x1  3 x2  45 in first quadrant and the common region represents the feasible region of
the problem.

Figure below shows the feasible region along with the corner points of the feasible
region.

To find the maximum value of objective function Z  10 x1  20 x2 , determine its value at

each corner point of the feasible region.
From above table the maximum value of Z  10 x1  20 x2 is 210 at x1  3, x2  9 .

Hence, the required solution of the problem is as follows:

Z max  210 at x1  3, x2  9 .