Operations Research – Set 3 January 29, 2025 by aasi 0% Report a question What’s wrong with this question? You cannot submit an empty report. Please add some details. 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950 Operations Research – Set 3 Dear ! This is Operations Research – Set 3 Quiz and it contains 50 questions. Keep Learning! 1 / 50 1) ___________ are the representation of reality. Models Phases Both A and B None of these 2 / 50 2) In a manufacturing process, who takes the decisions as to what quantities and which process or processes are to be used so that the cost is minimum and profit is maximum? Supervisor Manufacturer Producer Production manager 3 / 50 3) For analyzing a problem, decision-makers should study. Its qualitative aspects Its quantitative aspects Both a & b Neither a nor b 4 / 50 4) The objective functions and constraints are linear relationship between _____________. Variables Constraints Functions All of these 5 / 50 5) One disadvantage of using North-West Corner rule to find initial solution to the transportation problem is that. It is complicated to use It does not take into account cost of transportation It leads to a degenerate initial solution All of these 6 / 50 6) If an opportunity cost value is used for an unused cell to test optimality, it should be. Equal to zero Most negative number Most positive number Any value 7 / 50 7) Operations Research approach is __________ Multi disciplinary Scientific Initiative All of these 8 / 50 8) A _____________ models considers time as one of the important variable. Static Models Dynamic Models Both A and B None of these 9 / 50 9) An alternative optimal solution to a minimization transportation problem exists whenever opportunity cost corresponding to unused route of transportation is: Positive & greater than zero Positive with at least one equal to zero Negative with at least one equal to zero None of these 10 / 50 10) The large negative opportunity cost value in an unused cell in a transportation table is chosen to improve the current solution because. It represents per unit cost reduction It represents per unit cost improvement It ensure no rim requirement violation None of these 11 / 50 11) To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are. n 2n n-1 2n-1 12 / 50 12) An assignment problem is a special case of transportation problem, where. Number of rows equals number of columns All rim conditions are 1 Values of each decision variable is either 0 or 1 All of these 13 / 50 13) The initial solution of a transportation problem can be obtained by applying any known method. However, the only condition is that. The solution be optimal The rim conditions are satisfied The solution not be degenerate All of these 14 / 50 14) The purpose of a dummy row or column in an assignment problem is to. Obtain balance between total activities & total resources Prevent a solution from becoming degenerate Provide a means of representing a dummy problem None of these 15 / 50 15) While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to? Minimize total cost of assignment Reduce the cost of assignment to zero Reduce the cost of that particular assignment to zero All of these 16 / 50 16) A model is. An essence of reality An approximation An idealization All of these 17 / 50 17) Decision variables are __________ Controllable Uncontrollable Parameters None of these 18 / 50 18) The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if number of positive allocations are. m+n m*n m+n-1 m+n+1 19 / 50 19) If there are more than one optimum solution for the decision variable the solution is ___________. Infeasible Unbounded Alternative None of these 20 / 50 20) The issue of decision models. Is possible when the variable’s value is Reduces the scope of judgment and intuition known with certainty in decision making Requires the knowledge of computer software use None of these 21 / 50 21) The method used for solving an assignment problem is called. Reduced matrix method MODI method Hungarian method None of these 22 / 50 22) ______________ may be defined as a method of determining an optimum programme inter dependent activities in view of available resources. Goal Programming Linear Programming Decision Making None of these 23 / 50 23) An assignment problem can be solved by. Simplex method Transportation method Both a & b None of these 24 / 50 24) The degeneracy in the transportation problem indicates that Dummy allocation(s) needs to be added The problem has no feasible solution The multiple optimal solution exist a & b but not c 25 / 50 25) An optimal solution of an assignment problem can be obtained only if. Each row & column has only one zero element Each row & column has at least one zero element The data is arrangement in a square matrix None of these 26 / 50 26) Operations Research approach is typically based on the use of. Physical model Mathematical model Iconic model Descriptive model 27 / 50 27) The assignment problem. Requires that only one activity be assigned to each resource Is a special case of transportation problem Can be used to maximize resources All of these 28 / 50 28) The dummy source or destination in a transportation problem is added to. Satisfy rim conditions Prevent solution from becoming degenerate Ensure that total cost does not exceed a limit None of these 29 / 50 29) When total supply is equal to total demand in a transportation problem, the problem is said to be? Balanced Unbalanced Degenerate None of these 30 / 50 30) ____________ models assumes that the values of the variables do not change with time during a particular period. Static Models Dynamic Models Both A and B None of these 31 / 50 31) Every basic feasible solution of a general assignment problem, having a square pay-off matrix of order, n should have assignments equal to. 2n+1 2n-1 m+n-1 m+n 32 / 50 32) For a salesman who has to visit n cities which of the following are the ways of his tour plan. n! (n+1)! (n-1)! n 33 / 50 33) _____________ is one of the fundamental combinatorial optimization problems. Assignment problem Transportation problem Optimization Problem None of these 34 / 50 34) Assignment problem helps to find a maximum weight identical in nature in a weighted ____________. Tripartite graph Bipartite graph Partite graph None of these 35 / 50 35) Dual of the dual is ______________. Primal Dual Alternative None of these 36 / 50 36) An optimization model. Mathematically provides the best decision Provides decision within its limited context Helps in evaluating various alternatives constantly All of these 37 / 50 37) ________ are expressed is n the form of inequities or equations. Constraints Objective Functions Both A and B None of these 38 / 50 38) For analyzing the problem , decision – makers should normally study. Its qualitative aspects Its quantitative aspects Both A and B Neither A and B 39 / 50 39) Probabilistic models are also known as. Deterministic Models Stochastic Models Dynamic Models Static Models 40 / 50 40) ___________ are called mathematical models. Iconic Models Analogue Models Symbolic Models None of these 41 / 50 41) An assignment problem is considered as a particular case of a transportation problem because. The number of rows equals columns All xij = 0 or 1 All rim conditions are 1 All of these 42 / 50 42) The operations Research technique, specially used to determine the optimum strategy is. Decision Theory Simulation Game Theory None of these 43 / 50 43) Which of the following methods is used to verify the optimality of the current solution of the transportation problem? Least cost method Vogel’s approximation method Modified distribution method All of these 44 / 50 44) The Hungarian method for solving an assignment problem can also be used to solve. A transportation problem A travelling salesman problem A LP problem Both a & b 45 / 50 45) The occurrence of degeneracy while solving a transportation problem means that. Total supply equals total demand The solution so obtained is not feasible The few allocations become negative None of these 46 / 50 46) During an iteration while moving from one solution to the next, degeneracy may occur when. The closed path indicates a diagonal move Two or more occupied cells are on the closed path but neither of them represents a corner of the path. Two or more occupied cells on the closed path with minus sign are tied for lowest circled value Either of these 47 / 50 47) The smallest quantity is chosen at the corners of the closed path with negative sign to be assigned at unused cell because. It improve the total cost It does not disturb rim conditions It ensure feasible solution All of these 48 / 50 48) Managerial decisions are based on. An evaluation of quantitative data The use of qualitative factors Results generated by formal models All of these 49 / 50 49) An optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of. Rows or columns Rows & columns Rows + columns – 1 None of these 50 / 50 50) The quantitative approach to decision analysis is a. Logical approach Rational approach Scientific approach All 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
