First Progress Reports: 20%; second/Final Report ; 30%; Presentation ; 30%; Viva : 20%. 8. Project progress reports should normally be no longer than 250 words and final report should not be longer than 40 A4 size pages in double spacing. Each final project report need to contain the following: (i) Abstract {ii) Table of contents (iliJReview of literature (iv) Main text (v) List of references. It may be desirable to arrange the main text as an introduction, the main body and conclusions. GUIDELINES FOR STRUCTURING CONTENTS ‘Sequence of Contents: ‘The following sequence for the thesis organization should be followed: 1.() Pretiminaries Title Page (ii) Certificate (iii) Abstract/Synopsis (iv) Acknowledgement and/ or Dedication (¥) Table of Contents (vi) List of Figures, Tables, Illustrations, Symbols, etc (wherever applicable) (2) Text of Thesis Introduction ‘The body of the thesis, summary and conclusions (3) Reference Material List of References, Bibliography, (4) AppendicesPROJECT (DSE-1V) Guidelines for +3 (CBCS) Under Graduate(B.A./B,Sc.) Mathematics (Honours) Project 1. Any student registering for doing project is required to inform the HOD, Mathematics the name of his/her project supervisor(s) at the time of pre- registration. 2. By the last date of add and drop, the student must submit the “Project Registration Form”, appended as Annexure-I to this document, to the HOD, Mathematics. This form requires a project title, the signature of the student, signature(s) of the supervisor(s) and the signature of the HOD, Mathematics of the college /university. 3. The project supervisor{s) should normally be a faculty member(s} of the Department of Mathematics and the topic of the project should be relevant to Mathematical Sciences. ifa student desires to have a Project Supervisor from another department of the institute, the prior approval for the same should be sought from the HOD, Mathematics. 4. A student may have at the most two Project Supervisors. If a student desires to have two supervisors, at least one of these should be from the Department of Mathematics 5. The student(s) willbe required to submit one progress report and a final report of the Project to the HOD, Mathematics. The progress report is to be submitted in the sixth week of the semester in which the project is undertaken. The hard copy and an electronic version of the final report of the project should be submitted two weeks before the end semester examination of the sixth semester. In addition the student will be required to make an oral presentation in front of a committee (Under Graduate (B.A./B.Sc.) Mathematics (Honours) Project committee of the college in which supervisor is one of the members) constituted for this purpose by the Department of Mathematics of the college. 6. The student is expected to devote about 100 hours. The project will be evaluated by a committec of faculty members at the end of the sixth semester. The committee will be constituted by the Under Graduate (B.A./B.Sc.) Mathematics(Honours) Project committee of the college keeping in mind the areas of project they will cover. 7. In each semester the grade of a student will be awarded by the committee in consultation with his/her project supervisor(s). The project is evaluated on the basis of the following components :249. 23 279; Ovenscront Rasa, When is the game faict 4 kerne 0a if minsemas waive = macimia value= 0. A brane wherein the gai of one ployer snake ios of wheria col ates pe: ‘One of the methods for simplifying =» » game with minct statezy s Dominance A Fame can have sore then ove saddle point. (Trusitalse) rae A peme is aaid to be zero mem game W all the clemeats in the principal diaganal of the acres, are rere. (TrueFalve) ene True. aaa ae ae bbe salved bby the matrix methad maly if rew sddments = column oddooeen. (Trac! i True. ‘What is the limitation ef the method of matrices? ‘This method can be applied only when the mim of columa addment is equal to the sum of row oddmpests, Le. W both players use all their plryy in thes best straicgice Distinguish between “pure and mised strategica’. Ifa player decides to wie only coc particular course ef action with probability of 1, then the strategiyis knowy. as pure srplegy. I's player decks to play more than one seategy then the player is san io follow a stwaiog: Known as mixed strategy. Here the prtbabilty of selection of the individual strategies wil be lew than one Simulation Define simulation. Why ix it used? The represestation of realty in some physical form or i some form of mathematical equations may be cad ‘umoulaben, ve. ssmulation w imitation of reabty This used because one ia satiated wih suboprimal resus for decmson-caaking and aiso representation by a mathematical model is beyond the capabiliis of the‘unalps Define random mumbce. aoe Random number is 2 number whose probabilay of occurrence & the same as that of any other number in the collection, Define Pseudo-random camber. a Random numbers are called Psredo-randomn sumbert when they are genented by sense deterministic process sand they qualify the predetermined statistical test for numbers This & generally wied to solve problems which cannot be adequately represented by the mathematical models. What are the advantages of simolation? ‘The advantages of seualation are: (a) mathematically less complicated (b) Gexble = f (c) modified to suit the changing covirnamests of the real situation (d) can be used for camming purposes. . What are the limitations of sinmlation? (@) Quantification of the venules may be difficuk (a) Simulstion may not yield optixoum resales. = a ee ee + (0) Sumubstion may not always be less bane onsuming bs ‘The results obtained from simulation models cannot be completely reed upen. ‘What are the uses of simnlation’ (@) lnventory problem: (@) Qoeneing problems (Gai) Teaming programs etc.pines QAETTIING AND ATEN MT 49, t 255. 256: 257 288 259, The time inten between consecutive area peverally fellows exgioentia Satributiom, What do you understand by explosive state? ; 1 > 1oithen the state is referred ix explosive state MUM/T mnodel is alse kaxown as Beth Death Game Theory Define » game. The competitive situation Will be called game, if has the following propertice (9) There is finite murmber of pasticipants called playses (H/) Each player has a finite number of strategies avaiable t6 bitn_ (i) Every game remus in an owreome Define strategy. The strategy of player & the decision mule he mics for making the cheie= from his list of courses of actie. What are the classification of strategy? The classifications of strtcgy arc: (a) Pure strategy and (8) Mined strategy: Whea do players apply mixed strategies? Players apply mixed strategy when there is no sade point Define 2 saddie point. ‘A sadidhe point ts the position in the pay-off matrix, where the maxiomam of row minim comeides with tee sminigsam of colutnn maxima. Define ¢we-persen zero sum. game. A game with two players, where » gain of one player equals the loss of the other is mown a 3 two-peron zero sum game: Distinguish between Pare and Mixed strategies. (i) A-svategy & called pure, if one knows i advance of the play that it ix certain to be adopted ‘erespective of the strategy the other may choose. The optimal siateyy mixnure for cach player may te determined by assigning 10 each Strategy its probabilny of being chosen, These strategies ar= called mixed smitogy. (ii) A pure srateyy ia spocial case of mined mratogy. A player may be able to choone only # pare stntegies, ‘whereas he bad infinite member of med states. ‘Garnes without saddie point require players to play Mixed Hortepins: ‘Sadie point % the point of intersction of pure sratcyies ‘A pure strategy game is one in which each player has ouly one optimal strategy —Trac or False. True. |. Define payor. ‘The gains resulting from & game it called paysoll, and when its poeseate in the form of w table, itis called pay-off imate. _ What rype of games are solved grapltically? The gamer in which the pay-off mamx is of the foren m* 2 o¢ 2 * 7 are solved graphically Define valug of the game. The value of the game is defined 2s the expected gain to a player. What is meant by minimax, maxiain? Minimax ss maximum ofrow minima and Maximin & minimum of column marca, ‘When do you say 2 game is stable! ‘A game is stable when there i a saddle pointOr oumie Ramen re) techmeos & rmeatahy a coanizanoe chee (Truc) (ei WF for am AP aC, 20 tikes nt memprument achodle (1,) which sataies TEC) Ty = 0) mutt be wena (True) div) Te tremportacias techesque or ienpicx meshed cannol be used i volve Ube AP becannc of depmnemey Gre) (ey by a terepling salesmen prodiem no assgsaneni shook! be made slong the daxgonal bine of the cot sn (Trwe} (7) tea wezvelling salesmen protien, the salesman camsct vied a cay twice, unl he Kean vised ll the cites once, (Tru) (WH) te AP. if the final cont matrix contains more thas one zor at esdependent postions then the problere will beve a uaages solstog (False) Li. integer Programming Problems 10), What de yeu meas by intecer programming problem? ‘An LPP tn which some or al of the varinhles i the optimal sobisice arc reecicted to asume non-eegaiive wioper valu & sided an ietager pepe probes. 104, Det» pare laure preemie preblen. fall we vanabics io the cpamal solution are resziced to muaummc nor-acgative micger_yalbes thee ieacigee ee 105 Define » mined integer programming problem In.an LPP. if only some of the wariabler ithe optimal solution arr restricts to serum non-pepative integer valves, wink the re-nmmung vanabies We fee lo tabe any. noe-Regative values hen i is called amoiced meger Progamming probes, : 106. Differentiate between pare and miced IF. toa pare IPP all the sariables. ix the optional solutes we recited to ermine non-negative mecger valbes Wheres in mized IPP, only some of the variables inthe optional colton are rentricted to aasume mon-nepative integer wales, 107. Give some applications of IPP. (0 te prodoct mnie problem (i) Sequencing and routing decisions (2) All allocation problems ivolving the allocating: of goods, men and machine. 108 What are the method used im setving TPP? ‘There are two methods, namely, (A Camng: methods (Gomary’s cutting plane slgocither) (a) Search meted (Branch aad bound technique}. (09. “Explain Gomarian constraint or fractional cat comtraist. Also explain fu geometrical luterpretation. A pew consizmant introduced to the jproblers sock that the mew set of feasible solntion includes all the orgmal ‘Seasibic insoger sobitions bast doer not include the optiumn non inisger solution mitially found. This sw ‘estatrint & Called factional cet or Gomarian's consraint 210. Why should the optimus yaines not be rounded off Instead of reorting to Integer programming? Explain. If the non-inteess variable in rounded off, then it vinlates the feasibility arid alo there bs no gaarantes that the “rovaded solwtuen onl abo be optmal. Example Maxon tae St, Sulgat to, Sep 74SSues QuesniOns an Axwmras a 89. 91 £223 tor State the difference between the T.P. amd the AP. ‘The major differcaces berwcea TP. and AP. are, (0) The cont matrix i TP i not necessarily 2 square tacit, whereas in AP, itis = square matin (Supply and dematd a any source and at any destinstion may be postive quantity , 4, an TP. Whoras in AP itwillbe lie, a, =§=1 (itt) The allocations 2, in the case of TP. can take any postive valies satisfying the ra requeemesta, whereas in AP, i, will ike only two posnble values 1 or 0, Haw is the presence of am siteruate optimal islutian established? the final com murix contains more than a required number of zeros at iadependeat positions, then indicates the preseoce of an alienate oplitnal sobstion ‘What Is the abjectioe of the travelling salesman problem? The objective of the traveling salesman probiem is that the mlerman hes to vis various cies, not visiting the samme plice twice and retum to the suring place by spending minimum transportation cost How de you couvert the masimimtion assignment prablem inte 4 misimiztion onc? “The maumizanon AP. car be converted man minumcization sssigament probiem by mbtracting allthe slenents 1h the given profit matin from the highest ckanca! im that mati each entry is increased by 3 in a 4+ 4 assigumest problem, what is the effect on the aptimal value? ‘The effect in the optimal value when each eomy ts mereased by 3 i gma by New optimal valve ~ Original opcimal vase +3 «44, where 4 i the onder of matris. » Give the linear programmisg farm of the AP. The AP, can be expressed as iia where C, is the cost of amizting /* machiee to the = job, subject to the constraints { if th machine is wssiged to the job Kyat Oifoce ‘Why ft AP. 2 completely degenerate form of a TP? ‘Since the units avadhble at cach yource and the unis demanded at cach destination are equal, we getexactly one ‘occupied cell im each row and each column. Henoe, we get oaly occupied cals the piace inthe required n+ m—1 = 2n—1 occupied cells Hence, an AP. i a completely degenenite form of 2 TP. ‘The optimum assignment schedule remains unnoticed, if we add or subtract 2 constant from all the elements of a rom or column of the assignment cost matrix. Is this statement true? ‘The above statement true, optims] schedule will not be altered. But the optimal value will be changed (refer 10, No. #1) What is the name of the method used in getting the optimum assignment? ‘Hungarian method. ‘When is an A-P. said to be unbalanced? How do you make it balanced one? Ifthe cost marr or profit matrix & not a square matrix, thes the problem is said to be wabslinced. To make it halaaced, we add 2 row or column accordingly with al he catnes zero, AN AP. is a completely deesnerats form of a. AN AP. represents a TP web all demands and supplies equal 1 The transportation technique or simplex method cannot be used to solve the AP. because of Desencracy ‘The AP can be stated in the form of a x * » matrix (C,) callod Cost matin or effective mati ‘How do you golve as A.P. if the profit i to be maximised? The given profit matrix can be converted into a loss matrix of minimization type by subtracting all the slements from the highest element of the given mari. For this minimization problem, apply steps of the Hungarian method to get an optimal assignment0 Ovmasrene Ramsey, 7 Lan Se mee aid Lemstesons of cng North-west corner nie Meri The method i easy % Soliow Secmme we toed not comer the batepotabion cost ae ee er an at be ah esha sae sen eve bo ls rite comaiermg tte cout of wameperacion Wile performing opemnaley lest # may sen sane leans to yet Be opnmal seks ‘Nogel's approsmmanon method revaits i: thr mint eccoomical iitial tmuic Seanibie salmon, Why? ‘Yeu tls wae bs this meth we take ie accom st only the Feast cost but also the cont that ust exceed cz The method cometenbjy miter the mumber of teamce mparad ip errer a tbe opcomal wobstom Alc © pov ur optimal sobition fal eax: at rome, he the opti! woe 7, How will yoy Aen at a. TP Seas po ue terms cpm solute? ‘Whois peciocmeng oprimality tex. if some of A wake, where, = C, (x, + 1) for conpty (non-bamc) ext ss mern, then it i the indication of an shcmane'solitios. ‘The semiber of pot-eeme: veriabies is the becbeccod’ TP wink oe pow and = colames i see — fom ~m— 1 ‘The momiber of non-bas varubles i the balanced T?, with 4 pows aed $ columest = 12 tn the north-west comer mule the demand in the column is saicfed oe nest move t the fight ceil in the ex column Bor any TP, the coefficients of all x, to the comasaines arr sney ‘Ap optmum solstice remus when net change valbe of all unccupie! cel art pom-sepatee A clusion tha sation all the conditices of soppy and deruand but it cy or easy net be cpsimnal cali = uniaal freebie bye 80. Depeneracy in wm «0 TP occurs whee the eomher of cocepind cel a kes than SL ‘When you sry thar the" covupied col ini inciepeecemt ponstcn? ‘nm cocapie cell @ icepemsest poution, whee to cleerd path can be deww frum ihe allocations, 52. The bersportion apical ls resresed te deating with gle commodity amis. ls true or Galse (False) 13, Ba constant vahie we abe te every cost element cy dhe imaporumion table, the apemmal veloc of the varie #, wil change Linus or be: 4 (Fae) eae 4 ua 1 3. Transhi ent and Assignment Problems 4 What bs an auipnment probies? Give owe applications, ‘The probiess of aasigning the numberof jobs to equel aamber of facdines (machines ox peruces or deatmations} a roniemarn cot or manner prod is called az assignment roti Appllcatians: a) Mi pte hare to be ante ton woven ce mactines wit sr cost ar coat tne of peteming the jeb, we can une smnigumest trade! © ps EET com Ub) Tewveting salesmen problem, it, a micumas bas to ant 2 sumer of cies, not viniting he sree cry free and eure to she staring place 45) What do you mean by an uabalanced aesignment problem? A the mucabcr of rows is aut equal to the murmbet of cokemats @ the cost mamnia of the atagesmert problems 0° if ee cone mat of the green anprences probiem w not a square ramet then ihe grees aaron POODLE wuaid to be wnbalamocd. 86. Why ca the transportation technique or the simplex tacthod wet be waed te salve the assignment The wamiportanioa tehigac of earpice method cannot bo war! We aoive thr ausigrment proiem Dacass of depnereyeos QuesTina at Avs Transportation Problem 9. What do you understand by transpartation problem (1-PJ7 TP 1s. 2 specual class of Lincas Programmamg Problem ia which we mmsport a commodity (single product) from the source Wa destination so such a way tat the teal traesporation com i mines. (6, Define feasible, basic feasible, non-degenerate solution of x T. Refer wo the defitoms i the chapace 1, Give reasons an to why the LPP sobition techniques are not made tse of while solving a TP. As there arcim + m— | cqustioes ina TP with m organs and m devtinations, by ackling an anificial variable to ‘cich equation, a large number of variables are invobvad (0) Wche problem fas a sourpes and» destatons antim + = — I equations can be formed. Hence. ‘computation may exceed tbe capacity of the computer So LPP trchaique & sot muke wis of while solving 2 TP (iD) The cortficient x, in the conaraints are all in weity For mich a technique, transportation techaique ie easier than: method (4) TP © minimization of objective function, whereas, simplex method t suitable for maxinaication -problen 62. List any three approaches sed with TP. for determining the starting elution. (8 North-mes corner rule (i) Least cost method (Macix Minima) ia) Vogels epprotimstion metho. 63. Define the optimal solution te = TF. ‘The basic feasible solution to a TWP, is said to be optimal, if # minemines the total wanspertation cost. 64 State the mecessary and sufficient condition for the existence of a feasible solmtion te a TF. The necessary and sufficient cosdimen for the existence of a feasibic solution is 2 solution that satisfies all the ‘eonditions of supply and demand. ‘65. What ls the purpose of MODI! methed? ‘The purpose of MODI method is 10 get the opmmal sabition of «TP. 46 When docs 2 TF. haves unique selusion? ‘ATP. has a unique solution, ifthe net evahusticn gives by Cl ='C,— (y, + v) OF all she empty cells are postive, ic, ofall A> @ ‘67 What do you mean by degeneracy ina TPT Wf the mumber of occupied cells i om =m TP i keww than ee} — 1, then i is called « degeneracy ins TP. ‘8 Explain how degeneracy ie a TP. may be resolved? This degeneracy i 2 LP. cx be resolved by aiding ont tmore) empty cell having the feat cont am is of ‘edependest portion wah a non-negative allocation (e> 0). 69, What do you mean by am unbalanced 7.7 ‘Avy TP. sal to be nhalsnced if Lae ds noel ‘Le, if the tea! supply i not oqual wo the tora! demand. 70. How do you convert an unbalanced TP. into a balanced ane? ‘The unbalanced T.P. can be converted into a balanced one by adding a dummy row (source) with cost zero and the excess demand i catered 2s a nm requirement. if total supply < total demand. On’ the other. hand if the total supply > tom! demand, we introcuor a dummy cotsmn (desimation) with cost 0 and the excess supply > eotcred asa rim requirement for the dumazy destination EEOrenarems Risency “$e een ont ety opti i ae tl ble has Ge peal ot. tether othe ai has fg pret oa act gas ee MRE Me ce vanables. aside te eee oem eT Sed supa ce Tae free Beteen ‘regular simpler method and dual simplex method? SS* Fentsdetcrminc ic entering varies and then the Iewving variables while i the ‘method we firs determin the leaving variables and then the catering varnablex ‘Mwhat de vou mica by the shadow prices? The values of the decision varie of dtl ofa LPP rapes the shadow prices of a resource. 47 What is the advantage of dual simplex method? Be RDESES of daal simplex method so avoid inrodacing te aici varthcs alongwith hig waruble a8 the °2" type constraint i camvenad into °<" fpe optimality condition in dual simples method. een ‘omplex socthod, ifallZ,~ C, 2 0-and also all r_ 2 0 then the crest solution isan Optimum feanbie tohution. 8¢ of dual seapley 46. 4%. State the 49. State the feasibility condition in Gual simplex method. i eal sinplex method in fining the vara which eves the busi we find Mas: (Z, Gia:k, ako). Where it 90 ratio with negative deaoeninalo then the procedare does not have 4 feaible Soto. State the existence theorem of duality, ether the pcimal or the dial problem fas ae unbounded soluticn, then the other problem has'no feasible solution, SL. State the complementary slackness theorem of duality. (2) 463 primal vartbi i positive, then the comespendins dual constraints is =x cquanion at the optima sand vice versa (i) 1a pramal constraint is sri Eecaualey then the comesponding cual variable & zexd athe optiem and vice ena. 32. The maximization problem in the primal becomes the minimization problom in its dual S3. The dual of the dual i srimal $4. The method used to solve LP without the use of anificial variables i called dus! simples method SS. What ate the feo imiportint formas of primal dul pais? ‘The two important forms of primal-dus! pairs are ()) syenmetric form (é}-now-syimmctric fern. S6 Wither the primal i the dusl problem bss an unbounded soliton then the ether problem hae no fesse solution. $7, if'a dual cometrsint i¢ strict inequality then the sonesponding primal verable ix zerp at the optimum. 7. Revised Simplex Method $8, What are the advantages of revised simples method? 10) There is fess accumulation of round-off errors, since no calculation is done oc a cokimn unless it ready to enter the bases aay i) The data can be stored more accurately and cormpactly, since the revieed samples thle works ooly with the original dats. (Gi) This method is more economical on the computer at it computes and stores enly the rcleysa! ‘information needed currently for testing-andior updating the current solution,SS QUESTION Ake Anes Eo 32 Mite ct the simplex method Indicate chat the LP has enbwended station? open ali of exbounded sodcton of LPP exe be cba if all the variables fe the key column are HS What bs meat by optomiiey? Bz Pet forming optinaity ext wo can find whether the currest Gale sation can be Sprowed ook ‘which i pombe by finding the Z)~ C, rom 34. How dl you find whether LPP hi got un abernativepituin!sauten or en, roc the pial Mimplex table? ‘optimal seaplex table, ZC; row, if ere cocors fx wows warble, i incicsis tha the LPP han on ahcmate talition. _ 3. Artificial Variables Technique 3S. What are he methods used to salve am LPP involving artificial variables? (1) Big Mf method ox penalty covt method (1) Tworphase simpicx method. 36, Define artificial variable, Asy Bon-negative variable which is introduced in the consent ia ender to get the initial basic feasible solution is caod artificial varuble. 37, When dees an LIP possess a pieudo-cptimal solution? Aa LPP possencs 1 pecido-opemal shitién, if at leat onc artical variable iin the basis at posiove level ‘even though the opumality cosdeiona are sitisfid 38 What are the dieactvantages of Big Mf method ever two-phase method Abhough Big M method can always be uscd to check the existence of « feasible solutioa, it may be 39. What bs degeneracy? ‘The concept of obuining a depenerae basic fessitie solution is 2 LPP is known'as degeneracy 40. Define the phenomenon of cycting: The phenomenos of repeating the samc sequence of simpicx kerations codiesaly, wutbout improving the vahic of the objective Function is known as cycling. 41. Haw can we resolve degeneracy In a LPP? (O/Dinde cach element of the rows by the positive covficerts of the kkcy cohumn i, that row. (i) Compare the reswking ratios, cohuma by cohitnn, fest in the identity and then te the body from left to right. (iil) The tow which first comtains the wmalicst ratio contains the Icaving varmble. 4. Duality in Linear Programming 42 Define dual of LPP. For cvery LPP. there is a unique LPP anscciaied with i invohong the same dais und closely relaed optional solution. The original probicm is then called the prima! problem while the other is called #3 deal problem. 4). What are the advantages of duality? (i) If prioal cootains lage eucnber of ») (2 . die, the mtio between the solution column and the eniering varuble cohima by cocsitering oaly the postive DeOne re4s Rewasey Sass AE We No rpc the OM inchincn with new ‘ones Oy ee Sate teheigees us es oe cate bill quent of er inns Activities are sequcnced aed achoduled using the PERT chart erative procedure (Wi) Morate-Catte technique. Esplain the principles of modelling’? U}, Models should be validated prior to implemcaiane. (ii), Models are only aids im (ia) Sach sBe0Is not be complicated They stl be ax simp an pone Peasible 10. (0) Models should be sceurate es al Method V1. What de you mean bya general LPP? ‘The general LPP is given by, ‘Max of Min Z = 41) Sabject to, +22, (55214, Shy + a2N3 + _+ aX, (S=2)b, (3) aaiX, + Ma2¥3 + +N, (5=2)h, XpXy XL 20, 3) Faiarg (1) ale he objective fncton, (2) the consiains obtained oe he wrablerespaes en G's the non-ncgativity restriction. 12 Give the matrix form of represeatiog a general LPP. Max or Min 2= Cx (< Subject to, ‘ \> x20 x €-(G6;_6,)« ee b= b - x, be, Oy Sz (Oy a=|%2 82 - te Ge) Sey Dog 13. Define a feasible region, 4 -A region in which all the constraints art satisfied simultaneously is called a feasible region. |4 Define @ feasible solution. : See Any solution to a LPP which satisfies the non-segativaty restrictions of the LPP is called its feasShort Questions and Answers Basics of Operations Research ‘What is operations research? Teer are many definitions of operations search According to one sich defckion “Operations Research is the application of scientific methods to complex problems arming from, operations ‘svolving large systems of men, machines, materials and moncy in dustry, business, gowemmment and efence 2 What are the various types off madels? ‘The various types of models are (2) leonie of physical models (2) Analogue or schematic mode's (ii) Symbolic or mathematical models. 3. What is am analogue model? Azalogue move! ean reprtent dynamic stations, They ae aalognas 10 tbe characteris of he SNES under sudy. They tse one set of properties to represent some other set of properties ofthe sym. ‘mode! is solved, the solution is reintpretad im terms of the origssal system 4 What is ap fconle model? Tenis models afe the pictorial representations of real systems and have the appearance of the real stractare ‘Examples of such models are city maps, houses, blucprants, What is a symbolic model? is 2 Symbolic model one which employs a of mathematical symbols present he devsion varabies of tbe system. These vanables are related together by mathematical equations which describe the propertics the system. © Name some charactertsties of = good model () te should be simple and coberent oy Ie should be open o paramere oe of THEE til) There should be less number of variables (i). Asunptios den the model shouldbe ces mented and ould be a sal at posi, ‘What are the main characteriatcs of operations researdt? Sore of the main charscteristicy of operations research (its system orientation (i) the use of intertiseiptinary forms. {li} application of scieatifie metiod. (Gv) uncovering of new problems oe ications of operations Tra Sat ny oe pn wes el tf ii nin