MODULE 1 {2MARKS } Q1.Define the following terms i) Feasible solution:- Any solution that satisfies all the constraints of the model is known as a feasible solution. Ii) Linear programming problem:- LPP is a problem that Is concerned with finding the optimal value of the given linear function. Optimal value can be either maximum or minimum value. Q2.Name the main phases of OR Ans. Main phases of OR: . Formulation of the problem . Construction of a mathematical model . Solving the model constructed |. Testing the model and it's solution . Implementation MPona Q3.Define the following terms i) Basic feasible solution: Basic solution is called a basic feasible solution if all basic variables are 2 0. li) Degenerate BES:- It is a BFS in which one or more of the m basic variables are equal to zero. Q4,Define the following terms i) Optimal BFS:- A BFS is called Optimal BFS if it optimizes the objective function. ii) Feasible region:- It is a region in which all the constraints and non-negativity conditions hold good. Q5.Define Linear programming Ans. It deals with the optimization (maximization or minimization) of a function of a variable known as an objective function. Subject to a set of linear equations and/or Inequalities known as constraints. Q6.Define the following terms 1) Unbounded solution:- If the value of an objective function can be increased or decreased indefinitely, then the solution Is called an unbounded solution. li) Corner point feasible solution: It is a feasible solution that doesn't lie on any line segment connecting two other feasible solution. Q7. List any two requirements for the formation of LPP Ans. Requirements for the formation of LPP: 1. There must be an alternate course of action. 2. The decision variables should be interrelated and non-negative. @ scanned with Oken ScannerSinarks \L-A A Fermer has 100 cere farm He can sll ll tomatoes, lettuce and vadlihes and con get & price of Re.1 per kg Fer tematocs, Rs.0.75 « heap for lettuce and Rs, 2 per kg for radishes. ‘The average yield per acre is 2000kg of tomatoes 3000 heaps of lettuce and 1000 kg of Radishes, Fertlaersare available ct Rs.0550 por kg and the amount required por care is 100kg each For tomatoes cnd lettuce cnd 50 kg For radishes, Labor required for sowing, Caltivating and harvesting per cere is 5 man/days for tomatoes and radishes and 6 man/day for lettuce. A totel of 400 man/day oF Icbor are evailable at Rs.20 per man/day, Formulate this problem as linear programming medel to maximize the Farmer's total profit me 2 Soe het Oe oe he lhe Chee o4 crank bo grow ctomato es , LetHuce | sali hec ets cfeoumer feces 2000%, kq of tormorlo ex 3000%, kq of Lethice 1009, kg of ead hes Wolo sales of the form & RsC 2000%, + 0.15 %3000%, + 2% (000%) ARAN expendi wit! be 0-5 [too Cx,+ m3) +50 x3] 5) habouk cost Rs 20 Com, +t 6X24 SH) we Gowns fray un be Ze Soles — Fx puro tase (2.000%, + 0.15 *3000%, + 2% t000%5) — [0.5 [roo x, + Xo) + 50%3] F20[ 54,4 casts] 2.000%, + 22CO%X,+ 2000%,- ee ie a eg Z = 1950%, + 2080%, + 1IB15%5 Gly Ueto Ae ede ing ate, Ht Xr t%z, S100 Totod — rrom ctorys labout & W N Sak vedrictea to 400 man tay s Sat 6X2t 5X3 S400 @ scanned with Oken Scannergivally Ze [$50%,+ 9090 %y t IS 15% subjed bb HF RH Hy Lo 5A t Ow +5 As S400 wel Wy 1% %3 70 ® oe heme } young hows y+ # 5d hems om tea 3 “ags pe week rel eon how ow lag 5 eggs pe week Cmte each ugg ost Roo 1 Old hes ate cold fer Ré6 dq hes oe tot fer RslO Cost of tach hem RSH a proftr om old hus = Rl ym Pregl o> ung Kev = Bs 5 we Max Z= Xt 9%2 Ota hens com be brought eel Rs 50/- ang ee) hows tam he bought od Rloo peso ° a havary &2000 it 50%, + 100%. § 2000 een und house more tthe 40 hes Tt / Xp + ALS 40 Bp ally Max Lax, +SKa Sudjed bb S04,+ toox, $2000 H,+%, L4O Ae Hy HX, %O @ scanned with Oken ScannerTMWod L 3.6) Te Onifeh, natuse od eo aboed of OR he Oxfdem of ORS - yg 3 4 L o ° Ce |e | Xe x, Ls Sy es 0 gr $ ( 4 ( fe) oa 0 $2} 4 { 2 o \ oa zy | 0 0 oO ° B-G| = cere Ap o ° Ze CoM b= K0/ toy toler Ss, So ee %, 8 t O 1 y Vg e Os \ ( 2 %/220 @ scanned with Oken ScannerGg 3 4 o Oo Ca | Ye | Xe x, mS Sx Qe 0 Ss 0 -1 0 | -2 a As] oo Vo. \ ° Vo g 1S Ay 4 ° WV Re Gf = 34a ° ° Wo Now element 2 old element — etc eclea lil Key element To apply thir formucta fest we fr the ellio element to be male AU chem tebe macle AO key homout Corce P- CP FO then optimal colt zx- 18 , hye 0 od X52 @ scanned with Oken Scanner3% we LPP ky Brn blax meMoh E Max R= 8%, toy o STo, Ww + HX. <4 Mm HK 60 Whe %1 s Ayo Pobjeehe functiin to td Upp Ka Wy t2x, FO-Si + OSa Ste, Kot KL Spey Xo - xX $3222 XH, 5 %5,S,, $2 20 where Sy ond 6, ake bate varies med hy » Kr ake nom baie vatabi, matin form + - Hy x, 8, of o 4 7 ' ( 1 a “| boro ths a J © Batted tna plex lable Cy 3 2 0 oO Col ie[ke %% %, Sa ol s, | 4 | oT ° 4 % < oO So} 2 fo -1 oO \ 2 Ky 0 0 0 Oo oO Zy-ocy | -3 -2 oO oO # a) aye CaxX pg o- Ke Korg Cola n @ scanned with Oken Scannergg 3 2 o } ; Ra 7 Ce | Ye Xe x, a. gS, + e 9 | *s, 2 0 Bl | 4 Ls S| % 2 ' = } ‘ - ay 6 3 -3 2 3 IeG|_ - 0 -5n 8 3 a woud New elemads old element — [Product 2h een ees He 4 Kee @ scanned with Oken Scanner@) Use Two phase snethad to Solve —thy poll Lp max 8Tc, where ‘oh nox ste, Ze FA, —4H, $3 HG 2A AA, — bA3220 CA, + TALHORZ LTE SX, — 3%, 4+ 6%3 £50 Ky ky XO TAL 4K, —6%5 +A, =20 CK + Sz HOKZ4+O 16 BH, -3%,4+6%3; 45,250 whee %iy Ky, %Xsr Se, $n A OO ZX = O% 4+ OK, +O%3 408, +063 ~A, oS? o , 0 o 0 0 Soe Ce Ye Xp ey Ky KS SSCA, © “tl At Lo 2 { -é o oO 1. 0 Ss, 16 6 a lo q o oO < 0 8, 50 -3 6 ° a) Ry -20 -2 ad 6 Oo 0 1 g-of| ~- <%=! 6 0 © Zf = Cyr Xe o> Xe key Coluson G 7) Ov o 0 Oo | Ce Ye Xe Ay ts %s S, Ss Ay © tMODULE 4 Q1.Define feasible solution w.r.t TP. Ans. A feasible solution to a transportation problem is a set of non-negative allocations Xij that satisfy the row and column restrictions. Q2.Define basic feasible solution w.r.t TP. Ans. A feasible solution to a transportation problem is said to be basic feasible solution if it contains no more than m+n-1 non-negative allocations where m is the number of rows and n is the number of columns of the transportation problem. Q3.Define optimal solution wart TP. Ans. A feasible solution that minimizes or maximizes the transportation cost (profit) is called an optimal solution. Q4. Define non degenerate basic feasible solution w.r.t TP. Ans. A BFS to a mxn transportation problem is said to be non degenerate if, (a) The total number of non-negative allocations is exactly m+n-1. (b) These mén-1 allocations are in independent positions. Q5. Define degenerate basic feasible solution w.r-t TP. Ans. A BFS In which the total number of non-negative allocations Is less than m+n-1 is called a degenerate basic feasible solution. Q6, What are the three methods for solving transportation problem. Ans. i) North-west corner route (NWCR) ii) Least cost matrix method iii) Vogel's approximation method (VAM) @ scanned with Oken ScannerMODULE —4 mM Ow Cem th by tee Aseg north —west comes iit On Clei oa tag ke, Sale e | o: BH ota Le \|4} 1} 7 tte o2qry e Demo t 4 1 teas bodlaction cost = AXG + 3X2 + 3%6 TAABT AKY + 2X 14 stor No. of allocates mt n—t ee4+3—-1 6 <6 Qwen problem ue banca fearcble . @ scanned with Oken Scanner2 (B) Sowe tre TP by wudg least cosh Mot ok mathe BD Supply 614 Vij yu. € 4 {2 {7} te ts [3 [fe ey s ; Dewnd 6 to is 4 soe sp 8B co D_ MPry M Ss F Wo pray yp] ue o 4 2 Bao” [s=p Pemand foe 8 | yoo3s brannthotlatien woe (X19 42% PRU ARIK EERE TING Tc =156 wo. oh atlycaten = m+n ~] 6= 344-1 6=6 ve Tee prem problem & base foacble, @ scanned with Oken Scannervar re mi Demure the optimum vost foe “the glven “on problum. a. r [3] 26 widow 3 [284 [ae 33 | 19 13 | 1s 9 [26 [ox [io | Wo Ee Steph sete minima valas Lv eaur row & stepQé seled mentmum vale ww Carr column & * f + wkKor, fo uteecporduig fol ca) . aa ‘i , owt : the wliwn wns a age xAuLo oF Com TRE ola wR e E sepeat ab above. tm Ase of Me Ker oubitey @ scanned with Oken Scanner(») \ leone 34 fol} wij a\s 4 ata 22 || 3 | ‘x a_| 12 | 4 | Pol A-\=iq B-32y c-2 214 b- 4 elO WI unete cof (2 | 4] uy s|to|7|\ 3 tofory fis | ot $ Ss u f4 to + 3 Y aAvto} > ]tq fu a] 5 | tol 71s | Chia fry | Lu S's) so \u 4 @ scanned with Oken Scannercoves enctig fob of UK OY - u presen oe the column Conca column uw, eagle Riko above Ww ame “Of Mon eit 4 . ! S 3 ° Slep 38 Som Me wows 0% Mage AO ly Ass th nso he 3 fay @ scanned with Oken Scannerieee the Jolt by Hrd aston Metroct , s |3 Lt | 4 Sept So Selec may value m each sow Sy olecueh — ftom ol the elemends tn —thak row, I] -|~ =| ¥] »]- Dal a| & 4\2jeo\ 4 6\c o\4y rs 3 \'| 3 O° no a ! Et Cp 28- seted te pray vol An each, column ctf ardiut UU from True climes ma[2 ole fs \ 1 o\3 2leoli|2 fe |2\|2 10 u jo \fell«¢ Ss | 1 | ki 3 > | fl) | 2 fo] | > | >| @ scanned with Oken Scannerotip 3 6- “ “‘Goonasck The CU) Mosk the anode 6 OW aol column — howing Auto GD AK Te wows eet alpen column an maock(f) CV) Drew Wns rough — mothe! Peet wamasiked sou “4 pune ral ele 1-0 5 7 H 3 \~O fob fy bf} © Stepti- Caled Te smallect — elemevd oud of The wnvwoved elements ond gubtrad et fro on unroveced clepents and add of the eure ecken ° bows aie ely \-oO 3 \5 [ol 1 -@ ~3—+fo} ‘ eH | i) at (| w |@\2 |r | >| |B lel |e. « r | {4 |» IPs (Bl> [> |e [= 16 @ scanned with Oken Scanner(1) Siege tovelned 8. yen Stepl 4 Fund the b cost, namely tha biffete blo The tallest Bwrdd axd fo tmabiect costs ty eae OW and column Step 21 Prneng he penalties on pore! i step t, chooge —the mak tmun pevallg . yy ths Max om, penalty % move . Thom, Eo (fe, ‘| Theee ew tee ) » Choose any ome as teltat ty Sp Bt Ln The ste fete lume ox by Sep 2, pd oud “Ine ed having the least cost, Mlocate 40 thik coll ce much ae poeccble , depending on the patty and beg ch we Steput Delle Th sow oF column & wy enhauiles} » argo y corn ple the oa bow pemalhes pr she’ Coelaces “amsp othe, abe and Then "° te Pep Renee peo cece unt) all The vim Logue emravits ake cake fd’ @ scanned with Oken Scannerhaves pb A & cf a! u 13, 4 14 loco te | ts | WY | 10 [300 D1 | 24 1a | tO | Yoo 200 225 2915 250 : AB Cb ply | Pl Pale, |e Fy tal ty ELS of? || f=) _ eLEEee ge | ia la ly Cy oe | \ ) >} Lek SL yoo |3\3 3 3 Woks tg | | | o i t 5 | i a ee) a - 64 \ 0 TPIS pttahin cod = \Lxp00 + 13%5O 4 (8KITS + loxng 4FNOKL2S HUZXBIS 12075 Allo ah emtnat Ge 344nt o. of 676 @ scanned with Oken Scanneryet tom CG) a Tet peta” Pla. Cov) Med? ! Method (Me adia Drcthch eee method ) MODT " Sy ane) te Method BES ob the gue pre bay NweRr Cow) Lo m f oe Vamw. Slup2# Che de “fhe no. of occupies) ells . Bp Thue cue lose fon m+ n—l these emus degenrcacy dt we aatroctuce [o vewy rnall ve andnmd of €C0) to Ratha le leo vodipendind pottiins , £6 Thed “he ner of oceupd calls ie coca chly eGo to mtn —) pS Find the seh of vakser Ue ,ve (Ul, 2,3-.0 m [jets > 3-2 1) from Te welaten Cope Kiev Foe each ocuspid ott C7) by thamtes nthlty Nor ues oO lor vp 0 for ew ner The Lorret french Low ov wl, awe Maximum ‘no of Prbivecluar blot Rapit fo tre coll waluchsu upd? for ea0h wrocenrpural "feat Ce, yj) owed eden at Te Uppy ght coiner Of e. saan cnt Cen). 5&5 Fics the 2 Walvohins Ae alee —Cue t YP) (Ay 2 Upper Lft- “pp Mart) for eaun cusped all ep "y ond enter The vec Ueynrr wrnce 0f the eae att (25) GP alt dep 70, then the tol” molec thy test U oftninay (one umbue - @ scanned with Oken ScannerGY all. dep 50, wth alent one atps0) Trin = Te col cle te est opment ad a _ as bMematve ofmal col” exite . I . re Ci) Yo eteat ome alt LO. Them Ae SON) 2B) ohne [Go to weet stop - i oom a wew BFS by quinn mag ater to he 7 fell fow which atep & mech -ve by makig an Step 6 = T -. copia tall empty. for ted, draw a ctosed path © ~ lencEckig Of Keetzcrdod mal verhted her begmnntg — ~. end enctidy at The ll for wowth dey & moet | ~, Wve and hawerty th oThee coenees at dome allocate) fells. ong The Uloled loop Unda +O art 8 laHerncdtively at The cotners, Choote minimum of 6 from the Wis howdy -@ - Bdo thc md of 8 fo FR alte eth 48 cl Abstr Tak mendnum lof © tern the atloudn to the ctl udh 9- i 18 Sapo to Ce) to tet tre ophd na ES Be E ea new bam feasthle oln Sap St Corbin The above, bol* -& attarned, Psoedute fell cm obhioum @ scanned with Oken Scannertor MOcate 4 \ @) dole th TP by MODI metnoa eeey 9 \s Demond Soave apply! Py] Pa) Ps Py so} 2 A) 4 | a) 40 40 @g | OG, |. | 10 | 30} Yol 6o | 1 | 20 20 20 | | O| fe | 4h aa At In| 20 50° - Dewerd 8 TU, | e r 2) 22410 10 | Po DIA — 10 bo [ | P3 — _ 10 to Py - — lo 50 Troasho elo? cosh = 8x94 14x 5 420K10 t1O% 24 4OXT+EOXKD tes 114 Wo. oh wllorsten Smt = C234uc-t 6-6 1 @ scanned with Oken Scannerpot Arete allocated cell mod rine ond s o ; hed U % mcg cy = Ue ry ‘ Cu Cy Os Co i 1 ta | w] x | 10 re f° >. es (exfas me |X | 4O} 60], =40 re Ice [a [Os eae 8 ao x | % |x }20/U,20 —» Mi Vee VB Ve = g 20 20° Cif = Ue Ny Cay = Ua ts 20 = 0 +4 Vy = 20 Cage Ur4V3 40 = 4OwN3 V3=0 Cay = Ur* Vy Cy = Vit Vy 60 = Ust20 (0 zUi+20 Cae Oat Ve Cy ere G2 O+Va i Va=% Ue -to¢+V, Step2 v- Ceok ay her wr alle ated bell mod nx x |30 [50 | x qo |30|x |x 40 [xX {10} x Step 3 o- Unate Uist Vi fos umallo wed call XK PrBpPol x VU, te 64] 4s] x] x JU, > Yo 291) x | O x JU3 70 Vi Va V3 VG #290 --$ +0 +20 @ scanned with Oken Scannerx[x | a 21 x x | &[ x iO Teonspoatar cot= 5 XIQ4 2x04 ZXBO FTX 4O + Gx SG 4 (2x20 @ scanned with Oken ScannerMODULE § Q1. Define payoff matrix. Ans. A payoff matrix is a table in which strategies of one player are listed in rows and those of the other player in columns and the cells show payoffs to each player such that the payoff of the row player is listed first. Q2. Define game theory. Ans. It is a type of decision theory in which one tries an action which is determined after taking into account all possible alternatives available to an opponent playing the same game. Q3. Define pure strategy and mixed strategy. Ans. Pure strategy:- If a player knows exactly what the other player is going to do, a deterministic situation is obtained and the objective is to maximize the game. Mixed strategy:-If a player is guessing as to which activity is to be selected by the other on any particular occasion, a probabilistic situation is obtained and the objective is to maximize the expected game. Q4. Define a two person zero sum game. Ans. A game with only two players is called a two person zero sum game, if the loss of one player is equivalent to the game of other so that the sum of their net game is zero. Q5. Define optimal strategy. Ans. The player playing the game always tries to choose the best course of action which results in optimal pay off called ‘optimal strategy’. Q6. Define saddle point. Ans. A saddle point of a playoff matrix is the position of such an element in the payoff matrix which is minimum In it's row and maximum in it's column. Q7. Define value of the game. Ans. The payoff at the saddle point is called the value of the game and itis. equal to maximin and minimax value of the game. @ scanned with Oken ScannerEO SAUALS | SM © Rules ad sedeunegeahe gaddle pout (1) Select lhe mantmum elemerd of each wow of he pay of modrx avd mokkh ile, (2) seted the Set elemedt of each column A} Te pay off male aed mack Lyrae (2) Sh Thste appears are cbermend Saw “the of enodet wth the matked Utele and «, The posithinn of The clement KX Sadelle pot. >lololsl|2]| 3 2 \ 212 -4Y|}-3| 0 \-2)64 [5 3B \-4 |2 |-6 Soo ae ahem ea 1 €) 0 © [] 3 |> a 3 2 @ 2 olf Y= manctinin = bp E -3 6 -2 [fAf-4 y @ GB + 2 Cdl-6 peat creer Satie, Je mmimax = J (a) Optrirol strategy for ply A i () Ofhmal Stwodegy fot play B & fh (2) vawe Of The game for ployee A Bod Sy “1 fr pay 8. @ scanned with Oken Scanner(OM © pa oftivy Shactegy foe plogee ), Ofsharen Seating for player By value of the game an ae * Loy (var Ye) (Y4¥e1) a iM Ne ®» |Vo | @ scanned with Oken ScanneroO (4-3) — (6 +2) veO vale 9. te % 0 dy Je Ale | 6 de 212 “Hl, EA, 70 —O 44, +6Y,=0 —& 6x) 347 0.0) 24. Yr =o —O Om ee ee Ap alo Rs Frvet-Jo > O24 ms) $2 ay = 0 Om urge) + OY, 20 YP UK, 24420 aie HY + 6%,24 oy lal 64324 (oJ,=4 ab ae Ie > Ye | Met 3 Jel aol 2 ed Ir D.S for Py O.S fox Po (leg >» 0, %) O36 5 Hes 10) @ scanned with Oken ScannerSisowe he you" enovtienen D™ “problem 2x3 Tome dep rT Date Ls jis [2 oy [3 av] [Nu Ma Cu Voa)— Win Vo) [5 2 [Nox [Noo] CVn + Yoo) —Oio+¥ys) ; = (3 xy2)-(Ux5) _ 6-55 _ -44 2 4G (3 +2) - (145) 5-16 =u uw BB [ ats} pol 6 )ol 3A, + 5 Aa = 14 —O BB, + NB tV —& WA, + 2A, =49/t) — © 68, +28.= 4M) — : A +Ap= lt Bix Ba = 1 —© Oz Pyel= Ad @=_p> B= \- By @e= 30-82) + 18.=% (= 3C1- As) +5Ar=4N) 3B - 3A, +5A>=t1WV) 3 -3Be tM Br= IH B+ 2M. =4Vi B+3B,=4%, | a= 84h Boz Vy Apa t- My Bai My | Are 3M1 B= AW @ scanned with Oken Scanner@ scanned with Oken Scanner