SECOND SemesTER (CUFYUnp) bEReE ExrINMON
April- 2025
BCA2CJ I03: NUMeRICHL þNALY 81S DND OPT|M|ZANoN
TECHNIQUES
Gp Cop¬: DI23015 Tie: 2hrs
Mork: 7o torks
Section A : 3 Mark : ceiling a4 Harks
(t- lo)
Siop son's (½)&ule - Simp son's (ule is a nunerical
indegsotioo mathod sed ko appronimode the de fini te
indegsal of afunchoo. tt can be clendved by approi nabig
he integrand fla) aich a paabola by sub clividing the
Indeqrand ineleaval ido n equal pats at Cengh , o
o+
fo 4 Cftfstf;t.. fo-)+
2(ta+fyt fet fo-)+fa
t.
1
Bisection method is used to fod the Rools af a poly nomial
equahoo bas ed on he nter mediade value theD 6
2 Calso Known as Bolzono's heonem ) Aepecle dly ding
an indeaval into two halves nd
checking where he koot
IS localed. It nemows lown he inderval anutil lt
kncs a 2oot witbio a Ceatain tolerante
f(n) Ls Condinuous on [ab]
fCa f (6) Lo tcs f Cc) = cE Cab)
2
Newton Raphson fosmula
3. fu K= 0. I, 2,.
fk
fo'
o la) =
P, () - lo
Tkape2oidal aule fiod f d,
5
J + 2} fi+ f +fat.+ fo tfn
Let n=4 1tor larqe n: inlemal value ç accuvate
b b-a
. h = O-5
O5 ·5 2
|0-25 1 235 4
h
2 o t 2
2 o+2( o.25 +1t 2:25) +4 ]
0-25 ( 7t4)
O 25 x |
6. Siopson's (&) Rale
foo de yo +3}9i+9, t.o-t 9o4
+9,+
4. Funchions of o-R
. Ophimi zation
Resouxce allocatons, Schedaliog (Task, project)
1Dventoy management
" Decision analysi3
Deision oaking undes Un ertaiols
Cost beneht analysig
multi - Critenia
decision analysis
Modeliog gnd Sioulation
predihve analgtics, oatbematical modekog
Rueing theory Supply chais opioizakod
Netwoik opinoi 2ation, Algo rtb
clevalop ment.
Unbalane d Tan Spostation problem cuben tbe
total Supply o oods does not equa
equad
to tbe total demeod C di +S)
Case I : Sapply exceeds demod
Case L
Demeod exceeds Supply
In lineci programm109 sack ood Suaplus V iables
9. CIsed to Convest foequality Constsaiots ibto
equality Consta aiots
slack vaiable is UDused fesoUes Conven the
4 tFype Consta arot Constaaiots
Suzplus VOiable Is ecess amount
that Used I > type Constraiot type.
24 32, +S, = lo Here , = slaek
3| 4
t 20
Here S,= Curplus.
Least cost Metbod
techoique used to tiod an ípitial
iniial basic feasible
Solution to be.T. p
aims to oi2e tbe tran spotation Cost bq
oioimi20
allocakog resoUes
efhcenty
-5 tdioti tbe Cell cortb lowest ost
Allocata as och cs possible uptang sopply ond
clemod
Hepeahing tbe pros Supply ad leod a
tally ehausted
Section B: 6 rohs s
cealoq 36 mosk
2 2.5
g:5 6
lo ta DC- 2 6
Lo -05
Pix) 22+
P(2-)= 5-4
c 25 =0 322
l2.
Neton - Rapbson method
choos oq Ioterval [2,3] .fcas=ko, Pca)16 >o.
fC2). f3) < o T0ot between C2,3)
do = 2 e'ca)= lb
Po =2"I
a 2.094551
Yoot appronmat y 2:09455
13. 3
1
forwd dfleyerto table
foo 4f
2
12)
3 10
polynomial
Usiog Newton's forwrnd tntepolatiag
H(0Mo) ( - , ) 42fo
A fo
Pa (a9 = fo + (- o)
23
f Cubic polynomialf
14 [o,i] Tapezoidd ale
2 ft fa+.. t
a-o, b=I choosing: n=4 :b= o25
o.25
1
2l3
o69 7024
15. Minioi2e
Subject to 2X+ 84 216
4x+ 2y 216
l6. B4 grapbi cal meibod
maiize Z= 4L + 3%
8abj eet to , 2t g = l000
400
By polots e (0, 10D0) od (s00, 0)
poiots ae (o, 8oo od (Goo, )
=400 (400,
400 (o,to0)
Reyion ABcD EF gives teasbk segion
Manirouo at poiot D(200, 6o0)
Maniroum 26001
A 4od
TTan sportat on problem and
and assiqgnment pobleno
tvanspoat ation problem the nuobn o< Socy(es ond
olesi nationn beed not be equal he na dhe Cost madix
not necesS a
Squaxe ataia, But assigoment
poblem s done baws.
One So no.o Sounces ond
destinatons should be eqaalhene
be 59 uare roatio
cost matoim
T:P the problers is uobalaned Lf
If tbe tota!
Supply ood total domon oe not equal
A-P the problem 1s uobalana d
1f the Cast atorin square oati
T:P oleals d1sisi baton o< 9oods from
3everad poiots ol Supply CSounces) to
poots o} desml Cdestination).
clas ol LP problems tht
thu nost
ost efhu eot asngpmuot of
Involve
determion3
people to þrojets
Sales pcop toto der ribnes
dobs to hoachin etc.
By Vogel's App1oimahon method.
’ Total dem mod = 340: Total suppl = 34o
IBulane d TP
By toding penal tes, the allocahon j,
D
D2 Dg D4 Supply Allocated ells = 6
(50) 20
140 B00 boo loo
.: Nop -deqenerat
at Salahon
(7O) (2o
0 T-P cost
300 400 600 A9500) -
80) (to0
4 00 6oo 200
Deo 5O To l40
Section -C lo roauk
19.
Bq Sioplen metbod
MaximiRe Z= 3, 4 20g+ 0S, + 0S,
Sbject to
K) -- ++ S, = 22
1, g , S S,
0
Sioplex table ! 1
key element1
leaving vas able 1a S.entening voi able
2 1S
1teraton ,2
>Key elem ent = 2
\eaviog vaniabu I! S ; eoteing vaiable i, y
Iteration 3
2
B. V Soluhon Raho
S
3 3
2 2
Soluton is ophoauo
Maniun z = 3,+24,+ 0S, + 0s, = 9+2
20. Row Ted uchon Colon Redu chon
I I
I
A 6 |2 A 6 6
B3 2 2
3 l2
C 6
N=3 lios
n= 4 Otden of matin
.
: not optimum Select th
Smalest cncovesed elemot
9= 2 S Add 2 to th
Sab stract 2 mtesscchon value
No 2 from Un overed value
Cherge foa line vales.
I H
44 o 4 A
B---b-4o--o-
CC 4
DHo-2
n4
4
B
C 3
u-o o
st ophgum. N=4 N4
Smallest elomsot n=N
=1 ophmum.
A’ I
BV
C’
Assignment
minimum Cost = 26t 32 + 25+ lo
