675 + Mcqs in Operations Research Page 14 McqOptions

651.	Which of the following characteristics apply to queuing system?
A.	Customer population
B.	Arrival process
C.	Both a & b
D.	Neither a nor b
Answer» D. Neither a nor b

Discussion

652.	In a matrix of transition probability, the element aij where i=j is a.
A.	Gain
B.	Loss
C.	Retention
D.	None of the above
Answer» D. None of the above

Discussion

653.	A calling population is considered to be infinite when.
A.	All customers arrive at once
B.	Arrivals are independent of each other
C.	Arrivals are dependent upon each other
D.	All of the above
Answer» C. Arrivals are dependent upon each other

Discussion

654.	Simulation is defined as.
A.	A technique that uses computers
B.	An approach for reproducing the processes by which events by chance & changes are created in a computer
C.	A procedure for testing & experimenting on models to answer what if ___, then so & so ___ types of questions
D.	All of the above
Answer» E.

Discussion

655.	While assigning random numbers in Monte Carlo simulation, it is?
A.	Not necessary to assign the exact range of random number interval as the probability
B.	Necessary to develop a cumulative probability distribution
C.	Necessary to assign the particular appropriate random numbers
D.	All of the above
Answer» C. Necessary to assign the particular appropriate random numbers

Discussion

656.	Which of the following is not one of the assumptions of Markov analysis:
A.	There are a limited number of possible states
B.	A future state can be predicted from the preceding one
C.	There are limited number of future periods
D.	All of the above
Answer» D. All of the above

Discussion

657.	While calculating equilibrium probabilities for a Markov process, it is assumed that?
A.	There is a single absorbing state
B.	Transition probabilities do not change
C.	There is a single non-absorbing state
D.	None of the above
Answer» C. There is a single non-absorbing state

Discussion

658.	The operations Research technique which helps in minimizing total waiting and service costs is.
A.	Queuing Theory
B.	Decision Theory
C.	Both A and B
D.	None of the above
Answer» B. Decision Theory

Discussion

659.	What is concerned with the prediction of replacement costs and determination of the most economic replacement policy ?
A.	Search Theory
B.	Theory of replacement
C.	Probabilistic Programming
D.	None of the above
Answer» C. Probabilistic Programming

Discussion

660.	As for maximization in assignment problem, the objective is to maximize the ___________.
A.	Profit
B.	optimization
C.	cost
D.	None of the above
Answer» B. optimization

Discussion

661.	In simplex method, we add _____________ variables in the case of ‚Äö√Ñ√≤=‚Äö√Ñ√¥.#
A.	Slack Variable
B.	Surplus Variable
C.	Artificial Variable
D.	None of the above
Answer» D. None of the above

Discussion

662.	What aims at optimizing inventory levels?
A.	Inventory Control
B.	Inventory Capacity
C.	Inventory Planning
D.	None of the above
Answer» D. None of the above

Discussion

663.	Operations Research uses models to help the management to determine its ___________ scientifically.
A.	Policies
B.	Actions
C.	Both A and B
D.	None of the above
Answer» D. None of the above

Discussion

664.	Non-negativity condition is an important component of LP model because.
A.	Variables value should remain under the control of the decision-maker
B.	Value of variables make sense & correspond to real-world problems
C.	Variables are interrelated in terms of limited resources
D.	None of the above
Answer» C. Variables are interrelated in terms of limited resources

Discussion

665.	Any column or raw of a simplex table is called a __________.
A.	Vector
B.	Key column
C.	Key Raw
D.	None of the above
Answer» B. Key column

Discussion

666.	Alternative solutions exist of an LP model when.
A.	One of the constraints is redundant
B.	Objective function equation is parallel to one of the constraints
C.	Two constraints are parallel
D.	All of the above
Answer» C. Two constraints are parallel

Discussion

667.	A constraint in an LP model becomes redundant because.
A.	Two iso-profit line may be parallel to each other
B.	The solution is unbounded
C.	This constraint is not satisfied by the solution values
D.	None of the above
Answer» E.

Discussion

668.	A feasible solution to an LP problem.
A.	Must satisfy all of the problem‚Äö√Ñ√¥s constraints simultaneously
B.	Need not satisfy all of the constraints, only some of them
C.	Must be a corner point of the feasible region
D.	Must optimize the value of the objective function
Answer» B. Need not satisfy all of the constraints, only some of them

Discussion

669.	Which of the following is not a characteristic of the LP?
A.	Resources must be limited
B.	Only one objective function
C.	Parameters value remains constant during the planning period
D.	The problem must be of minimization type
Answer» E.

Discussion

670.	All the parameters in the linear programming model are assumed to be ____________.
A.	Variables
B.	Constraints
C.	Functions
D.	None of the above
Answer» C. Functions

Discussion

671.	Managerial decisions are based on.
A.	An evaluation of quantitative data
B.	The use of qualitative factors
C.	Results generated by formal models
D.	All of the above
Answer» E.

Discussion

672.	One disadvantage of using North-West Corner rule to find initial solution to the transportation problem is that.
A.	It is complicated to use
B.	It does not take into account cost of transportation
C.	It leads to a degenerate initial solution
D.	All of the above
Answer» C. It leads to a degenerate initial solution

Discussion

673.	The smallest quantity is chosen at the corners of the closed path with negative sign to be assigned at unused cell because.
A.	It improve the total cost
B.	It does not disturb rim conditions
C.	It ensure feasible solution
D.	All of the above
Answer» D. All of the above

Discussion

674.	An optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of.
A.	Rows or columns
B.	Rows & columns
C.	Rows + columns ‚Äö√Ñ√¨ 1
D.	None of the above
Answer» E.

Discussion

675.	An assignment problem can be solved by.
A.	Simplex method
B.	Transportation method
C.	Both a & b
D.	None of the above
Answer» D. None of the above

Discussion

Explore topic-wise MCQs in General Management.

Which of the following characteristics apply to queuing system?

In a matrix of transition probability, the element aij where i=j is a.

A calling population is considered to be infinite when.

Simulation is defined as.

While assigning random numbers in Monte Carlo simulation, it is?

Which of the following is not one of the assumptions of Markov analysis:

While calculating equilibrium probabilities for a Markov process, it is assumed that?

The operations Research technique which helps in minimizing total waiting and service costs is.

What is concerned with the prediction of replacement costs and determination of the most economic replacement policy ?

As for maximization in assignment problem, the objective is to maximize the ___________.

In simplex method, we add _____________ variables in the case of ‚Äö√Ñ√≤=‚Äö√Ñ√¥.#

What aims at optimizing inventory levels?

Operations Research uses models to help the management to determine its ___________ scientifically.

Non-negativity condition is an important component of LP model because.

Any column or raw of a simplex table is called a __________.

Alternative solutions exist of an LP model when.

A constraint in an LP model becomes redundant because.

A feasible solution to an LP problem.

Which of the following is not a characteristic of the LP?

All the parameters in the linear programming model are assumed to be ____________.

Managerial decisions are based on.

One disadvantage of using North-West Corner rule to find initial solution to the transportation problem is that.

The smallest quantity is chosen at the corners of the closed path with negative sign to be assigned at unused cell because.

An optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of.

An assignment problem can be solved by.