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 : ....................... 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 : ............................ 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 : ...................... 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 : 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 : 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 : 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 : ............................ is the sequence of activities which determines the total project duration. a. Critical path b. Network c. Non-critical activities d. None of these
Last Answer : a. Critical path
Description : Number of customers in the queue per unit of time is called ...................... a. Queuing system b. Length of queue c. Average length of queue d. None of these
Last Answer : c. Average length of queue
Description : ......................... is a scheme or design of something intended to do. a. Network b. Float c. Project d. Program
Last Answer : a. Network
Description : Activities lying on critical path are called ............................ a. Critical activities b. Non-critical activities c. Dummy activities d. None of these
Last Answer : a. Critical activities
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 : In network diagram, events are commonly represented by ......................... a. Arrows b. Nodes c. Triangles d. None of these
Last Answer : b. Nodes
Description : .......................... is the duration by which an activity can be delayed without delaying the project. a. Slack b. Total float c. Both a and b d. None of these
Last Answer : b. Total float
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 : 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
Last Answer : 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 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 : A critical path network diagram does NOT: A. Help determine the amount of float B. Identify the particularly important activities C. Calculate earned value D. Calculate the duration of the whole project
Last Answer : C. Calculate earned value
Description : The basic difference between PERT and CPM is that a. PERT deals with events and CPM with activities b. Critical Path is determined in PERT only c. Costs are considered on CPM only d. Guessed times are used in PERT and evaluated times in CPM.
Last Answer : a. PERT deals with events and CPM with activities
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 : 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 : Decision making under certainty refers to .............................. situation. a. Deterministic b. Probabilistic c. Competitive d. None of these
Last Answer : a. Deterministic
Description : A LPP model doesnot contain: a. Decision b. Constraints c. Feasible solution d. Spread Sheet
Last Answer : d. Spread Sheet
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
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 : 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 : 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 : ........................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 : Location analysis techniques typical typically employed by manufact anufacturing organizations include include a. transportation method b. queuing theory queuing theory c. correlation correlation analysis analysis and traffic traffic counts d. simulation
Last Answer : a. transportation method
Description : Which of the following is a location analysi analysis technique chnique typically e cally employed mployed by a service organization? a. purchasing power analysis b. linear linear programming c. queuing theory d. crossover charts e. cost-volume cost-volume analysis
Last Answer : a. purchasing power analysis
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 : ............................... 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 : In a network diagram, activity is denoted by ............................ a. Node b. Arrow c. Triangle d. None of these
Last Answer : b. Arrow
Description : ......................... is a series of activities related to a project. a. Network b. Transportation Model c. Assignment model d. None of these
Description : ................... is an event oriented network diagram. a. CPM b. PERT c. Histogram d. Ogive
Last Answer : b. PERT
Description : ......................... is activity oriented network diagram. a. CPM b. PERT c. Histogram d. Ogive
Last Answer : a. CPM
Description : In the time-cost optimisation, using CPM method for network analysis, the crashing of the activities along the critical path is done starting with the activity having (A) Longest duration (B) Highest cost slope (C) Least cost slope (D) Shortest duration
Last Answer : (C) Least cost slope
Description : In a ........................game the amounts won by all winners together is equal to the sum of the amounts lost by all losers together. a. Non-zero sum game b. Zero sum game c. Rectangular game d. None of these
Last Answer : b. Zero sum game