Description : 13. Operations Research cannot give perfect _____ to problems a. Answers b. Solutions c. Both a & b d. Decisions
Last Answer : c. Both a & b
Description : Operations Research does not give perfect solution to a problem, but it helps to improve the ......................... of the solution. a. Quality b. Clarity c. Look d. None of these
Last Answer : a. Quality
Description : Who defined Operations Research as “the art of giving bad answers to problems which otherwise have worse answers”? a. H M Wagner b. H A Taha c. T L Saaty d. Arthur Clark
Last Answer : c. T L Saaty
Description : Who defined Operations Research as scientific approach to problem solving for executive management. a. E L Arnoff b. H M Wagner c. Churchman d. None of these
Last Answer : b. H M Wagner
Description : Operations Research is a ................................ a. Science b. Art c. Both a and b d. None of these
Last Answer : c. Both a and b
Description : Operations Research uses models to help the management in determining its .................... scientifically. a. Policies b. Actions c. Both a and b d. None of these
Description : Operations Research makes a ...................... attack on complex problems to arrive at optimal solution. a. Scientific b. Systematic c. Both a and b d. None of these
Description : The word .................. may be defined as some actions that we apply to some problems or hypothesis. a. Research b. Operations c. Both a and b d. None of these
Last Answer : b. Operations
Description : Operations Research Techniques involves ..................... approach. a. Team approach b. Critical approach c. Individual approach d. None of these
Last Answer : c. Individual approach
Description : Operations Research techniques help to find ................... solution. a. Feasible solution b. Infeasible solution c. Optimal solution d. None of these
Last Answer : c. Optimal solution
Description : ....................... is an important Operations Research Technique to analyse the queuing behaviour. a. Game theory b. Waiting line theory c. Decision theory d. Simulation
Last Answer : b. Waiting line theory
Description : Operations Research emphasises on the overall approach to the system. This characteristic of Operations Research is often referred to as ................................. a. System orientation b. System approach c. Inter-disciplinary d. Team approach
Last Answer : d. Team approach
Description : Operations Research has the characteristic that it is done by a team of ..................... a. Scientists b. Mathematicians c. Academicians d. Politicians
Last Answer : a. Scientists
Description : The innovative science of Operations Research was discovered during ...................... a. Civil war b. World war I c. World war II d. Industrial Revolution
Last Answer : c. World war II
Description : The term “Operations Research” was coined in the year ................... a. 1930 b. 1940 c. 1950 d. 1960
Last Answer : b. 1940
Description : Operations Research is a very powerful tool for ........................ a. Operations b. Research c. Decision making d. None of these
Last Answer : c. Decision making
Description : .................... defined Operations Research as “the art of winning wars without actually fighting.” a. H M Wagner b. H A Taha c. T L Saaty d. Arthur Clark
Last Answer : d. Arthur Clark
Description : Operations Research Society of India was formed in the year .................. a. 1950 b. 1955 c. 1957 d. 1960
Last Answer : c. 1957
Description : In India, first Operations Research application was made by ........................... a. Pranab K Sen b. Prof. Mahalonobis c. Samarendra Nath Roy d. Raghu Raj Bahadur
Last Answer : b. Prof. Mahalonobis
Description : In India, first Operations Research unit was set up at ................................. a. Regional Research Laboratory, Hyderabad b. Indian Statistical Institute, Kolkotha c. Indian Institute of Science and Technology, Bengaluru d. Indian Institute of Science and Technology, Mohali
Last Answer : a. Regional Research Laboratory, Hyderabad
Description : In India, Operations Research came into existence in the year .............. a. 1940 b. 1947 c. 1949 d. 1950
Last Answer : c. 1949
Description : ......................... deals with making sound decisions under conditions of certainty, risk and uncertainty. a. Game theory b. Network analysis c. Decision theory d. None of these
Last Answer : c. Decision theory
Description : An optimal solution is considered as the ................... among the feasible solutions. a. Worst b. Best c. Ineffective d. None of these
Last Answer : b. Best
Description : If there are more than one optimal solutions for the decision variables, the solution is ........... a. Infeasible b. Unbounded c. Alternative d. None of these
Last Answer : c. Alternative
Description : The variables which cannot be manipulated by the decision maker are called.................... a. Controllable variables b. Uncontrollable variables c. Both a and b d. None of these
Last Answer : b. Uncontrollable variables
Description : PERT stand for: a. Performance Evaluation Review Technique b. Programme Evaluation Review Technique c. Programme Evaluation Research Technique
Last Answer : b. Programme Evaluation Review Technique
Description : The term “Operation Research” was coined by : a. Mc Closky and Trefthen b. Arthur Clark c. Churchman, Ackoff and Arnoff d. George B Dantzig
Last Answer : a. Mc Closky and Trefthen
Description : A Transportation Problem is said to be unbalanced when total supply is not equal to ............ a. Total cost b. Total demand c. Both a and b d. None of these
Last Answer : b. Total demand
Description : Initial feasible solution to a transportation Problem can be found out by ......................... a. VAM b. MODI Method c. Both a and b d. None of these
Last Answer : a. VAM
Description : A minimisation problem can be connected into maximisation problem by changing the signs of coefficients in the ........................... a. Constraints b. Objectives c. Both a and b d. None of these
Last Answer : b. Objectives
Description : The Hungarian method for solving an assignment problem can also be used to solve: a. A transportation problem b. A travelling salesman problem c. A linear programming problem d. Both a and b
Last Answer : b. A travelling salesman problem
Description : An assignment problem can be solved by ......................... a. Simplex method b. Transportation method c. Both a and b d. None of these
Description : Activities that cannot be started until one or more of the other activities are completed, are called.......................................... a. Dummy activities b. Initial activities c. Successor activities d. Predecessor activities
Last Answer : c. Successor activities
Description : ........................variables are fictitious and cannot have any physical meaning. a. Slack variables b. Surplus variables c. Artificial variables d. Decision variables
Last Answer : c. Artificial variables
Description : .................... is the popular method for solving an assignment problem. a. Hungarian Method b. Enumeration Method c. Simplex Method d. None of the above
Last Answer : a. Hungarian Method
Description : Which of the following methods is used to solve an assignment problem: a. Enumeration Method b. Hungarian Method c. Simplex Method d. All of the above
Last Answer : d. All of the above
Description : Which of the following is a characteristic of a dual problem: a. Dual of a dual is primal b. If dual has a finite optimal solution, then the primal also has finite optimal solution c. If dual has no feasible solution, then the primal also has no feasible solution d. All of the above
Description : In Transportation Problem, LCM stands for ............................. a. Lowest Common Multiplier b. Least Cost Method c. Lowest Cell Method d. None of these
Last Answer : b. Least Cost Method
Description : In Transportation Problem, NWCM stands for ............................. a. North West Cost Method b. Net Worth Corner Method c. North West Corner Method d. None of these
Last Answer : c. North West Corner Method
Description : Initial feasible solution to a transportation problem arrived through which of the following method is very near to the optimal solution: a. NWCM b. LCM c. VAM d. None of these
Last Answer : c. VAM
Description : For a minimisation Transportation Problem, the objective is to minimise: a. Profit b. Cost c. Solution d. None of these
Last Answer : b. Cost
Description : ........................... method is used to solve an assignment problem. a. American method b. Hungarian method c. German method d. British method
Last Answer : b. Hungarian method
Description : In a maximisation assignment problem, the objective is to maximise ............................. a. Profit b. Cost c. Optimisation d. None of these
Last Answer : a. Profit
Description : Every Linear Programming Problem is related to another Linear Programming Problem, called .......................... a. Primal b. Dual c. Non-linear Programming d. None of these
Last Answer : b. Dual
Description : In Linear Programming Problem, degeneracy occurs in ................. stages. a. One b. Two c. Three d. Four
Last Answer : b. Two
Description : When at least one of the basic variables is zero, then the basic feasible solution to a Linear Programming Problem is said to be .............................. a. Infeasible b. Unbounded c. Degenerate d. Non-degenerate
Last Answer : c. Degenerate
Description : If the feasible region of a linear programming problem is empty, the solution is .................... a. Unbounded b. Infeasible c. Infeasible d. Alternative
Last Answer : b. Infeasible
Description : Graphic method can be applied to solve a liner programming problem when there are only ........................... variables a. A one b. Two c. Three d. More than three
Description : The assignment problem is: a. Requires that only one activity be assigned to each resource b. Is a special case of transportation problem c. Can be used to maximise resource d. All the above
Last Answer : d. All the above
Description : The method used for solving an assignment problem is: a. Reduced matrix method b. MODI method c. Hungarian method d. None of these
Last Answer : c. Hungarian method