Assignment 42 Trensportakon Medel A_department store wishes to purchase tho fellewing quenblies of dresses: a. | 6 e Dress type $ sso | 100 | +5 More than the Mere eo the, | Quantity Four differant manufacturers whe under Manufacturer 300 aso The store estimates thak its profit tia Bs.) pec dress will vory with the menufacturee as show? 19 the following toble; | [ss 245 3-50 4-25] 2.25 esol x awo | 3.a5 4so| s45 | 1.00 ¥ 2.50 3So_f 495 | 2-00.| 4-35 z | aas | 24s 4.00.| 2-50 | 145 Find how should the- orders for dresces be placed? Hore Zh, = total domond quanthes - 740 29; = total supply quenbhes = 900, So, this is an _unbalenced transportabeo praklom, we musk inhoduce 8 @i- Eb; = 900-4FS L = 32S quankhy with » dummy dlemand _conter Da . For || Solving Balanced tronspostakicn model. using Least Cost Method, we. F PAG ‘Scanned with CamSeanneroate CT |) convert the problem to minimizahion Cast) by sublockn ——T oy, prep elements from _targest profit amovot and sclve, after ——F : SHES i) Tatroducing ew dummy demand center, —— Tf T I a |iiezf-se<| So e | 0 Suppl wo | ags | 3-50 |u-as I 225 [4-50 [0 3e0 x | s00 | a25 | wsol1as|soo| 0 aso y_|aso | [Link] | u-3s| 2-00] 1.25] 0 aso T Ee iz 32s | 2as4 4-00] o-so| +75] 0 200 demond| aso |-sc0ol 3s | ase] 2001 Gas) i) Converting be minimizaben problem and solving J Solufen: 5 Ly 2 100 Lig = 200 no-of bosic cells = & Lag = 30S men-1 = b6+4-129 tag 2 aS Se, degenerate sol” 392 75 tas 24S hays 150, Lay = 50 Hin. cost = 100 43-25 + 200%2-5 + 495x348 - 305 xu *S + pace FT TT ‘Scanned with CamSeannerFSxK3-S+ 150%1-5 + Sox2.25 2 Ps. 2287-5. - A ang th But what we need “here ts maximum profit, so _replodng Ue costs with DBriginal volves Supply 300 250 Iso S0, maximum _ profit 200 JL. So, Ja order bo gain maximum profit of @s. 1954-5, Rs. +150 x3:25 + 50x2-5 1983-5 placed in the follewing maaner; orders should be, ca = 450 dressrbype A. from mmanufachrer Z a-Sx100 #2.95x 200 +125 +O 4 FSK4-FS + 4S ¥INIS > 100 dresses of type B fem Ww > #5 dresses of type Crom > 900 dresses of type D from W and 50 from Ze > 195 dresses of ype © fom x and 48 trone y. e2 : x ‘Scanned with CamSeannerCom A company monufechuring belevision sets has plents with a Capacity of 25, 250, 195 ard 200 units Fespeckvaly , the Company - supplies TV sets to its tour Showrooms which have | a demand of 100, 400, go and 60 units cespedively . ue to me differences éo east, the profits ta _the following table. The demand at showroom 5 musk By Lsing Vogels approximakon fre caw material cast and the Fransportaken per unit Cia es.) differ which eva giveo be supplied from plant 5 methed plan the _ produchon prodram So_as to maximize the profit. Also determine the maximum total profit. If company recommend which weots bo remove one _shouseoom then Shousroom has te be _ceamoved. Showrooms | rest, woo convert the profit mabix be maximizakon poblen to all elements. from max minimizabien problem by surtraching element. (139) 2 = a Showrooms Lz [|= |= Tw | spo 49 39 19 29 28, ‘Scanned with CamSeanner——|_plent 2 we. Con assigo =e een Ao upplied rem Ag the demand of showroom F me supp i tat _ 7 ‘Scanned with CamSeannerI “ée hockens Origins [ On Ds 3 (ee |. On 2 6 #2 s on @x Oa Be S sa Se Sd @o : sits s =n ©: oO: fe) letnord | ise 1. Le et - Ai . So, _Solukeo. aa = rho aie waa = 4 4 %a,24 2 i gu oh tar e4 Maximum profit = 9xd4 tea + Feat FrQe Sxl + 4x0 » 2 si 93 ae? ood > Also. it no-cf basic coils = 6 | omen-n ce eg es et 80, he Soluken is degenerole, T pact | | ‘Scanned with CamSeannerAssignment Model = A eallege deportment _cheiernan_hes i sable < car - teaches for all courses: offered. by his_ depas = | nighest possible Level of educaliene! quelity- He hasigot the khroe__professers and one» beachingassistont CTA. Four | courses must: be offered and _ofter apprepaate fokro specken he hes antvad ak te palléietng caleba. and _evalvelton ‘ h. - waling "¢100- best rating) rogarding_the obility of: ead of. hi Lhe tour courses _raspechvely . How should ' he assign Nis statt be the courses bo maximize edueaieral quality io his deporkment ? : Course t | Course 2. | Course 3: |. Course 4 Grok a bo “40 60 #0 Prof 2 20 60 So +0 Prof 2 20 20 4o 60 TA 30 40 80 40 » Given problem is a maximizaben problem cs we hav® FO mnaxiqni 2 the voking- Conveding bo _minimizatien problem by sublrading - each element + from the Sorgest one / 70) + beds Son 2 __ | Corset Course 2 uxse 3 Course & Prof 1 10 30 . +0 ° Prof 2 so. 10 20 ° Pook 3 50 4o 30 40 TA uo 260 4O 30 || Using Hergorton method, ‘Scanned with CamSeannerGoing _yow-wise _sublraching smallest valve. [ Courses | Course 2 | Ccurse3_ | wee 4 ours Prof 40. Boy to ° Prof 2 50 { 10 L. 20. ° Prot 3 uo 30 I 20 ° _ Ta to 30 jo. j oO Going clumn-wise sublrading smallest valve, Course L Pro Pcof 2 x | Prof 3 © [1a Kj w | @ Koss | The problems hos altoined epimal _soluken . the ephmel__assigament | schedule 1s + | Prof’: assigned =to wurse Lt . { Prof 2 assigned tv -Gurse 2 i Prof 3 assigned -to~ use a : i TA assigned to Gurse 3. laiso : a In _oviginal mobi ~ Course 1 Jew Gurse3 | use 4 Pops | 60] 40 60 30 Pref 2 20 | .6o~ | 0 a eels: | Prof 3 20 30 40 bo mang = 6060 TA 30 20 Bo~}| 40 eco I i ‘Scanned with CamSeannerA_compony 18_faced esith. the problem ‘i job only), arent jobs Cone machina te ene je snly ~ y heal | the profits are eskmotad. os fellews then find the ephe Schedule ta maximize the total prefits . iL Machines © e a Tobs A Pe | a 3. 6 Qu ps6 <- = “4 | 2 z 4 4 3 9 @ f\s cm a 6 4 2° | ke [_s a ees é s | 6 I ; 2 2 ss Here, = = i. ||. eumberol faune BO Ga niAbara aldmne ca IIeo, ‘oddina”: bios wresd coluenns “bo “aware. the - problen’ te bolancéd | teem, 4 laveitin “Anocts rt. 33. A! | Machines f mee [oe le lode ys 2c | 2 + a 3 a | 4 | 4 6 4 a s ° olan enon Now, convarting the maximizaken problen to. minimizaken type by subkoding each element fem the targest (3) mace [Td Sari acRsane' \ g é q $ ci 8 € 18 14) | § | 4 | a gy 3 y | «| of | S$ i ERE Ig y 3 a] ol of al} } —| a ? o gl I i eee ee 3} fl of a] af ola] 9 pp tg & | wl I al J) o| 4 o } Sete ftoteh toby. gt 7 8 { wl |e 4 rl | We £ 437 f g 3 yg] 9} 2 aq} a] g 2 3 ' e I s/o 3| Ve g | é g £| ofS 3 4 774K gy 4 al (3 Fe] wl a} uj o] %] © 3 2 3 x | i & a] Sa} i —+—| 5 é Q 8} 4+ +++ _| 3 st I 8 ula | £ | 3] 4] a & 3 BL 2] Tal siu lo |S | 6 Pala? ae ‘Scanned with CamSeannerNow, subhackag Loos elemect cuhich ip_nok-eo the || fem the elements nek en ony Bae ond _edding - Machines i 3. x © x= fee | @_ 6s ja steers 4 s © wip Me sas 2 = La cine oot s 4 aot. 3 x © este 3 1, @ 4 2 2 | Here, the problem has obtained tha apkmal-solukoo,_ Machine A assiqnéd to Job 2 i | Machine @ assigned © Job 3 il Machine. ¢ assigned to Job 6 I Machine. D assigned bo Joby Ht |latso, jin_ewginal mebix. \ = Machines x Tebs. |" Ap 8 Ps - a 3 6 2 a tej 4 3 | alezl]s 4 6 14 3 s s 4 § r silt] 6 So, logest profit = 3+ 84446 =. OP i] ‘Scanned with CamSeanneraa Solesmen _ Peoblaens a ll up A_maochine operator processes /five) types of items on his “atti och week and must cheese 0 seguonce for them. The sot-up cosh Per chenge depends ca the ftems presently on the |machineg end the sel-up to be mede, according te the _fellewing 7 ioe a ul>leP> oe 16 |f 2 oO |e |m Dp a a | oe (eee o | 4 4 2} Th he processes each type of them onco ond only oneo each uxck, how should he sequence the thems an his methine? Using Hungarvion method = - 2 2 J t Going row- wise _d subhaching pease clement in each, | ate c 2 | nfo 2 4 fo ~ = =F | 8 4 °° 3 o = a | c a oO = = DB ° ° 4 2 Going column-wise subtachag eost alenent in each, A 2 c 2 a wp |e +1@©@ Seqvere > a A @Q| xX AVO+A I c + |© cof 3 »>|Olx [ale oat [| 1) ‘Scanned with CamSeanner= - ati: problem: Ooh. as Ris ig an optimal soluken _ of assiqnme eee o been processed, th tg dot be ophn |_net ol) the items hav solutien for beveling salesman -pecblenn. SE Now, 7 = : @ and vi l Least _n00- zero clement 3 L,= omibing columo "08 ay : ‘ oo exboded mohix 5 A @| cf] 9 a @ | -+--@ : @ . << 4 Do + = THis is the oplmel soluben (ar assignment preblem of extocted mohix - & Plugging it beck to the- origina! meabix from ushich ibwos extracted, A a c 2 a @ylawas a a o | © |" I c i ew ~ |© I >| ©| KI ele if ‘Scanned with CamSeannerRenee, ne _ bavelling salesmoo 9 SMO so os also _qek oplimal . fer_total cost minimum); o t Origine! mnalrix, [ee A a c D 3 3 @ oa fa ]4 |e fe | z i So. botal “minimem cost = Ut 6+ 4+3 = 20 y ‘Scanned with CamScanner