Skip to content

Operations Research MCQ Questions

0
Answered
0
Correct
0%
Accuracy
Q1 Easy

A method for calculating a random value from a probability distribution using the distribution’s inverse cumulative probability function is called:

Single-Trial Worksheet (STW) Method
Inverse Transform Method
Placeholder
Replication Method
Q2 Easy

______ the amount by which the left-hand-side values are greater than the right-hand-side values in LP constraints

Slack
Surplus
Both a & b
None of these
Q3 Easy

Range of feasibility is the limited range over which the shadow price ______

Remains constant
Large
Small
Both a & c
Q4 Easy

Corner point solution method an approach in ________

Procedural Programming
Functional Programming
Scripting Programming
Linear programming
Q5 Easy

Which is the correct statement of Objective function ?

The objective of an LP problem expressed mathematically
The limited range over which the shadow price remains constant
The range of values of the objective function within which the optimal values of the decision variables will not change
None of these
Q6 Easy

______ is the effect of changing a decision variable that is proportional to its magnitude.

Corner point
Linear relationship
Iso-profit line
Range of optimality
Q7 Easy

A method by which parallel cost lines are plotted in the LP graphical solution approach to determine the least cost solution to LP problems with cost minimization objective is known as

Iso-cost line method
Iso-profit line method
Linear relationship
None of these
Q8 Easy

The Simplex method can solve ........

equations which have equal numbers of unknowns.
equations which have less numbers of unknowns than the equation itself.
equations which have more numbers of unknowns that the equation itself.
Q9 Easy

__________ is a variable used to take the place of a value in a calculation; the variable will be replaced with an actual value when real data is available.

Single-Trial Worksheet (STW) Method
Inverse Transform Method
Placeholder
Replication Method
Q10 Easy

The range of values of the objective function within which the best values of the decision variables will not change is known as the ______.

Range of optimality
Range of feasibility
Linear relationship
Iso-profit line
Q11 Easy

A petrol pump is opening a customer service centre which will be having only one counter to attend to the people. The manager estimates that the customers will arrive at the rate of 25 per hour. The customer care executive who has been considered for the post can attend customers at the rate of 1 customer every 2 minutes. Assuming Poisson arrivals and exponential service, calculate the average waiting time of the customers.

1/5th of an hour
1/8th of an hour
1/3rd of an hour
1/6th of an hour
Q12 Easy

A cinema hall has a single ticket counter. During the peak hours, people arrive at the rate of 50 per hour to watch the movie. The average number of people who get the tickets is 100 per hour. Calculate the probability of the ticket counter being free.

1
2
0.5
1.5
Q13 Easy

The Monte-Carlo simulation technique _________.

uses random numbers for generating data
is used to solve stochastic situations
uses mathematical techniques to solve all problems
is used where physical experimentation with the actual system is possible
Q14 Easy

The range of values of the objective function within which the optimal values of the decision variables will not change is known as

Range of optimality
Range of feasibility
Redundant constraints
Shadow price or dual price
Q15 Easy

If there were no ______ on the availability of resources, linear programming would not be needed as a decision-making tool.

Restrictions
Visibility
Decisions
Slack
Q16 Easy

______ has been applied in a variety of industries to address a variety of problems.

Linear programming
Iso-profit line
Range of feasibility
Corner point
Q17 Easy

Which of the following types of cost is dependent upon the amount of utilization of resources during the execution of individual activities?

Project cost
Indirect cost
Direct cost
Q18 Easy

______ is the determination of how subtle the current optimal solution is to changes in the input parameter values.

Iso-profit line
Range of feasibility
Linear relationship
Sensitivity
Q19 Easy

A method used to generate trials for a simulation is called _______________ .

Single-Trial Worksheet (STW) Method
Inverse Transform Method
Placeholder
Replication Method
Q20 Easy

Which activity of PERT/CPM does not utilize any kind of resources?

Dummy activity
Concurrent activity
Successor activity
Predecessor activity
Q21 Easy

Which among the following is not an element of Linear Programming?

Graphical method
Simplex method
Queuing theory
Differential calculus
Q22 Easy

Iso-profit line method determine the maximum profit solution to LP problems with profit maximization objective

True
False
Q23 Easy

Which of the following is a term used to describe the behavior of a customer who leaves the queue impatiently after waiting for some period of time?

Balking
Reneging
Jockeying
Collusion
Q24 Easy

Payoffs (in $000) for three alternatives under three possible states of nature: Alternative X: 50, 30, -10 Alternative Y: 80, 20, -30 Alternative Z: 40, 35, 10 Which alternative should be chosen under the optimistic (maximax) criterion?

Alternative X
Alternative Y
Alternative Z
Q25 Easy

Which one of the following is a cycling error in the Network Logic of PERT/CPM?

Looping error
Dangling error
Merging error
Bursting error
Q26 Easy

Six jobs have operation times of 12, 18, 25, 20, 30 and 15 minutes. What is the average processing time?

20 minutes
22 minutes
24 minutes
26 minutes
Q27 Easy

Which state of the system in the Queuing theory lays down that the operating characteristics are dependent on time?

Transient state
Steady state
Explosive test
Q28 Easy

Solve the game by finding the saddle point of this payoff matrix (rows are player A's strategies, columns are player B's): A1: 8, 10, 9 A2: 6, 4, 12 A3: 7, 9, 3

12
9
8
4
Q29 Easy

The elements Carbon, Magnesium and Sulfur are found in two products, P and Q. The amount of each element (milligrams per ounce) is given above:The cost of the products is $5 per ounce and $10 per ounce respectively. The minimum requirement to make this product is 2 mg of Carbon, 5 mg of Magnesium and 8 mg of Sulfur.Formulate this problem in the Linear Programming Form.

0.15x1 + 0.10x2 ≤ 2 0.50x1 + 0.55x2 ≤ 5 0.25x1 + 0.30x2 ≤ 8
0.15x1 + 0.10x2 ≥ 2 0.50x1 + 0.55x2 ≥ 5 0.25x1 + 0.30x2 ≥ 8
0.15x1 + 0.10x2 = 2 0.50x1 + 0.55x2 = 5 0.25x1 + 0.30x2 = 8
Q30 Easy

______ is the amount by which the left-hand side values are less than the right-hand side values.

Slack
Surplus
Constraints
Objective function
Q31 Easy

_______ in an LP model such as production levels, purchase quantities, and shipping routes that are under the control of the decision maker

Decision variables
Moderating variables
Control variables
Extraneous variables
Q32 Easy

Which among the following is not an element of the Project Schedule Characteristic of PERT/CPM?

Developing a network diagram
Re-allocation of resources
Estimating the duration of activities
Resource availability
Q33 Easy

Five jobs are processed on one machine in the order J1 to J5, with processing times of 5, 8, 4, 7 and 6 hours, and all are available at time zero. What is the mean flow time?

17.8 hours
18.4 hours
19.2 hours
20.5 hours
Q34 Easy

Which among the following characteristics of the game theory involves the quantitative measure of satisfaction?

Chance of strategy
Pay-offs
Alternatives
Chance of activities
Q35 Easy

Goal Programming is used to:

handle a single goal with multiple goals.
handle multiple goals with single goals.
handle only multiple goals.
handle only single goals.
Q36 Easy

In which of the following types of decisions does there exist only one outcome for a decision?

Decision under conflict
Decision under risk
Decision under uncertainty
Decision under certainty
Q37 Easy

Constraints in an LP problem that do not affect the boundaries of the feasible solution region is known as

Range of optimality
Range of feasibility
Redundant constraints
Shadow price or dual price
Q38 Easy

A(n) ___________ solution satisfies all the constraint expressions simultaneously.

Bjective
Extreme
Feasible
Infeasible
Q39 Easy

The crash cost and the crash time of a project is $50000 and 30 days respectively. The normal cost and the normal time of the same project is $150000 and 180 days respectively. Calculate the cost slope.

0.33
0.43
0.53
0.63
Q40 Easy

The probabilities that an item fails during its 1st, 2nd, 3rd and 4th month are 0.10, 0.15, 0.25 and 0.50. What is the probability that the item fails by the end of the 2nd month?

0.15
0.25
0.35
0.45
Q41 Easy

A person comes to a cyber cafe everyday. Sometimes, he has to wait for the cyber cafe to open and at other times, he arrives late. The opening time of the cafe varies from day to day. Study the above table, computed for 8 days, and calculate the average waiting time of that person.

2.2 minutes
3.2 minutes
4.2 minutes
5.2 minutes
Q42 Easy

Multiple optimum solutions every combination of values of the decision variables that falls on that segment of the constraint line

True
False
Q43 Easy

In Dynamic Programming, the value of ..... variables specifies the condition of a process.

state variables
decision variables
stage variables
Q44 Easy

A discotheque has a single ticket-counter. During rush hours, people arrive at the rate of 50 per hour. The average number of people allowed to enter is 100 per hour. Calculate the average number of people who still have to wait in the queue for their turn.

2
3
4
1
Q45 Easy

Payoffs (in $000) for three alternatives under three possible states of nature: Alternative X: 50, 30, -10 Alternative Y: 80, 20, -30 Alternative Z: 40, 35, 10 Which alternative should be chosen under the Laplace (equal likelihood) criterion?

Alternative X
Alternative Y
Alternative Z
Q46 Easy

What is the "confidence interval" in the context of Monte Carlo Simulation?

The range of values that are considered acceptable for the outcome
The range of random numbers used in the simulation
The percentage of iterations that converge to the correct result
The range of values within which the true value of the outcome is likely to lie
Q47 Easy

How does the accuracy of the Monte Carlo Simulation results improve with more iterations?

The accuracy remains the same regardless of the number of iterations
The accuracy decreases as more iterations are performed
The accuracy increases, and the results approach the true value of the outcome
The accuracy fluctuates randomly with more iterations
Q48 Easy

The graphical method for solving transportation problems can be applied to _______ variables.

5
2
3
4
Q49 Easy

In Monte Carlo Simulation, what does "convergence" refer to?

The point at which the simulation is terminated
The process of generating random numbers
The process of reaching a stable and consistent result as more iterations are performed
The accuracy of the random number generator
Q50 Easy

The constraints that form the corner points at the boundaries of the feasible solution region are known as ______.

Redundant constraints
Surplus constraints
Binding constraints
Infinite constraints
Showing 50 of 79 questions

About these Operations Research questions

Questions on operations research: linear programming and the simplex method, transportation problems, queuing, PERT/CPM, game theory, dynamic programming and simulation.

Topics: Linear programming, Transportation, Queuing, Project scheduling, and Other models.

What the Operations Research test covers and how to prepare

Teachers: using these Operations Research questions with a class? Tell us about your class.

Report a mistake

What's wrong?