Operations Research – Set 1 January 29, 2025 by aasi Home › Management › Operations Research Operations Research Operations Research – Set 1 📝 Model Practice Set ⚡ Instant Answers & Explanation 🎯 Exam Oriented 0% Report a question What’s wrong with this question? You cannot submit an empty report. Please add some details. 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950 Operations Research – Set 1 Dear ! This is Operations Research – Set 1 Quiz and it contains 50 questions. Keep Learning! 1 / 50 1) Alternative solutions exist of an LP model when. One of the constraints is redundant Objective function equation is parallel to one of the constraints Two constraints are parallel All of these 2 / 50 2) The important step required for simulation approach in solving a problem is to. Test & validate the model Design the experiment Conduct the experiment All of these 3 / 50 3) Biased random sampling is made from among alternatives which have. Equal probability Unequal probability Probability which do not sum to 1 None of these 4 / 50 4) The solution space (region) of an LP problem is unbounded due to. An incorrect formulation of the LP model Objective function is unbounded Neither a nor b Both a & b 5 / 50 5) Which of the following is not one of the assumptions of Markov analysis: There are a limited number of possible states A future state can be predicted from the preceding one There are limited number of future periods All of these 6 / 50 6) If a non-redundant constraint is removed from an LP problem then. Feasible region will become larger Feasible region will become smaller Solution will become infeasible None of these 7 / 50 7) Service mechanism in a queuing system is characterized by. Server’s behavior Customer’s behavior Customers in the system All of these 8 / 50 8) If an iso-profit line yielding the optimal solution coincides with a constaint line, then. The solution is unbounded The solution is infeasible The constraint which coincides is redundant None of these 9 / 50 9) The general purpose system simulation language. Requires programme writing Does not require programme writing Requires predefined coding forms Needs a set of equations to describe a system 10 / 50 10) Which of the following is not the special purpose simulation language? BASIC GPSS GASP SIMSCRIPT 11 / 50 11) If two constraints do not intersect in the positive quadrant of the graph, then. The problem is infeasible The solution is unbounded One of the constraints is redundant None of these 12 / 50 12) While assigning random numbers in Monte Carlo simulation, it is? Not necessary to assign the exact range of random number interval as the probability Necessary to develop a cumulative probability distribution Necessary to assign the particular appropriate random numbers All of these 13 / 50 13) Analytical results are taken into consideration before a simulation study so as to. Identify suitable values of the system parameters Determine the optimal decision Identify suitable values of decision variables for the specific choices of system parameters All of these 14 / 50 14) Markov analysis is useful for: Predicting the state of the system at some future time Calculating transition probabilities at some future time All of these None of these 15 / 50 15) While solving a LP model graphically, the area bounded by the constraints is called? Feasible region Infeasible region Unbounded solution None of these 16 / 50 16) The calling population is assumed to be infinite when. Arrivals are independent of each other Capacity of the system is infinite Service rate is faster than arrival rate All of these 17 / 50 17) A constraint in an LP model becomes redundant because. Two iso-profit line may be parallel to each other The solution is unbounded This constraint is not satisfied by the solution values None of these 18 / 50 18) Simulation should not be applied in all cases because it. Requires considerable talent for model building & extensive computer programming efforts Consumes much computer time Provides at best approximate solution to problem All of these 19 / 50 19) In a matrix of transition probability, the probability values should add up to one in each. Row Column Diagonal All of these 20 / 50 20) As simulation is not an analytical model, therefore the result of simulation must be viewed as. Unrealistic Exact Approximation Simplified 21 / 50 21) The transition matrix elements remain positive from one point to the next. This property is known as: Steady-state property Equilibrium property Regular property All of these 22 / 50 22) While plotting constraints on a graph paper, terminal points on both the axes are connected by a straight line because? The resources are limited in supply The objective function as a linear function The constraints are linear equations or inequalities All of these 23 / 50 23) While solving a LP problem, infeasibility may be removed by? Adding another constraint Adding another variable Removing a constraint Removing a variable 24 / 50 24) An iso-profit line represents. An infinite number of solutions all of which yield the same profit An infinite number of solution all of which yield the same cost An infinite number of optimal solutions A boundary of the feasible region 25 / 50 25) The purpose of using simulation technique is to. Imitate a real-world situation Understand properties & operating characteristics of complex real-life problems Reduce the cost of experiment on a model of real situation All of these 26 / 50 26) State transition probabilities in the Markov chain should. Sum to 1 Be less than 1 Be greater than 1 None of these 27 / 50 27) Which of the following characteristics apply to queuing system? Customer population Arrival process Both a & b Neither a nor b 28 / 50 28) Large complicated simulation models are appreciated because. Their average costs are not well-defined It is difficult to create the appropriate events It is difficult to create the appropriate events All of these 29 / 50 29) Few causes of simulation analysis failure are. Inadequate level of user participation Inappropriate levels of detail Incomplete mix of essential skills All of these 30 / 50 30) Which of the following statements is true with respect to the optimal solution of an LP problem? Every LP problem has an optimal solution Optimal solution of an LP problem always occurs at an extreme point At optimal solution all resources are completely used If an optimal solution exists, there will always be at least one at a corner 31 / 50 31) Which of the cost estimates & performance measures are not used for economic analysis of a queuing system? Cost per server per unit of time Cost per unit of time for a customer waiting in the system Average number of customers in the system Average waiting time of customers in the system 32 / 50 32) A problem is classified as Markov chain provided. There are finite number of possible states States are collectively exhaustive & mutually exclusive Long-run probabilities of being in a particular state will be constant over time All of these 33 / 50 33) Simulation is defined as. A technique that uses computers An approach for reproducing the processes by which events by chance & changes are created in a computer A procedure for testing & experimenting on models to answer what if ___, then so & so ___ types of questions All of these 34 / 50 34) If a matrix of transition probability is of the order n*n, then the number of equilibrium equations would be. n n-1 n+1 None of these 35 / 50 35) If one of the constraint of an equation in an LP problem has an unbounded solution, then. Solution to such LP problem must be degenerate Feasible region should have a line segment Alternative solutions exist None of these 36 / 50 36) Which of the following is not a key operating characteristics apply to queuing system? Utilization factor Percent idle time Average time spent waiting in the system & queue None of these 37 / 50 37) Special simulation languages are useful because they. Reduce programme preparation time & cost Have the capability to generate random variables Require no prior programming knowledge All of these 38 / 50 38) Constraints in LP problem are called active if they. Represent optimal solution At optimality do not consume all the available resources Both a & b None of these 39 / 50 39) Priority queue discipline may be classified as. Finite or infinite Limited & unlimited Pre-emptive or non-pre-emptive All of these 40 / 50 40) Probabilities of occurrence of any state are. Collectively exhaustive Mutually exclusive Representing one of the finite numbers of states of nature in the system All of these 41 / 50 41) In the long run, the state probabilities become 0 & 1. In no case In same cases In all cases Cannot say 42 / 50 42) To make simulation more popular, we need to avoid. Large cost over runs Prolonged delays User dissatisfaction with simulation results All of these 43 / 50 43) The first-order Markov chain is generally used when. Transition probabilities are fairly stable Change in transition probabilities is random No sufficient data are available All of these 44 / 50 44) The cost of providing service in a queuing system decreases with. Decreased average waiting time in the queue Decreased arrival rate Increased arrival rate None of these 45 / 50 45) An advantage of simulation as opposed to optimization is that. Several options of measure of performance can be examined Complex real-life problems can be studied It is applicable in cases where there is an element of randomness in a system All of these 46 / 50 46) A calling population is considered to be infinite when. All customers arrive at once Arrivals are independent of each other Arrivals are dependent upon each other All of these 47 / 50 47) Customer behavior in which the customer moves from one queue to another in a multiple channel situation is. Balking Reneging Jockeying Altering 48 / 50 48) While calculating equilibrium probabilities for a Markov process, it is assumed that? There is a single absorbing state Transition probabilities do not change There is a single non-absorbing state None of these 49 / 50 49) In a matrix of transition probability, the element aij where i=j is a. Gain Loss Retention None of these 50 / 50 50) In Markov analysis, state probabilities must. Sum to one Be less than one Be greater than one None of these Your score isThe average score is 0%🎉 Challenge alert! 💡 Share this quiz with your friends and see who scores the highest! 🏆🤩🔥 LinkedIn Facebook Follow Us @ 0% Restart quiz Exit We’d love to hear your thoughts! 📝 Share your valuable review with us. 🙌 🌟 Thank you for your support! Your feedback means the world to us. 🙏💖 Send feedback
