Beruflich Dokumente
Kultur Dokumente
ntEnArr9
t
.....--
Pqlt+sq Ctrtvlg
llkrN
0o v,af ht4trr
cAvv?i, qQX,
cptrv(* 6<f6
A'r-ffZ.'.,*nVeLY
r(
eL+rwPt€
$^/e flt€ bPF &art'\tcet-r'Y
Tu,e- (Ugryr. re
F\Ar{nn\68 ? .> 1A.t + tt:q.
{rrOSE4r TD 4rr + /7(, 1 8o
)at t5 11 -4 \8D
a-1,L) > o
9or-urnoV
4*r +7x, = QO
2 I,r+5 I t = l9o
lv
\, xL AE iN 1.J+C lfir 4UR,D O^$tT 6N#
c- ( ofte
t>
zrttt1tt4wvSE
rT
I
EX.{,MPLES
GRAPIilCAL METHOI}
1) Maximize
to
Subject 30xr+2AxrS300
5 x,+l 0 rr 5 1 1 0
XtrXr20
t6
t4
T2
10
q8
Z max=2(11,0)=56
Z(0'0)=0
Z(0'10)=80
7(4'91=96
Z max=95occurswhenXt=4andXt=9
2)Maximize Z= 5xr+ 4xz
Subjectto
6x1* 4x2=24(l)
X1+2x2<6 (2)
-xr+x2 <1 (3 )
x2<2 (4)
X r,xz>0
Equation(1)
Whenxl = 0, xz= 6
Xz =0 rxl =4
(4,6)
Equation2
WhenXr= 0, xz=3
x2= 0, Xl:6
(6,3)
Equation3
WhenXr= 0, xz: I
X2:0rXl:-l
( - 1 ,l )
Equation4
WhenXr:0, x2:2
(0,2)
4 -3 -1 lo t z 3 4\s 6
-3
4
-5
Z (O)=0
Z (t1= 29
Z(B) =Zt
Z (C;= 13
Z(D;: 13
Z(E) =4
8. Znax:Z(B)
=21
r
25x+36ys91000
X ,ylo
'--
50x+ 35y = 100000
r Y=0 50x=100000
X=2000
b, zzzg)&(2oo0,
So,coordinat" o)
r'
-25x+36Y=91ggg
o X=0 36y=91ggg
Y=2528
r Y=0 25x=91000
X=3640
8(2000,0)=30x+40Y
= 30(2000)+ a0{0}= 60000
30x+40Y
Cl36O'2278)=
= 101911
=30(360)+ a0|-2778l-
= 30x+40Y
D(0,2528)
= 30(01+tt0{2528)= 101111
Solution,
Step1:
Step2:
2x+y = 100....(1)
x + Y= 8 0 . . . .[2 )
=*x = 50
:+(50, 0) is a point on the line (2J
Plotting thesetwo points on the graph paper draw the line which representthe line 2x + y
=100.
Step3:
To determinethe point of B,
2x+y= 100..-(1)
x+Y=8 0 ....[2]
Equation[1) - (2),
2 x- x+y-y=100-80
tsx=2 0
Theintersectionof both the regionRr and Rr'is the feasiblesolutionof the LPP.Therefore
everypolnt ln the shadedregon OABCls a feasiblesolutlonof the LPP,stncethts polnt
satisfiesall the constraintsincludingthe non-negativeconstraints.
I
{
'-.!
I
GRAPHIqAL METIIPI}
PROBLEM:
SOLUTTONz
Manimizel2x1+ l3x2 r
Thentheconstraintssubjectto:
2x1+4S l0 (sPace)
xr S 4 (demand)
Where;
X 1 ,X2 )()
It is plainfromthediagrambelowthatthemanimumoccursat theintersectionof
xr * 2xz= l0 and
2x1*12= lg
s
7
v")
/\ a-
\2
\,
The vertices:
o (0,0) Z (O) =0
A (0,5) Z (A )= 6 5
c ( 3.33,3.33) Z (C ):8 3 .3 3
G (4,2\ Z (G'1 :7 5
H (4,0) Z (t9 :4 9
Therefore,
The company'sdaily profit (in hundredof dollars) is 3r1 * 2x2, sothe company'sobjective
function may be written as
m t x z = 3 x r * 2 x2
ConstraintsI - The fraction of the day during which the paint shopis busy is lessthan or equal
to l.
Constraints1 - The fraction of the day during which the body shopis busy is lessthan or"equal
to l.
ofdaypaintshop
Fraction works = (ryP)(W)
ontrucks
= 61 "
of daypaintshopworksoncars =
Fraction
fi,
Fractionof daybodyshopworkson trucks =
*t,
11
* rr < 1 (Bodyshopcontraints)
E6rt E6-
mil(z-3xt * 2x,
Subjectto
1L
T 6r t*6 *, S1
TL
* rt
E6,rt E6-
X1,X2 > 1
The feasibleregion for this linear programmingis the shadedregion in Figrre I boundedby
AEDF.
Figurel: ShadedRegionAEDF
gorerf,tgN
Lt) tr irF\ er^? gQftlnAL
oQ- (i'r) Av ti4?tr./t(tr, rqlrn hqA ctF atznrn/<- tsulrtout
fe
Ltqnl-lve.
! s
trlrlUr vdr
mtr</tl lv€g
to + l, croo
(d,tv0 tv4<
,\q{/f,t V 8., .L qoo
I'tryo1t7g9
r7 9r dbo
Z-
urrn $9a 6? I gcalau
,rr+r_,pryr*st,<t
v(x d.r ?rL IW ?&4t
1|
d l tl ' r^
I
"! f
,ot$tfn '\h,C;
qe
,@
c
y@
L
\60
tr
o 16tr 96\ 4w 6fr
\\N
\
\
'h A
{
90\yfvoil
m4
o ( ato) ?co) rQ
ft-Cecru,o) ?{A) = 2q6to
\.7
9vt r,"l r,s
a r-ar(2
lq * AzV 4
:C{,\t 70
lotl,TroV
-N
\
L1
7\