Description : ...................... is a method of analysing the current movement of the some variable in an effort to predict the future movement of the same variable. a. Goal programming b. Queuing theory c. Markov Analysis d. Replacement theory
Last Answer : c. Markov Analysis
Description : Linear Programming technique is a: a. Constrained optimisation technique b. Technique for economic allocation of resources c. Mathematical technique d. All of the above
Last Answer : d. All of the above
Description : Decision making under certainty refers to .............................. situation. a. Deterministic b. Probabilistic c. Competitive d. None of these
Last Answer : a. Deterministic
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 : Which of the following method is used to solve mixed strategy problems: a. Probability method b. Graphic method c. Linear Programming method d. All of the above
Description : Straight lines shown in a linear programming graph indicates ........................... a. Objective function b. Constraints c. Points d. All of the above
Last Answer : b. Constraints
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 : Which of the followings is an assumption of Linear Programming Technique? a. Divisibility b. Additivity c. Proportionality d. All of the above
Description : Linear Programming Technique helps to find an optimal use of: a. Machine b. Money c. Manpower 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 : 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 : .................... is considered as the pioneer of Linear Programming Technique. a. churchman b. D W Miller c. James Lundy d. George B Dantzig
Last Answer : d. George B Dantzig
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 : All the parameters in the linear programming model are assumed to be ..................... a. Variables b. Constraints c. Functions d. None of these
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 : ........................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 : Queuing theory is also termed as ............................ a. Game theory b. Replacement theory c. Waiting line theory d. None of these
Last Answer : c. Waiting line theory
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 : 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 : 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 graphical method if LPP uses: a. Linear equations b. Constraint equations c. Objective function d. All of the above
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 : In queuing theory, FCFS stand for .............................. a. First Cum First Served b. First Customer Fist Served c. Fast Channel First Served
Last Answer : a. First Cum First Served
Description : In queuing theory, ............................ stands for mean service rate. a. μ b. λ c. t d. none of these
Last Answer : a. μ
Description : In queuing theory, ............................ stands for mean arrival rate of customers. a. μ b. λ c. t d. none of these
Last Answer : b. λ
Description : In waiting line theory, number of customers waiting in the queue is referred to as ................ a. Traffic intensity b. Queuing system c. Service pattern d. Queue length
Last Answer : d. Queue length
Description : In queuing theory, ...................... is a person by whom service is rendered. a. Customer b. Server c. a or b d. none of these
Last Answer : b. Server
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 is an assumption of game theory? a. The players act rationally and intelligently b. Each payer has a finite set of possible courses of action c. The players attempt to maximise gains or minimises losses d. All of the above
Description : ............................is known as father of game theory. a. Von Neumann b. A K Erlang c. George b Dantzig d. Arnoff
Last Answer : a. Von Neumann
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 : 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 : ............................... is used to imitate an operation prior to actual performance. a. Inventory control b. Simulation c. Game theory d. Integrated Production Model
Last Answer : b. Simulation
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 : ......................... 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 : ............................ 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 : Which algorithm is used for solving temporal probabilistic reasoning? a) Hill-climbing search b) Hidden markov model c) Depth-first search d) Breadth-first search
Last Answer : b) Hidden markov model
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 : 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