Probabilistic models are also called ...........................
a. Deterministic models
b. Dynamic models
c. Stochastic models
d. None of these

1 Answer

Answer :

c. Stochastic models

Related questions

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 : Decision making under certainty refers to .............................. situation. a. Deterministic b. Probabilistic c. Competitive d. None of these

Last Answer : a. Deterministic

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 : 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 : .......................models consider time as one of the important variable. a. Dynamic b. Static c. Botha and b d. None of these

Last Answer : a. Dynamic

Description : ........................ models assume that the values of the variables do not change with time during a particular period. a. Dynamic b. Static c. Both a and b d. None of these

Last Answer : b. Static

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 : Standard planning algorithms assumes environment to be ___________ a) Deterministic b) Fully observable c) Single agent d) Stochastic

Last Answer : a) Deterministic

Description : What kind of behavior does the stochastic environment posses? a) Local b) Deterministic c) Rational d) Primary

Last Answer : a) Local

Description : What kind of environment is strategic in artificial intelligence? a) Deterministic b) Rational c) Partial d) Stochastic

Last Answer : a) Deterministic

Description : .........................are called mathematical models. a. Iconic models b. Symbolic models c. Analogue models d. None of these

Last Answer : b. Symbolic models

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

Last Answer : c. Both a and b

Description : ......................are representations of reality. a. Phases b. Models c. Both a and b d. None of these

Last Answer : b. Models

Description : .......................... models are obtained by enlarging or reducing the size of the items. a. Iconic models b. Analogue models c. Symbolic models d. None of these

Last Answer : a. Iconic models

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 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 : 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 : Controllable variables are also called.................................. a. Slack variables b. Surplus variables c. Artificial variable d. Decision variables

Last Answer : d. Decision variables

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 : Shadow price is also called ...................... a. Dual price b. Unit price c. Total cost d. None of these

Last Answer : a. Dual price

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 : 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

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

Last Answer : d. All of the above

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 : 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 : 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 : A customer’s behaviour of jumping from one queue to another is called ............................ a. Jockying b. Reneging c. Collusion d. Balking

Last Answer : a. Jockying

Description : A customer’s behaviour of leaving the queue due to impatience is called ....................... a. Jockying b. Reneging c. Collusion d. Balking

Last Answer : b. Reneging

Description : a customer’s behaviour of leaving the queue when he does not like to wait in the queue due to lack of time or space is called ..................... a. Jockying b. Reneging c. Collusion d. Balking

Last Answer : d. Balking

Description : The ration between mean arrival rate and mean service rate is called ................... a. Idle period b. Average length of queue c. Traffic intensity d. None of these

Last Answer : c. Traffic intensity

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 : When all the players of the game follow their optimal strategies, then the expected pay off of the game is called....................... a. Gain of the game b. Loss of the game c. Value of the game d. None of these

Last Answer : c. Value of the game

Description : A matrix which shows the gains and losses resulting from moves and counter moves is called.................................. a. Cost matrix b. Pay off matrix c. Both a and b d. None of these

Last Answer : b. Pay off matrix

Description : Each participant of the game is called................... a. Strategist b. Winner c. Player d. Loser

Last Answer : c. Player

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 : 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 : An activity which does not consume either resource or time is called ............................. a. Predecessor activity b. Successor activity c. Dummy activity d. Terminal activity

Last Answer : c. Dummy activity

Description : An activity which must be completed before commencement of one or more other activities is called................................. a. Successor activity b. Predecessor activity c. Dummy activity d. None of these

Last Answer : b. Predecessor activity

Description : The allocated cells in the transportation table are called .............................. a. Occupied cells b. Empty cells c. Unoccupied cells d. None of these

Last Answer : a. Occupied cells

Description : While solving a LPP graphically, the area bounded by constraints is called ................. a. Feasible region b. Infeasible region c. Unbounded region d. None of these

Last Answer : a. Feasible region

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 : The variables whose coefficient vectors are unit vectors, are called ...................... a. Unit variables b. Basic variables c. Non-basic variables d. None of these

Last Answer : b. Basic variables

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 : .................... 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