Scribd
Upload
29 views24 pages

Decision Theory

Uploaded by

kp8qvbxccx
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
29 views24 pages

Decision Theory

Uploaded by

kp8qvbxccx
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 24
| q ESE: Vectton | SS = ‘Scene os io ja a D | Tatroductfon - “Tnportance of Decisfon sciences G wore oF ___| quantitative techniques fn _decfsfon_maxing » ‘| © Assignment moder = concept, Fiood's Techatgue / nungarian fmethed tociuding sestricted , muitfpie assign ea § maxinfizn objectives — @ “Transportation model - concept, Formutttfon , problem. ba types: Balanced , unbalanced , westrittfon § maximization, Basic faFtfal_¢01 using north-west corner, Least Cost Svam , optimal soi% ysing Moor , muitfpie soi” case. to_be Consfclerect «” Linear programming - concept ,Formuiation § gvaphfcat — Souutton » Markov chains — apprication awiated to mgt Ea functional areas , esifmarion oF Transitfan probabivities © stmuiatfon Technique ~ monte-cario_etmuiation, seepe & ATafiration Ee @_| pronabifry — concept, condttfone prebablikiy theorem a based d-maring . probatiiny diistyfbutior3 Cermak Be Binemiat , potsens ratio) - i 2 quth = Con siqgie sever § mur server fe gaopiems- Bp ® cpm RT = CoM 1 dlrabing netWort., network he —|__ eau cutatfon 5 — —_|s network crashing = Concept oF project cost 4 fs =— ——| components ‘Time 4 coor eiatfenship, crashing of be Com. Netlog, Re ee Ue | —~| E ron [SS ae eae 4 3 ~ a aoe hl tinbow | fob prod? unit has @ jobs Bic, Financ on each of the @ machines + The processing oF cal iob for each machine _fo_gf oi should the Jobs pe agstaned 0 ag io minfniize the processing coat. Machines obs Pp. § 8 5 A Bl 95 35_—95 8 95 94 9% 24 c 44 34 og oH oD 3836 gu HO 7 = | step @__Make assignment. flo 0F_1tneg = no of 05 | cowmng. tn | _ Be S01 %6 optimum Rar e | eee ~~ ~4 a 8 89 Pers. 80 Bl B | —» 80 20 de 0 c 2 4 -——» {00 pe io c ® 9 —» 99 2 —> 90 350 350 246) _sowe the Fou? Assignment problem. E Jobs: Pe RS A | 85 50 30 40 at’ B | 90 40 Fo 4B vc | 40 60 60 50 Bs] See of se tetas es ee F poe s : ia 8550 GO) Ho 90 Gd) Fo 45. ze | c | #0 60 6060 ee! | 45 45 —_| Rod areductfon | cama reduction ___———_ -— co te RUS ee | I algs 90 9 jo i ______ } 6 |30 0 go 5 : Gc Ip J0 0. A | ®|90 10 0 20 4 | WD ARES |g 9 RK eee eo A tO. alas 2 $ alec 5 8 |e —0—sp5-0 c [oh th eo c bee} eo ® i 209 9 [20 1 } 2 no.oF rows § columns 4 No. oF AineS. Mave fmprovement~ peer al 5 10 0 B| 30 0 30 clo iW 10 glo 0 0 10 Make sine PF ks NO.OF rows § columns = na-oF LINES A | 351888 2 9019 ig optimum 8 | 3e—e-go-6—@ © c 0 |Ho—s—s—lo-@ eee eo Prake assignments ee eee PERS Alo5 to x 6} 30 BJa0 5 ce |[o) to 10 © [10% B10 9x0) d \ | category oF _probiems - aan noves09. Dl > matting Pe |p Unbalanced OR Ge ole Ce i a Es Muitipie assignment an ee r | Restsicted assignment eas ESE ae Ei —~ —[ maxinization Probie. j a p0| © wove are to be done on @ div% mactines..assyn the job 50 as to maximize the tora) profit. 5 Ptr Pe Mg My i abis ois: 5 81|@ 2 wo cl m4 5 10 Dl lee gy -jy ae PS the given problem fs for maximiz?. Hence, Substract ali the element of the matrix From the largest element. My Ma Mg My | ciel i bemebac: | al @ 6 4 2 Led pi Os Be Guy, Ee c|_ 3 @ # 3 kel o| Men 6 oa Lad [ora tines Mi) Ma Mg Mu eee ss Fg —— pal. A Bo Py > ie cM > 15 D My —> JF 62: SoWwe the prcblen of assignmei he_given_tabe jtp martnize the seg 2 yd My a Ms My Mp Als. 8 40 98 40 a BO Of 98 8) 38! ea yo clG@) oF 33 a0 se M O12 2 wy 36 36 4 E129 33 40 35 34 = Mi Ma Me My Me AS Gals _ 8 |® 1% 13 20 5 L clo m3 Bree acs olig 3 0 5 5 Ee ee Wen e. Rod eduction f Serato ae p OTe igs ig vu ae poe Te Vim ee a. Las gtlor liaise pal aaa iS o iE Ie POR column red § Had Jines- Mi M2 M3 Ma Mg $— 05 4 ® yg iy 4 lo g 6 @® ® eC. PP WiW-5 a9 _|_@ Here, No. oF ® THOS & Columns NO. oF sines $0, We go For Improvement Pty Ma Ms My Ms pS 20 OF 50 ex,@ | |@ salesman _are to be assigned to @ tenitories bosed on the past performance, The Fou table Shows the Le ee “.|o @ x 7 4 ap lf os lo & | {|g ge yet ot Jal | ol|%si fo 5 L els 5 ~ fl! | AM —» 38 1 my — 40 I Mo —> 3% go Ms — 4 f E My — 35 bE Agi t ! t annual sales that can. be generated by each Sales- man 49 each +terftony. T Te 1 Ty Ts 8) | 96 WW 10 12 (@) Sg | Sl 2% 30 (uy) 16 93 |) 1B 16 95 30 Sy | ie @ aI 30 95 = pe SS Lao eon is Gv Row eduction aU) Te Tg Ty 1g Draw sines 7 Me iene oe i Y 51 [ae o 5 | #5-s-3—o-d 2 | 6 [Hise Bs ie &s | o—-g—-0—te—15- 8 Sy k dy | Bog 12 3 a a bo J oleae ee © asdgoments a Here, no- oF 108 § co1umns = no.oF tines 2: 601 fo optimum. Th % Ti Ts + a[m 5 3 & S| to 5s 2 lf 3 x 0 6 ss ¢ B 1s Bi és nM E ee Pee al suegmans —_Tentieries" — St Ty. += et os Tyre el ee a SH m >A ag ee cor ae ES ee et ane ang mgm A ortFoite foutuas_ Shoutd ie held a nd » 9wi ____| per_weekx_tf CON teasing pure _PoFs _Sunap op. mon ‘50 Ho 60. etd qe__| yp 3 uo 0 Wed | 69 90 yo 90 tur. | 30 30 _e _30 ~ fio bo Sip 50 AS given matrix containg ©) row § @ coms. Hence, Tt 15 _an unbalanced matrix. $0, To maxe ft balanced .\we feed to add one dummy Cowmn wrth all elements zero. [let _pPre pier» _a8opfin _Qummyp Mon | 50 LD 60 2D oO Te | 4 go 40 300 Wed | 60 G5) x0 G5) o o | = erehy fo. alain 2e10 62 Red Reduction & column ted” a sere Thur! 30 3o 20 30. prtal@g) aps (f0) - go 8 Toe Nod the matrie ¥3 baianced apeu oH ungerian. St 4e0. pm MF 340 dummy 29 50 O Jo 30 10 lo 10 10 oO ° O20 o Oe 0: re Rainbow fe P| 1g we BP gui pe won| Ho. 50 9 we Jo ib 30 | Wed |_5o 90 hw: | 20 (©) fo Fa ® © oo here, no-0F sow: Iwas f= n0.cf 1Toes. 2 9019 1g not optimum: we have to go For _Tmprvement dea prh owe 98 gu M o 1 woo o T9010 20 16 0 Wi] yo 0 10 0 oO T] 16. 10-0" 40 “19 Fi] @ 10 | D0 20-10 Draw sines LPM or 960. du tegen ark 4 TaaFRgCE ro-oF res q ip : Tere, Ga Ya opifinars av la|z ly is to b Make psaignment pm mF 8$0 dum m| so 0 40 OK tl] 20 10 © 10 @ 40 10 RX [ee ssp Ho. tos fol ato Sie aR ee ee ee Se Eee Oe ee aren Sisap§eptions —,90 sue aan so i Pe wed Roe toy oT eee That Puyual fur —> 20 i aT teasing. > 40 ui 4. = S| ex O. oo — =< For unbatanced, eoive the Fou” aosignment problem for | mfatmeum opifinas costs poeosus 6 a pepeneenns —4 al 5 sw 8 i —, Bio B % I 2 A fae ole wo sm 2 £ i WF 3 10 Raljiven mats?a. Contain G rows § G) columns Hence, 7+ %5.an unbalanced matrix. 90,To make Tt balanced . we need to add one dumny ‘re with ali elmes zero: 1% Qe no 5 9 12 @) (Dg 95 15 6 tinbow ee) Dare eres NO-OF YHOI $CowWMNS = NO-OF Afnes. I 5 cot wor optimaas he haw to ge hor Tae [eeeP ee se aR eee ae Te | |, | ae On eS lel ig peer & Bil Ol g cil AC RT a | Cal ewes Oma Ma. sey ae oa | 20 SD. omiG ea rs ie ee eee | F El 3 6 a) og ee] FE | Felesetoms oe ep eae eee eee 4 f | praw afnes | | al i433 4 & & A _| “oF 45-8 0 — Blo 6 15 4 @) Here, NooF REC + NooF Lines ec o 42.5010 75 not optimum 9D 4 + 6 6 we need Improvement e 1 : F | @ —Improveme® 8 1 Oy 8p Be ial A910 #48 8. 0 e 61/0 48 5 2 0 C110 o 33 &. alo 425 9 4 re E I i@0 2 & — ie oe ae he ee |S pe Drad +ines pe Ae ah BN AGG 5 re A o — | | 8 @ ~ rei £ Fe persed | E : | Rr £ ow | ee ® en Perec ~ weal 2 4 6 6 3 6) 7 8 8 x ile 20 See 7 ix ys 5 2 ag tos [6] [rou 2 . Step 90.9 — column Reduction “Draw -tines A Cae ars FS 7] rar Here) n0.0F ras § coiuenns oly 6 5 og + 0-0F tines, 3 Ko 49019 fy not optimum 4 {2 —e—S—8—F ge neve to go for 513,@ ‘3 2, Improvement mave-zmerovement 2s #8. ca 1 £€ a4\o Fo 4 4 2F5 5 4 2 Oo S| 98 dante On a 4|a 0 5 oO 4 1 Sif 940 6°40. . 1 Here, also, no.oF 12w9 5 cotumns + no-oF sines av. $01 fs Hot _optimunr ve have to igo for 9 q Smprevement- @ tg Here, No-oF wows § columng n9-0F AInes 5. 807 fo optimum e e c iu $ @@ o nents co 12K fq _¢ 3 2 2 6 4 fo) 4 6 Cc DE Aine: a8 4 4 6 o AB a{ma A 8 Ceoee 1/8 9 [) 6 3 i wx xs fol m il 4 1x Praxe Ansigo A 4 4|m fe) 3 KX 2 Sif) x 4 2 3

You might also like