Description : Probabilistic models are also called ........................... a. Deterministic models b. Dynamic models c. Stochastic models d. None of these
Last Answer : c. Stochastic models
Description : ......................... models involve more risks and uncertainties. a. Probabilistic b. Deterministic c. Both a and b d. None of these
Last Answer : a. Probabilistic
Description : In .................. models, everything is defined and the results are certain. a. Probabilistic b. Deterministic c. Both a and b d. None of these
Last Answer : b. Deterministic
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 : Operations Research models in which values of all variables and all possible outcomes are known with certainty are called _____ a. Physical b. Symbolic c. Deterministic d. Probabilistic
Last Answer : c. Deterministic
Description : In ……………… system the interaction between various subsystems cannot be defined with certainty A) Open System B) Closed System C) Deterministic System D) Probabilistic System
Last Answer : D) Probabilistic System
Description : ............................... is concerned with determination of the most economic replacement policy. a. Probabilistic programming b. Linear programming c. Search theory d. Replacement theory
Last Answer : d. Replacement theory
Description : ........................may be defined as a method of determining an optimal program of interdependent activities in view of available resources. a. Goal programming b. Linear programming c. Decision making d. None of these
Last Answer : b. Linear programming
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 : Is human thought deterministic or probabilistic?
Last Answer : answer:False dichotomy. Even if a series of events is probabilistic, there's still no room for agency' under the current understanding of Physics (yes; capital P). Therefore, the problem of ... by invoking quantum theory. We're still just along for the ride, except the ride is unpredictable.
Description : Which of the following statements is true? A. PERT is considered as a deterministic approach and CPM is a probabilis t ic techniques. B. PERT is considered as a probabilistic techniques ... and CPM are both probabilistic techniques. D. PERT and CPM are both considered as deterministic approachs
Last Answer : B. PERT is considered as a probabilistic techniques and CPM is considered as a deterministic approach
Description : 25. Operations Research models in which some or all values of variables are random in nature are called _____ a. Physical b. Symbolic c. Deterministic d. Probabilistic
Last Answer : d. Probabilistic
Description : 45. LP is a major innovations since _______ in the field of business decision-making, particularly under conditions of certainty a. Industrial Revolution b. World War I c. World War II d. French Revolution
Last Answer : c. World War II
Description : Controllable variables are also called.................................. a. Slack variables b. Surplus variables c. Artificial variable d. Decision variables
Last Answer : d. Decision variables
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 : The variables which can 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 : a. Controllable variables
Description : A LPP model doesnot contain: a. Decision b. Constraints c. Feasible solution d. Spread Sheet
Last Answer : d. Spread Sheet
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 : ........................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 : Which of the following is true with regard to a Linear Programming Model? a. No guarantee to get integer valued solution b. The relationship among decision variables is liner c. Both a and b d. None of the these
Last Answer : d. None of the these
Description : Before formulating a formal L P model, it is better to: a. Verbally identify decision variables b. Express the objective function in words c. Express each constraint in words d. All of the above
Last Answer : d. All of the above
Description : A constraint in a Linear Programming Model restricts: a. Value of objective function b. Value of decision variable c. Use of available resources d. All of the above
Description : The O R technique which helps in minimising total waiting and service cost is: a. Game theory b. Queuing theory c. Both a and b d. Decision theory
Last Answer : b. Queuing theory
Description : ....................... deals with the concepts such as critical path, float, events, etc. a. Game theory b. Decision theory c. Queuing theory d. Network analysis
Last Answer : d. Network analysis
Description : In simplex method, ........................ should be selected when there is tie between slack/surplus variable and decision variable. a. Slack variable b. Decision variable c. Surplus variable d. None of these
Last Answer : b. Decision variable
Description : The quantitative approach to decision analysis is a .......................... a. Logical approach b. Rational approach c. Scientific approach d. All of the above
Last Answer : c. Scientific approach
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 : ............................ models involve the allocation of resources to activities in such a way that some measure of effectiveness is optimised. a. Sequencing b. Allocation c. Queuing theory d. Decision theory
Last Answer : b. Allocation
Description : ............................refers to the manner in which the customers behave while being in the queue. a. Service pattern b. Service pattern c. Queue discipline d. None of these
Last Answer : c. Queue discipline
Description : In queuing theory, ...................... refers to those waiting in a queue or receiving service. a. Service provider b. Customer c. Both a and b d. None of these
Last Answer : b. Customer
Description : Which of the following best expresses the difference between programmed and non-programmed decisions? (a) Occur under certainty or risk; occur under uncertainty or ambiguity (b) Made by managers ... rules cannot be developed (d) Have computer routines developed for them; are not computerized
Last Answer : (c) Handled with decision rules; decision rules cannot be developed
Description : An assumption that implies that finite numbers of choices are available to a decision-maker and the decision variables do not assume negative values is known as _______ a. Certainty b. Continuity c. Finite choices d. None of the above
Last Answer : c. Finite choices
Description : Risk in capital budgeting implies that the decision maker knows _ of the cash flows. A. Variability B. Certainty C. Probability D. None of these
Last Answer : C. Probability
Description : If a simplex table shows the values 2, -3, 0 against “θ”, which should be taken as the replacement ratio. a. 2 b. -3 c. 0 d. None of these
Last Answer : c. 0
Description : The outlet where the services are being provided to the customers is called................. a. Waiting line b. Service facility c. Idle facility d. Traffic intensity
Last Answer : b. Service facility
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 : Hungarian method was developed by ........................ a. T C Koopman b. F L Hitchcock c. D Konig d. George B Dantzig
Last Answer : c. D Konig
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
Description : VAM is also called........................ a. Matrix Minima Method b. Penalty Method c. MODI Method d. None of these
Last Answer : b. Penalty Method
Description : Transportation model was first introduced by ........................ in the year 1941. a. T C Koopman b. George B Dantzig c. Von-neumann d. F L Hitchcock
Last Answer : d. F L Hitchcock
Description : ................................is that element of the simplex table which lis both in the key row and key column. a. Key element b. Pivot element c. Both a and b d. None of these
Last Answer : c. Both a and b
Description : Shadow price is also called ...................... a. Dual price b. Unit price c. Total cost d. None of these
Last Answer : a. Dual price
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 : Game theory became popular when the book “Theory of Games and Economic Behaviour” was published in 1944 by .............................. a. Von Neumann b. Mc Closky c. Von-Neumann and Mc Closky d. Von-neumann and Morgenstern
Last Answer : d. Von-neumann and Morgenstern
Description : Traffic intensity is computed by using the formula: a. λ/μ b. μ/λ c. 1- λ/μ d. 1- μ/λ
Last Answer : a. λ/μ
Description : Traffic intensity in Queuing Theory is also called........................... a. Service factor b. Arrival factor c. Utilisation factor d. None of these
Last Answer : c. Utilisation factor
Description : ..............................was the first person who developed a viable queueing theory a. Von Neumann b. Morgenstern c. H M Wagner d. Simeon Dennis Poisson
Last Answer : d. Simeon Dennis Poisson
Description : Excess of service facilities over and above the number of customers results: a. Idleness of service capacity b. Queues c. Both a and b d. None of these
Last Answer : a. Idleness of service capacity
Description : MODI Method to test the optimality of a feasible solution to TP is also called............... a. Stepping Stone Method b. u. v. Method c. both a and b d. none of these
Last Answer : b. u. v. Method
Description : Matrix Minima Method to find initial feasible solution to a TP is also called ....................... a. NWCM b. LCM c. VAM d. None of these
Last Answer : c. VAM