Linear Programming
Linear Programming
by graphical method :
1. Maximize :z=1lx+ 8y subiect to y<4. y<6.x+ys6,x2 0,y 20.
Solution:
Corner point method:
To draw the feasible region,
constuct 1able as follows:
Inequality xS4 ys6 xtys6
Corresponding equation (of line)
Intersection of line with X-axis
X=4 y=6 x ty=6
(4, 0) (6, 0)
Intersection of line with Y-axis (0, 6) (0, 6)
Region Origin side Origin side Origin side
Shaded portion OABC is the feasible region,
whose vertices are O(0, 0), A(4, 0), B
C0, 6). and
Bis the point of
intersection of the lines x = 4 y=6
and x + y=6 C(0, 6)
Substituting x= 4 in xty=6,we get
y=2 5
B=(4,2)
Here,the objective function is Z=1lx+ 8y
Zat O(0, 0) = 11(0) + 8(0) = 0 3
Zat A(4, 0) = 11(4) + 8(0) =44 B(4, 2)
Zat B(4, 2) = 11(4) + 8(2) = 44 + 16= 60
Z at C(0, 6) = 11(0) + 8(6) =48
Z has maximum value 60 at B(4, 2)
A(4, 0)
Zis maximum, when x=4 and y=2. 7
x=4 x+y=6
3r +5y S 26 5x + 3ys 30
Inequality
3r +5y -26 5x +3y = 30
Corresponding cquation (of line)
(6, 0)
Intersection of line with X-axis
(0, 10)
Intersection of line with Y-axis
B=
(45, 2.5) 8
4. Maximize : z= 10x +25y subject to 0sxs3, 0sys3,x+ys5 also find maximum value of z.
Solution:
To draw the feasible region, constructtable as follows:
maximum
5.
Maximize: z =3x + 5y subject to x+ 4y S 24, 3x +y<21, x+y<9, x>0, y>0 also find
value of z. [Mar 19; Jul 16]
Solution:
To draw the feasible region, construct table as follows:
B=
Here,the objective function is Z=7x+y 2t
Z at A(3. 0) =7(3) +0 =21
5
1t
Z at B
2 2
=6
X'+
2
A(3,0Ml
4 5 6
’X
7. Minimize :z= 8x +10y subject to 2x+y>7,2x+ 3y >15,y 22, x>0,y 20. [July 19]
Solution:
Todraw the feasible region, construct table as follows:
Inequality 2r + y>7 2x +3v 15
Corresponding equation (of line) 2x ty=7 2x + 3y= 15 y=2
Intersection of line with X-axis
A=
34
Bis the point of intersection of the lines 2x ty =7 E,
and 2x + 3y = 15. y=2
Solving the above equations, we get 1
3 X<
x= =4 X
B--(1.5,) 2x +y=7
2r+3y |5 |
Solution: 52
value INote: atNote:
Z= C= To 5, atZB
Z Z Z Zat Here, Solving x+Cis x=2,Solving
=
y Shaded
the isB Intersection
Region Intersection
Inequality Minimize (1.Answer 7 has Z zat
is Zat AHere,
22.Answer
5 Zmc-6) is has at Corresponding draw
ZuA(4, 6x 2y= the 4)']minimum,minimum C(0, objectivethe
minimum,minimum D(0,
tthe = portion
B2)-62) the point thepoint the given
] at 3) 0)21y
objective and 3 2 1 G)-) 7)
given above6 above z=: =
= 12+ = = of of of feasible 8(0)+
6(0) 6(4) 3x+y=3. XABCDY of 6x inwhen
intersection intersection line line value
inwhen value
equations,
equation "Maximum
+textbook at
equations, function
textbook + 221 +
function with with region, 21ly x 10(7) +
x 21(0)
+ +
21(3) = 52 10(4)
10(2)=36
= 22.5 21 2 45 21 Y-axis subject 3
2 1 is
X-axis (of
is i.e at =
22-5 = B: construct B4]ie. is
at = 4) = is line) 70 =
is and 63 24 we of we ofthe 1.5 3 Z
ximum
-(-})
the the 12
get getfeasible to =
=: y 18 and + + 8x
2 1 lines lines 40
+ table +x 20 +
2y3,x y
= = 10y
126 region,x
Non-origin side at 52 =
+ x+
=3
Zyx+
2y3 as 4.(1.5, 56
at 4y (1.5,
(2, =4
(30)
, follows:
144 4)
5 whose (o2) + 4),
0.5), 4y
=
and However, 52".
22.5". 28.8 2
>
3KD(0, 3) vertices x+ 4,3x
2y
wever, =3
Non-origin
side +y3,
ty=3 3x
c3 are
3'3) x+
=4
xt4y
4y>4
6 A(4, (0,1)(4, 0) we
x found
we 0), >0,y>0.
2
found B, that
and C it
that A(4; is
=3
x+
2y Non-origin
D(0, side
it 3x
3 Z
+y=3 3x+y has
is 3). (0,3)(1,0)
Z
minimum
has
imum x+
4y
4
+X value