Mid Term Quiz MTH601 – Operation Research | Mid Term Quiz Posted by admin On December 22, 2023 0 comments Welcome to your MTH601 - Operations Research 1. Which of the following correspond to the practical limitation of available resource while modeling a real life situation into a linear program Constraints Objective function Linear function Decision variables None 2. Which of the following method follows iterative procedure to solve a linear programming problem? Graphical Algebraic(Simplex) None 3. Solution region of the constraints :2x+3y>12 and 2x+3y Point(6,4) Straight line:2x+3y-12 Empty set All first quadrant None 4. In the graph of the purchasing model with shortages the area under the horizontal axis represents________. Set up cost of item Purchase cost of item Carrying cost of item Shortage cost of item None 5. The straight line associated with the constraints 2x+3y 2 4 6 3 None 6. Which of the following value is correct for the expected time of an activity having optimistic, pessimistic and most likely times as 4,8 and 6 days. 666 days 466 days 6 days 933 days None 7. In a network flow a diagram for an activity(I,j) of duration of three days if its earliest start time is of two days then which of the following will be its early finish time? One and half day One day Six days Five days None 8. In a development project. If an activity (m,n) of seven days duration starts late on 5rd day then which of the following will be its latest finish time? 7th day 5th or 7th day 12th day 5th day None 9. Which of the following is an intermediate step to model a linear programming problem? Identify the objective function. Identify the non-negative restrictions and constraints Identify the unknown decision variables None of these None 10. A/An ________ is the collection of inter related activities to be performed in a particular sequence to completion. Project Branch Event Node None 11. Which of the following times are directly to the activity cost that is by reducing the activity duration the direct cost of the corresponding activity is increased? PERT Times CPM Times None 12. Which of the following is an operation research (OR) process? Simplex method Linear programming Observation Networking None 13. In the purchasing Model with shortages the cost function C(S,Q) can also be expressed as function of_______. (S,D) (Q,D) (S.t) (t,D) None 14. Which of the following would be the objective of the yield per minute in a chemical process which depends upon the temperature ‘x’ and pressure ‘y’? Minimization Inflection Maximization Average None 15. Which one of the following is not an operations research problem solving steps? Observation Definition of the problems Variable selections Model construction None 16. In the Dynamic order Quantity if the ratio of setup and carrying costs is 500 and the demands of 2nd and 3rd months are 50 and 130 respectively then which of the following is true about the 2nd months requirement? 2nd month demand can be include in 1st month 2nd month demand can be included in 3rd month 2nd month demand can be included in any month of the year 2nd month demand will have to fulfill in 2nd month None 17. The mathematical technique which is used to solve a wide class of problems such as allocating scarce resource among competitive activities is known as_____. Classical model Descriptive model Linear programming model Mathematical model None 18. Which of the following would be the objective of the cast per unit of producing certain cameras? Average Minimization Inflection Maximization None 19. In CPM each activity has one deterministic time while in PERT each activity has_____ probabilistic time/times Three Also one Two No None 20. In the phase of early start and early finish to find the critical path in a network flow diagram the computation are proceeded from_____ to the final event. Left to right Bottom to top Top to bottom Right to left None 21. In a development project, if an activity(I,j) of six days duration starts late on 3rd day then which of the following will be its latest finish time? 18th day 9th day 3rd day 2nd day None 22. If the annul demand of a product is 10000 items , and its set up and inventory costs are 200 and 100 respectively then its economic order quantity is________ provided that shortage is fulfilled INSTANTANEOUSLY. 200 units 20000 units 40000 units 100 units None 23. For a LP problem say,Max.z=x+y, under the condtraints xy>=0 the feasible region would be___________. All the first quadrant group All xy-plane Empty Point(0,0) None 24. By which of the following method any complex linear programming problem can be handled? Degenerate method Graphical method Simplex method Dual method None 25. In the phase of Early start and early finish to find the critical path in a network flow diagram flow diagram, for the first node(event) we start will time________. With strict positive value T-0 T=a(arbitary) T=infinity None 26. Solution region of the constraints 2x+3y>12 or 6x+9y=36 Will be the half plane bisected by 2x+3y=12. Excluding Including None 27. Which of the following event has no immediate predecessor in any network flow diagram? Critical Event Head Event Tail Event Non Critical Event None 28. Which one of the following is not an operation research problem solving steps? Variable selections Definition of the problem Observation Model construction None 29. For critical path of a network which of the following is the best suitable answer. Its total float is zero Its free float is zero All of the above Its independent float is zero None 30. If the economic order quantity and the annual demand of a product are 2500 and 5000 units respectively then without any shortage the time between the consecutive order is _________ months. 2.0 2.50 0.50 1.50 None 31. Which of the following quantity will very in case of Dynamic order quantity model? Setup Cost Carrying Cost Item Cost Demand None 32. Which of the following will be annual optimum cost of a product if the number of annual orders without any shortage is 25 and the total cpst of one cycle is 10,000? Rs.400 Rs.10025 Rs.9975 Rs.250000 None 33. Which of the following would be the objective of the daily loss of heat in a heating system? Maximization Minimization Inflection Average None 34. While applying Simplex method to a LP of minimization type, we proceed stepwise from one______ solution to another in such away that the objective function always increase its value. Optimal Non-basic feasible Basic feasible Degenerate None 35. The amount of the inventory will always taken to be _______. Negative Positive None 36. Solution of a Linear programming problem is found by______ methods. Analytical Probabilistic Average Pare algebraic None 37. A critical path in a network flow diagram____. Is unique May at most two Depends on number of dummies May be multiply None 38. In the dynamic order quality problem the demands of all succeeding months can be included in the demand of preceding one provide that_______. Item and holding costs are balanced Shortage and setup costs are balanced Setup and holding costs are balanced Shortage and item costs are balanced None 39. Which of the following property ensures that the decision variables can be divided into any fractional levels so that the rational(fractional) values for the decision variables are permitted? Deterministic Additively Proportionality Divisibility None 40. In the ABC analysis the items are classified into three categories with respect their______ Cost value Demand value Turn over value Mark up value None 41. If for path 1-3-4 times is 5+3-8 days for path 1-2-3-4 time is 6+7+3-16 days and for path 1-2-4 time is 6+6-12 days then which of the followings id ture 1-3-4 is critical path 1-2-4 is critical path 1-2-3-4 is critical path 1-4 is critical path None 42. Under which of the following condition a mathematical program would be non-linear? If least objective function is non-linear If both objective function and constraints are non-linear None 43. In which of the following model the carrying cost per unit of time is reduced in the ratio (1-D/R):1? Purchasing model without shortage Manufacturing model without shortage Purchasing model with allowed shortage Manufacturing Model with allowed shortage None 44. Which of the following technique to solve the network flow diagrams is activity oriented? Programmer evaluation and review technique Critical path method None 45. In resource leveling when two or more jobs complete for some resource first try to allocate on activity which is of_____ duration end next to the activity which having next____duration. Most likely, pessimistic Minimum, maximum Maximum, Minimum Optimistic most likely None 46. The objective function and___together from a linear programming problem. A set off constraints Unrestricted variables Feasible region Optimal solution None 47. Which of the following property must be satisfied by a linear programming model? Sensitivity Negativity Additively Probability None 48. In pert the possible variation in activity can be measured from______ of the corresponding beta distribution. Variance Mean Expected time Standard deviation None 49. Which of the following is not a categories of the operation research (OR) techniques. Linear mathematical programming technique Feasible solution Inventory techniques Networking techniques None 50. In a project management if the critical activities of a network are delayed then_____ Project finish time have to extend Project cost will increase More resource have to employed All above choices are equivalent None 51. EST and EFT of activities are calculated in Forward pass Backward pass Path does not effected None 52. _________________ may be less than most likely time estimate Pessimistic time estimate Smallest time estimate Optimistic Time estimate None 53. The dummy activities consume No time, no resources No time but some resources Some resources in minimum time None of these None 54. If an activity consumes no time and no resources then this activity is called __________ dummy activity sequential activity critical activity cyclic activity None 55. Cost period ------- ( No of ordered items) Holding cost Set up cost Stock out cost Item cost None 56. The following network is an example of Redundancy Cycling Merging None 57. The following network is an example of Redundancy Dangling Cycling Dummy None 58. If t0 = 6, tm = 12 and tp = 18, then Vt= _________ 12 2 4 144 None 59. Which one is best describe Micro Economic Planning? Distribution of fertilizer Improving the layout of a workshop in a company Investment planning of the country PERT None 60. If t0 = 6, tm = 12 and tp = 18, then Vt= _________ 12 2 4 144 None 61. Which inventory model also known as a saw tooth model? Purchasing Model with no shortages Purchasing Model with shortages Manufacturing Model with no shortages Manufacturing Model with shortages None 62. For backward pass computations Earliest start time Latest start time Earliest start timeLatest start time Earliest start time Latest start time = 0 None 63. For an activity if optimistic time, most likely time estimate and pessimistic time estimate are 3, 6 and 15 respectively then expected time is 4 3 7 20 None 64. In a quadratic programming problem unlike linear programming problem Only objective function is quadratic Both objective function and constraints are quadratic Only constraints are quadratic At least one of objective function or constraint must be quadratic None 65. - Solution region of the constraint x≥ 0 Half plane to the right of straight line x=0 Half plane to the right of y-axis Half plane to the region where abscissas are non-negative All are equivalent None 66. A dummy activity is a simulated activity of sorts, one that is of ________duration and is created for the sole purpose of demonstrating a specific relationship and path of action on the arrow diagramming method. Zero Minimum Maximum Average None 67. Activity definition refers to the process of parsing a project into a number of individual tasks which must be completed ___________ the deliverables can be considered completed. Activity definitions rely on a number of specific input processes. before both before and after after None 68. A forward pass is used to determine and calculate the ________________ dates, through utilization of a previously specified start date. early start and early finish late start and early finish early start and late finish late start and late finish None 69. Total cost per period = Item cost + Order cost + Holding cost + _____________. Shortage cost Optimum Shortage (S*) Economic Oreder Quantity. (Q*) Maximum Inventory. (I max.) None 70. K= Z x (_ _ _) Where K is called service factor Underroot pie/2 Underroot 2/pie Underroot 2pie/3 Underroot 3pie/2 None 71. _______________ employs a different modeling and solution logic than linear programming Transportation Model Inventory Control Model Dynamic Programming None of the above None 72. To identify and maintain the proper precedence relationship between activities those are not connected by event, we introduce Parallel Activity Dummy Activity Sequential Activity None of the above None 73. EST and EFT of activities are calculated in Forward pass Backward pass None 74. Critical path is obtained by connecting the jobs having Activities having same EST and LST Activities having same EFT and LFT Activities having zero slack All of the above None 75. In LP problems Additively means that The effect of two different programs of production is the same as that of a joint program The doubling (or tripling) the product will exactly double (or triple) the profit and the required resource Both (a)& (b) None of the above None 76. Two of the first steps of OR process encompass the actual use of OR techniques. These steps are Model Construction and Model Solution Observation and Implementation Definition of the problem and Model Solution Model Solution and Implementation of results None 77. Let FS = Free Slack, TS = Total Slack, INDS = Independent Slack, then which relation is true TS ≤ FS INDS ≤ FS FS ≤ TS (d). Both (b) & (c) None 78. Best possible time estimate that a given activity would take under normal conditions which often exist, is called Most Likely time estimate Pessimistic time estimate Smallest time estimate None of the above None 79. Standard Deviation S.D is One sixth of the difference between pessimistic time estimates and optimistic time estimates One sixth of the difference between pessimistic time estimates and most likely time estimates One sixth of the difference between optimistic time estimates and most likely time estimates One sixth of the difference between most likely time estimates and optimistic time estimates None 80. Is this Network legal? Yes No None 81. In the relation of finding the expected time of an activity, most likely time is weighted more than the other optimistic and pessimistic times and these exist in the ratio of -----------. 6:1 2:1 4:1 3:1 None 82. In PERT, the possible variation in activity times can be measured from -- --------- of the corresponding Beta Distribution. Variance Mean Expected Time Standard Deviation None 83. Which of the following Probabilistic time in PERT has the same analogical meaning of Deterministic time (time to complete any activity) in CPM? Expected Optimistic Pessimistic Most Likely None 84. About which of the following it is true that, “they only signify with the passage of time, the beginning and ending of some activities under no consumption of resources” ? project nodes dummy branch None 85. While solving a network flow problem by PERT, which of the following type of time will be used to measure the length of Critical Path? Pessimistic Expected Most Likely Optimistic None 86. In a project, a network diagram shows the precedence relations of inter related activities along with their corresponding activity ----------. Times Cost Profit Quantity None 87. The network flow diagrams for PERT and CPM are same except for ------ -----. dummy activities critical Path initial and final events activity times None 88. Which of the following relation is true among the probabilistic times in PERT? Most Likely < Optimistic < Pessimistic Optimistic < Most Likely < Pessimistic Most Likely < Pessimistic < Optimistic Pessimistic < Most Likely < Optimistic None 89. Which of the following relation is correct for the Standard Deviation of an activity times having optimistic, pessimistic and most likely values as 4, 8 and 6 days respectively? 0.666 0.1 0.147 7.111 None 90. In a project, a network diagram shows the ------------ relations of the inter related activities along with their corresponding activity times. deterministic and probabilistic precedence or succession union and intersection dummy and artificial None 91. The task which is executed by the usage of resources and time is called -- -----------. Node Event Project activity None 92. - If both jobs ‘a(l,n)’ and ‘b(m,n)’ of ‘7’ and ‘8’ days durations respectively, start earlier simultaneously on 4th day, then ‘n’ can start earlier on -----------day. 8th 11th 15th 12th None 93. In a network flow diagram, if an event is the predecessor of three other events then how many dummies are inevitable to include in the network? One Two Four Three None 94. - In a transportation problem the objective function 'Z’ gives____ . Total Cost of transportation Total time of transportation None 95. In two phase method process, first phase___ the sum of artificial variables. Minimize Maximize None 96. Which of the following difficult may found while attempting an LP problem by M-method? It often leads to infeasible Computational error due to large value of M None 97. None 98. For finding the maximum profit in an enterprise of selling two products such that freezing the sale of one product and keep selling the other. This scenario is studied under__________. Un-roundedness Duality Degeneracy None 99. Which of the following will be an example of degenerate basic feasible solution for an LP problem? (2,3-1) (0,2,1) None 100. Under which of the following condition to solve an LP by using two phase method we can’t proceed for 2nd phase? Object function of 1st phase has zero value Object function of 1st phase has positive value None 101. A balanced transportation model with 5 number of source 7 destinations has ___ number of constraint equations. 2 12 35 None 102. Dual of a Dual is ____________. Primal Dual None 103. Shortcoming of Big M method is that the value of M could be ______. Very small Very large None 104. In simple method to solve an LP problem gauss Jordan Elimination method demands that all the key column enters should be zero except ____. 1st row entry Key row (pivot)entry None 105. The cost coefficient of artificial variable in objective function is _____. 0 M None Time's up
Virtual University
Superior university
