Linear Programming Graphical Methods-

Example 1. Solve the following linear programming problem graphically. 79

Maximize Z = 60x+15y

Subject to the Constraints x+y s 50

3x+y90
where x20 and y20
Solution :i) Objective function : Maximize z
60x +15y =

ii) Subject to the Constraints: x+yS 50;

3x+y s90
ii) Non negative constraints: x20 and y20
iv) Graph of the constraints:
Graph of x+y< 50: Convert the inequality into equation i.e. x +y= 50 and
transform into intercept form we get.

5 l , it means line meets the axes at (50,0) and (0,50). On joining these

points we get the line x + y 50. Now the points (0,0) satisfies the x+y< 50. There-
=

fore favourable region containing the origin.

Graph of 3x+ y s 90 Convert the inequality into equation i.e. 3x+y =90
and transform into intercept form we get.
=l it means line meets the axes at (30,0) and (0,90). On joining these
30 90
points we get the line 3x+y =90. Now the points (0,0) satisfies the 3x+y90.
Therefore favourable region containing the origin.

Y AxiSA

90
80 Scale
70 onr-axis: Tcm =
10 units

ony-axis: Icm =
10 units
50
40
30
B (20,30)
20

X' -Axis X-Axis

10 20 3d 40 500
Y- Axis
 80
-Operations Research
fea-
given constraints is known
as
Feasible region The common region of all the
:

Sible region. Here which is polygon OABC.

Vi) Optimum solution: Optimum solution lies on any

one corner of the feasible region.
Remark
|Corner points of Value of objective function
z = 60 x + 15y
Feasible region|
O (0.0) 60(0) +15 (0) =0
A (30.0) 60 (30) + 15 (0) =1800(Max.
Intersection of x +y = 50 & 3x +y = 90|
B (20,30) = 60(20) + 15 (30) = 1650

C (0.50) 60 (0) 15(50) + =

750
The maximum value ofthe objective function occurs at the point (30,0). Hence
the optimum solution of the given L.P.P. is x= 30, y =0 and z (max) = 1800.

Example 2. A firm manufactures two products A and B which profit earned perunit is
on
Rs. 3 and Rs. 4 respectively. Each product is processed on two machines M, and M. The
product A requires I minute of processing time on M, and 2 minutes on M, B requires 1
minute on M, and 1 minutes on M,. Machine M, is available for not more than 7 hrs. 30
minutes, while machine M, is available for 10 hrs. during any working day. Find the
number of units of products A and B to be manufactured to get the maximum profit.
(M.C.A. 2010, 2009)
Solution: The Linear Programming Model of given problem is as follows
i) Objective function: Maximize z =3, +4x,

i) Subject to the Constraints t x 450 See Page no. 20

for Mathematical
2x, +x S600 Formulation
ii) Non negative constraints: x, 20 and x, 20
iv) Graph ofthe constraints: Here take x-axis for x, variable & y-axis for x, variable.
Graph of x, +x, $ 450: Convert the inequality into equation i.e. x +X, =450
and transform into intercept form we get.

460 450 = , it means line meets the axes at (450,0) and (0,450). On joining

these points we get the line x +x, =450. Now the points (0,0) satisfies the
x+ 450. Therefore favourable region containing the origin.
Graph of 2x, +x, S 600 Convert the inequality into equation i.e.

2x +X = 600 and transform into intercept form we get. + * = 1 it means line

300 600
Linear Programming Graphical Methods-
neets the
axes at
(300,0)
(30 and
(0,600). On 81
2x+2 = 600.Nov the points (0,0) stisfies joining
these points we get the line
the 2x, + S
region containing the origin. +x, 600 .Therefore favourable

Y Axis

Senle
6003 onx-uxis: I em 190) mits
vny-uxis: I cm

400-

300-
B(150, 300)
200-

100
X- Axis
450 X- Axis

100 200 300 400 500

s09
Y -Axiss

v) Feasible region: The

sible region. Here which is
common region of all the given constraints is known as fea-
polygon OABC.
vi) Optimum solution : Optimum solution
lies on any one corner of the feasible region.
Corner points of Value of objective function Remark
Feasible region z =
3x, +
4x,
O(0,0) z =3 (0) + 4 (0) = 0
A (300,0) z =3 (300) + 4 (0) =900
B (150,300)
Z =
3 (150) + 4 (300) 1650 =
Intersection of x,tx, =
450 &
2x,+x,= 600|
C(0,450) z =
3 (0) + 4 (450) 1800 (Max.
=

ne maximum value of the objective function occurs at the point (0,450).Hence

optimum solution of the given L.P.P. is x, = 0, x, =450 and z (max) = 1800. Thus the
firm
manufactured only 450 units of product B to get maximum profit.
Examnla1 0
 Opera
ations Res
Linear
Progran esearch
ning Prob.
90 solve
the
following

to
Cxample 8. Use the graj Eraphical
method

lem

Maximize = 7x, + 3x.

Subject to constraints ,+21. 23

, + , S4

0sxs5/2
0 s x s3/2 and x.X 20
(M.B.A. 2009
= 7x +3x,
Solution : i) Objeetive function Maximise
4
i) Subject +2x, 23: x +*2
to
the Constraints: x,
as
ne
Tollowing constraints split into two inequalities
0Sx 3/2
0x,SS/2

0Sx,&x, s 5/2 OSx, &x, £ 3/2

as5/2 x, S3/2
and x 20 and x, 20 (Non-negative constraints)

i) Graph of the constraints: Here take r-axis forx, variable & y-axis for x, variable.
Graph of x, +2x, 23 Convert the inequality intoequation i.e. x +2x, =3

and transform into intercept form we get.+ 1, it means line meets the axes at
3/2
(3.0) and (0.3/2) on joining these points we get the line x +2x, =3. Now the points

23. Therefore favourable

(0.0) not satisfies the x, +2x, region does not containing the
origin opposite to origin.
i.e.
Graph of x, +x, 54 :Convert the inequality into equation i.e. x+X =4
= 4 and
and

transform into intercep! form we get. = 1 , it means line meets the axes at (4,0)

and (0.4) on joining these points we get Ihe ine x +x, = 4 . Now the points (0,0)

satisfies the x, +X, 4 . Theretore Iavourable region containing the igin.

Graph of x, s 5/2 : Convent into equation i.e. x, = 5/2 and draw the line parallel
s r i s Dassing through (5/2,0). X, S /2 shows lavourable region let side to the line.
 Linear Programming Graphical Methods 91
Graph of x, 3 / 2 : Convert the inequality into cquation i.e. x; = 3/2 and draW

the line parallel to x-axis passing through (0,3/2). Inequality x,'s 3/2 represents favourable
region below the line.

Se:ule
Y-Axis
unit

,52

B $/2,3/2)

X-Axis

v Feasible region: The common region of all the given constraints is known as fea-
sibleregion. Here which is polygon ABC.
corner ofthe feasible region.
vi) Optimum solution: Optimum solution lies on any one
Remark
Corner points of Value of objective function
Feasible region z- 7x+ 3x,
Intersection of x, = 5/2, x+2x=3|
A (5/2,1/4) = (2.5,0.25) =7(2.5)+3(0.25)=18.25
B (5/2,3/2) = (2.5,1.5) z 7(2.5)+3(1.5)= 22 (Max.)| Intersection of s, 5/2&x=3/2
C 0,3/2) = (0,1.5) z=7(0)+3(1.s)=4.5
function occurs at the point (2.5, 1.5).
The maximum value of the objective
=22.
given L.P.P. is x, 2.5, x, 1.5 and z,(Max.)
= =

Hence the optimum solution of the

9. Solve the following L.P.P. by using graphical
method:
Example
z = 6x +7x
Minimize

Subject to the Constraints 2x+3x, 212

20
2x +x 28 and x,x

Solution: i) Objective function:

Maximize z =6x +7x,
28
ii) Subject to the Constraints 2x+3x, 212; 2x +r,
 -Operations Researe
92
constraints : X,20
iii) Non negative y-axis for x, var
variable &
Here take r-axis for x,
iv) Graph of the
constraints: variabl
Graph of 2x, +3x, 212 : Convert the inequality into
ation i.e
equation

into intercept form we get.

2x+3x, =12 and transform
= 1 , it means line meets the axes at (6,0) and (0,4) on joining these pojn
nt
we get the line 2x,+3x, = 12. Now the points (0,0) not satisfies the 2x, +3x, >1 2
Therefore favourable region does not containing the origin i.e. opposite to origin.

Graph of 2x, +x, 28 Convert the inequality into equation 1.e. 2x, +x, »R

and transform into intercept form we get.

= 1 , it means line meets the axes at (4,0) and (0,8) on joining these
4 8
points we get the line 2x, +x7, =8. Now the points (0,0) not satisfies thee 2x, +x, 28
Therefore favourable region does not containing the origin i.e. opposite to origin.
Y-Axis A
Seale
m x-Axis: } unii I mnit

omy-uxis: I mit2units

X' - Axis
-Axis
Y- Axis
v) Feasible region : The common region of all the given constraints is known as fea
sible region. Which is unbounded and having three corners ABC.
vi) Optimum solution : Optimum solution lies on any one corner of the feasible
Corner points of
region
Value of objective function
Remark
Feasible region z 6x, + 7x
A(6,0) z =6 (6) +7 (0) =36
B (3,2) z 6 (3)
+7 (2) 32 =

(Min.)|Solve 2x,+ 3x,=12 & 2x,+ x, -8

C (0,8) z = 6 (0)+ 7 (8) = 56
The minimum value of the
objective function occurs at thepoint (3,2). Henco
the optimum solution of the given L.P.P. is x, 3, x, =
2 and
=
z
(Min.) 32.
=