Practice Operations Research Multiple Choice Questions Quiz-2 - MCQGeeks.com

Q.1

The transition matrix elements remain positive from one point to the next. This property is known as:

Steady-state property
Equilibrium property
Regular property
All of the above

Q.2

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

Not necessary to assign the exact range of random number interval as the probability
Necessary to develop a cumulative probability distribution
Necessary to assign the particular appropriate random numbers
All of the above

Q.3

Analytical results are taken into consideration before a simulation study so as to.

Identify suitable values of the system parameters
Determine the optimal decision
Identify suitable values of decision variables for the specific choices of system parameters
All of the above

Q.4

To make simulation more popular, we need to avoid.

Large cost over runs
Prolonged delays
User dissatisfaction with simulation results
All of the above

Q.5

As simulation is not an analytical model, therefore the result of simulation must be viewed as.

Unrealistic
Exact
Approximation
Simplified

Q.6

In Markov analysis, state probabilities must.

Sum to one
Be less than one
Be greater than one
None of the above

Q.7

State transition probabilities in the Markov chain should.

Sum to 1
Be less than 1
Be greater than 1
None of the above

Q.8

Markov analysis is useful for:

Predicting the state of the system at some future time
Calculating transition probabilities at some future time
All of the above
None of the above

Q.9

If a matrix of transition probability is of the order n*n, then the number of equilibrium equations would be.

n
n-1
n+1
None of the above

Q.10

In the long run, the state probabilities become 0 & 1.

In no case
In same cases
In all cases
Cannot say

Q.11

Simulation should not be applied in all cases because it.

Requires considerable talent for model building & extensive computer programming efforts
Consumes much computer time
Provides at best approximate solution to problem
All of the above

Q.12

A constraint in an LP model becomes redundant because.

Two iso-profit line may be parallel to each other
The solution is unbounded
This constraint is not satisfied by the solution values
None of the above

Q.13

If two constraints do not intersect in the positive quadrant of the graph, then.

The problem is infeasible
The solution is unbounded
One of the constraints is redundant
None of the above

Q.14

A feasible solution to an LP problem.

Must satisfy all of the problem’s constraints simultaneously
Need not satisfy all of the constraints, only some of them
Must be a corner point of the feasible region
Must optimize the value of the objective function

Q.15

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

Resources must be limited
Only one objective function
Parameters value remains constant during the planning period
The problem must be of minimization type

Q.16

Non-negativity condition in an LP model implies.

A positive coefficient of variables in objective function
A positive coefficient of variables in any constraint
Non-negative value of resources
None of the above

Q.17

Constraints in LP problem are called active if they.

Represent optimal solution
At optimality do not consume all the available resources
Both a & b
None of the above

Q.18

The solution space (region) of an LP problem is unbounded due to.

An incorrect formulation of the LP model
Objective function is unbounded
Neither a nor b
Both a & b

Q.19

Which of the following statements is true with respect to the optimal solution of an LP problem?

Every LP problem has an optimal solution
Optimal solution of an LP problem always occurs at an extreme point
At optimal solution all resources are completely used
If an optimal solution exists, there will always be at least one at a corner

Q.20

Which of the following is an assumption of an LP model?

Divisibility
Proportionality
Additivity
All of the above

Q.21

Which of the following is a limitation associated with an LP model?

The relationship among decision variables in linear
No guarantee to get integer valued solutions
No consideration of effect of time & uncertainty on LP model
All of the above

Q.22

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

Variables value should remain under the control of the decision-maker
Value of variables make sense & correspond to real-world problems
Variables are interrelated in terms of limited resources
None of the above

Q.23

Before formulating a formal LP model, it is better to.

Express each constrain in words
Express the objective function in words
Verbally identify decision variables
All of the above

Q.24

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

Queuing Theory
Decision Theory
Both A and B
None of the above

Q.25

Linear programming is a.

Constrained optimization technique
Technique for economic allocation of limited resources
Mathematical technique
All of the above

Q.26

An assignment problem is a special case of transportation problem, where.

Number of rows equals number of columns
All rim conditions are 1
Values of each decision variable is either 0 or 1
All of the above

Q.27

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

Search Theory
Theory of replacement
Probabilistic Programming
None of the above

Q.28

While solving a LP model graphically, the area bounded by the constraints is called?

Feasible region
Infeasible region
Unbounded solution
None of the above

Q.29

An iso-profit line represents.

An infinite number of solutions all of which yield the same profit
An infinite number of solution all of which yield the same cost
An infinite number of optimal solutions
A boundary of the feasible region

Q.30

The graphical method of LP problem uses.

Objective function equation
Constraint equations
Linear equations
All of the above

0 h : 0 m : 1 s