OBJECTIVE QUESTIONS: (1) Fill in the blanks with appropriate words given below: (a) Operations Research Models in which values of all variables and all possible outcomes are known with certainty are called models. (i) Physical (ii) Symbolic (iii) Deterministic (iv) Probabilistic \-6) Operations Research Models in which some or all variables are random in nature are called models, @) Physical (ii) Symbolic (iii) Deterministic (iv) Probabilistic (©) Mean, median and mode are measures of is (i) Central tendency (ii) Dispersion (iii) Probability and are techniques applied in project management. () CPM and PERT Gi) Assignment and: Transportation (iv) Decision ; theory and Inventory models j (ad)TTT 7 in nature. Introduction to Operations Research Ae) Operations Research techniques are —— (i) Qualitative (ii) Judgemental (iii) Approximate (iv) Quantitative [Ans.: (a — Deterministic); (b ~ Probabilistic); (¢ — Central tendency); (d- CPM, PERT); (e~ Quantitative)] (2) Match the followin, Grow (@) Assignment (b) Transportation 4 A | Group ‘B’ | (i) Economic lot size (i) Managing, workers’ allocation | ~@ cmMS Gii) Quality control (d) EOQ | (iv) Managing routes (@ sQec3 (v) Project management [Ans.: (a— ii); (b - iv); (ev); (4-0; (e- iti)OBJECTIVE QUESTIONS: a Fil in the Blanks with appropriate words given below: ® ‘are the entities whose values are to be determined the solution of the LPP. (@ Objective function (ii) Decision Vi Ge) Opportunity costs ‘specifies the objective or goal of solving the LPP. @ Objective function i) Decision Variables (iii) Cs fariables Gi) C @ Numbers (ii) Symbols (iii) Decision Variables are the restrictions or limitations imposed on the LPP! @ Variables Gi) Costs (ii) Profits (iv) Constraints fe) The type of constraint which specifies maximum capacity resource is‘____ or equal to’ constraint. @ Less than Gi) Greater than (iii) Less than or greater than (® In linear programming i ar progra —_____ represents mathematical eq theliiatons imposed by he problem. (Apri 1) Objective function (ii) Decision vari Lf r variable (iii) Red Sams: (a ~ Decision variables); (b — Objectit . M ~ Objective function); (c - variables); (d — Constraints); (e— less than); (f— Constraints)] @) True or False: Fa To Fa Te a) tans: : (a- False) (& ~Truel;(c— False); (d~ True), (e~True)])BJECTIVE QUESTIONS: ) Fill in the blanks wil (a), by © (a) «e) o ‘appropriate words given below: The region of feasible solution in LPP graphical method is called _. ( Infeasible region (ii) Unbounded region (ii) Infinite region iv) Feasible region When it is not possible to find solution in LPP, it is called as case of (@ Unknown solution (ii) Unbounded solution (iii) Infeasible sohution iv) Improper solution When the feasible region is such that the value of objective function can extend to infinity, itis called a case of _____. (W Infeasible solution (ii) Alternate optimal (iii) Unbounded solution Gv) Unique solution When the constraints are a mix of ‘less than’ and ‘greater than’ it is a problem having G) Multiple . constraints (i) Infinite constraints Gi). nfeasible constraints (iv) Mixed constraints Incase of an’______' constraint, the feasible region is a straight line. ) Jess than or equal to (ii) greater than or equal to (iii) mixed iv) equal to In linear programming, unbounded solution means _.. (April 19) @) Infeasible solution (ii) Degenerate solution (iil) Infinite solutions iv) Unique solution = Unbounded [Ans.: (a = Feasible region); (b ~ Infeasible solution); (¢ - solution); (d- Mixed constraints); (e~ equal to); (f- Infinite solutions)OBJECTIVE QUESTIONS: (2) Fill in the blanks with appropriate words given below: (a) The incoming variable column in the simplex algorithm is ayy @ key Zhtumn Gi) incoming column Gil) variable Gv) important column cola (o) The outgoing variable row in the simplex algorithm is cay key row Gli) interchanging row Gv) basic row ‘of key column and key row is called __ Jement (Iii) key element (iv) bag Janeer @) outgoing row (il) (©) The intersection value : i vital element (i) important el element ‘The variable added to the LHS of a less than or equal to constraint convert it into equality is called ______- (@ surplus variable (i) artificial variable (ii) slack variable (iv) additional variable ‘A resource which is completely utilized is called @ e simplex. G) nal resource (li) scarce resource (iil) zero resource (Iv) abundaat resource (© A resource which is partially utilized is called in simplex @ surplus resource (il) extra resource (lit) available resourt Gv) abundant resource @ The of one extra unit of resource is called ___— # simplex. (@ unit price (i) extra price (iii) retail price (iv) shadow price (hy in simplex, a maximization problem is optimal when all Delia J, (April 19) G-Z, values are. {i Either zero or positive (i) Either zero or negative (ii) Only positive (iv) Only negative = i {Ans (a key column); (o— key row: (c—key element (d~ slack varias (e~ scarce resource); (f- abundant resource); (g - Shadow price); (- zero or negative)) bd @) True or False: Te Key column indicates the incoming variable in a LPP simple solution. . F () Abundant resource means a resource which is fully utilized. “TA scarce resource has zero unutilized capacity. (a) A maximization simplex solution is (G* - pe pepempeay jution is optimal when all Aij values ( “1(@) Replacement ratio decides the i ur eronter outgoing variable ie. key row intinear Programming - Gre 121 Te Slack represents unutilized resources. (April 19) (g) When more than one optimal solution .is possible in a linear F programming problem, it is termed as ‘unique solution’. (April 19) [Ans.: (a ~ True); (b - False); (c - True); (d - False); (e - True); (f - True); —False)) (3) Match the following: Group ‘A’ Group ‘B’ (a) Slack variable || Incoming variable in simplex (b) Surplus variable S | (ii) Outgoing variable in simplex () Scarce resource « | (iii) Partially utilized resource (4) abundant resource = (iv) Put in a less than or equal to constraint (e) Key column / (v) Putin a greater than or equal to constraint (9 Key row 2. (vi) Completely utilized resource ae iv); (6 — 0); (c— vi); (d— iii); (e- i); F- i)OBJECTIVE QUESTIONS: (1) Fill in the blanks with appropriate words given below: we (a) To find initial feasible solution of a transportation problem method which starts allocation from the lowest cost is called ——~ method. 5 (i) north west comer (ii) least cost (iii) south east comer tiv) voet! approximation .o @ @ @ © a transportation problem, the me method. method of penalties is called {@ least cost Gi) south east comer (ii) Vogel (iv) north west corner ‘Vogel's: approximation When the total of allocations of a transportation supply and demand values, the solution is called (i) non-degenerate Gi) degenerate ii fesible tv) infeasible When the allocations of a transportation problem sat condition (m +1) the solution iscalled cay (i degenerate (i infeasible ii) unbounded Gv) non degenerse When there is a degeneracy inthe transportation problem, we add an imaginary allocation called in the solution, (@)dumny (i) penalty (ii) epsilon Gv) regret If M + N-- 1 = Number of allocations in transportation, it means . (Where ’M’ is number of rows and 'N’ is number of columns) (April 19) (i) There is no degeneracy (ii) Problem is unbalanced (iii) Problem is degenerate (iv) Solution is optimal Which of the following considers difference between two least costs for each row and column while finding inital basic feasible solution in transportation? (April 19) (i) North west corner rule (ii) Least cost method (iii) Vogel's approximation method (iv) Row minima method (a ~ least cost); (b - Vogel's approximation); (c - feasible); Problem match with solution. (d- non-degenerate); (e - epsilon); (f - There is no degeneracy); (g ~ Vogel's ‘approximation method)] ) ‘True or False: fa To ro ra Te ns a = NWCR is the most cost efficient method of finding IFS in a Transportation problem. In VAM, we calculate penalties to decide how to give Allocations. A Transportation solution is optimal when all opportunity costs (A) are positive or zero. ; A Transportation problem is called Balanced if Total Demand is equal ‘o Total supply. If the condition of (rows + columns - 1) ie. (m +n ~ 1) is equal to ‘number of Allocations’ is not satisfied, then itis a case of Degeneracy fh Transportation solution. ae in a transport vem numberof rows is not equal to number uv columns an the poole unbalanced, (April 19) False); (b ~ True); (~ True; (d= True (@~ True); (f- False)OBJECTIVE QUESTIONS: (1) _ Fill in the blanks with appropriate words given below: ® &) @ If the number of rows and columns in an assignment problem arent equal thanitiscalled__ problem. @ prohibited (i) infeasible (iii) unbounded (iv) unbalanced _The method of solution of assignment problems is called __ method. @ NWCR Gii) VAM Giii) LCM fv) Hungarian When a maximization assignment problem is compel minimization problem, the resulting matrix is called __— © Cost matrix Gi) Profit matrix (ii) Regret matrix (iv) Dummy bt The extra row or column which is added to balance an problem is called {ies Gi ny Gu) exe ‘ @ particular assignment in the iven Jem is.not possi restricted as a condition, itis called & Proerblem Cineabl i degeent i nanad i) ed wil '1in an assignment problem, number of rows is not equal o Poh ——— tApril 19) qo! is maximization ene Gi) Problem is unbalanced ae aid ene not (d~ Dummy); (e~Prohibiteay yp, Hungarian, Ce ~ f- Problem i is shement problems vor 9m or False: 243 solve an Assignment “a used Problem, Hungarian met Of solu Even if we interchange ton is o) Eve the minimization and Column mi of opera N olution in an Assignment init iil roca ota a Fy) A Dummy is used to solve a Prohil @ ibited \o Regret matrix is made to cony met ble mil mization problem in ‘assignment et tap sgnten Problem into True)] fans.: (a ~ True); (b - True); (c~ False id Prohibited problem (W¥) Unbalanced problem (d) Converting maximization to minimization problem (e) Restricted assignment 2 (V)_ Maximization [Ans.: (a - ii); (b = ~ 9h e— ioh d- ~ i); (e- iii)]StEcTive QUESTIONS: Fillin the blanks with appropriate words ©) Thelongest path inthe network diagram ill best Gi worst Gi) sub-citinl > cial = The second longest path in the network diagram scaled path, Jo sig assptetes(] af] 5 (i) <,> Gi >, < Gil) >, > iv) <, < (9 The maximum time in which an activity wil be comple all possible delays and postponements is termed as dons Ans: (a ~ optimistic); (b ~ pessimistck (¢ ~ expectedly (d ~ means (e-<, 0 pessimistic time)] ) Tre or False: @) In PERT, optimistic completion time of an activity is the long possible completion time for that activity. (©) In PERT, the most likely completion time oft activity s always the mid-point of optimistic time and pessimistic time. T @- The expected completion time {te of an activity has a SU% probability of completion. a F@ In PERT, the project variance is calculated by aiding variance of in the project. 7 Fe Probabiity of ences its expected tie (Te) will be always 100%. (April 19) eal ® “Ans: (a~ False); (b ~ False); (¢~ True (d~ False (e-' Match the followingOBIECTIVE QUESTIONS: ". Fillin the blanks with appropriate words given below: machine is called (2) The time required by each job on each lon * rocessing (iv) average ie ee in ng é Gu job a ‘order (ii) working order (ii) processing ome order a wr Viput'™ operations Research ys (©) The time between the starting ofthe first jb and completion of he last job in sequencing problems is called i @ total time Gi assignment time (ii) elapsed time (i) idle time (2) the time during which a machine remains waiting or vacant iq sequencing problem i called _ time. 9 processing Gi) waiting (i) ile Gv) free (©) Im sequencing problem, the order of completion of jobs is calle €® completion sequence (i) job sequence ii processing order (iu) jo order (0 The total time required to complete all he jobs ina job sequencing problem is known as___ (April 19) le time Gi processing time (ii) elapsed time Gv) processing order ‘Ans. (a ~ processing: (b~ processing order); (c~ elapsed time): (4 ~ idley (@ job sequence); (elapsed time)] @) Tre or False: “7 @) job sequencing, the purpose of finding the optimal sequence of job Processing is to minimized total elapsed time of operations. Fe [dle time of a machine means the time during which the machine is ‘working in is full capacity. [421A thee machines job sequencing problem can be converte in a wo ‘machines problems only if any one of following conditions is satisfied: {Ava Baad oF {Cuan 2 Buns] coe Job sequencing problems are solved to ensure that, both, the total ine (complete all jobs and idle time of each machine are maxim. Te ‘folving ob sequencing problem, is assumed that allots require the same sequence of operations. (April 19) ‘Ansa ~ True (b~False)y(~ True) d= False) (e~ True @) Match the followi alse); (e ~ True)]