Linear Programming
Linear Programming
)2, x+y14,
yzl.
Solution : To drqw regions x-!)2, x+y<4, we begin
by drowing the
lines x-y=2 ond x+v-4.
Tlvo Intercept
Inequolity Line Points
Form Region
A(3,1) Z =t_Z(Z)= _S
B(2,0) Z =o-2(2)=-4
c(4,0) Z =0-2(4)=-s
The moximum volue of Z is -4 qt x =2,y =e
x+27 = 10
5
(0
4
I
3x+ y:24
Tqs678
c(0,6).
Corner Volue of
Z =200x + 500y
Points
A(4,3) z =2oo(4)+ soo(3) =2300
B(0,5) z =2oo(o)+ soo(s) = 25oo
c(0,6) z = 2oo(0)+ s00(6) = 3000
x)0,J2)0
Y = 2x, x*y=JQ
(o,o),(s,to)
x+ y <30 (o,Zu, o:.!1.b.
30,o)..
x+Y=30
15
10
8 to 15 zn 2s Eri
The feqsible
c (a.)e.)
Corner Volue of
Points Z =200x+100v
A(.9.,.q.), .9.
x,Y)0
lb drow
Tcrdrow regions
regions 4x+2y) 16,!3x +.Ly>?i.?x+.6y>_.1.g
Two Intercept
Region
Form
4x +2y > 76 4x+2y=l$ (+,0),(o,a)
4x+2y:16
8
',,irq
'e(j,o)
6 8 3 t0-. 12
t1 117",\--t f.
The feosible region is ABC with corndr points A(.1.,9 ), B(A.,?.),
c(. !.,9..;, o1.Q .,1.?),
Corner Volue of
Points z=800x+640y
A(J.,.o.), .7.2.9.e
8G.,2.-)
c(..L.6.)
D(o.,tZ) .7 6.8.A.
1<-y 7, a
zn-y S o
lGe f<^sitl-
So l.r in5 (ll end (:f l r^lc 3.* - 2-{ , !=eo
"(
.'. ? = (t-9,5o)
g (o,re ) ro
a (to,t-o) {o
p (rr, fo) lLe
D (o, too) Loo
!e hc,,: tnin irnqyn valql SO -t * ^,, Con5cc .^*;rc
vtx*.l ce-r B qn AC
.ro
;i' Lx-Y ? o
lct)
9o
,o
7o
66
p (e-f , so)
5n
IJ|t\"9 11t
! (torto
16 Lo jo qo
s" lu*i<rlrs
lYTlr:k
Ex. (6) Mqximize : Z =3x+9y
subject to x+3y < 60,
x+ y>10,
x1!,
x ) 0, y>0.
Solution :
I
(o,: o)
Thc li.o:iut. .rcllov.. Pe eop
i_S
,,,..?.h*'...T1tI'lnY3....Yl}r.r....l.9.9.
t ^ o c onsec^li va P oi ruts f5 q^ I a.
"/
",/e
\2o
^+3J=[o
,'"L hos rnaximuvn Va\ue \go ".* e-rtc-r-1 foinF
.,2r) an) e (o
aa, (rf,r5) Henre lrlrplc q^t<* ir.frrlitc
5b
lo
\
tr r,flx
36
2o P (7o P")
lo
7 x
to 2-o 30 t
YI t-o71tr"J, r,il \ ztJ =io
.'. Tl^.q_ Iy\ cr.x-r ynq vy\ 2- is \ gEooo J
"d.1:. : .h
..
Sign of Teocher :