OR MCQ's




Question 1 :
If a problem can be broken into sub-problem which are reused several times, the problem possesses ……………property.

  1. Overlapping sub-problem
  2. Optimal substructure
  3. Memoization
  4. Greedy
  

Question 2 :
In the Simplex method to convert a constraint of type ≤, to equation form, we need to add what type of variable?

  1. surplus variable
  2. slack variable
  3. artificial variable
  4. dual variable
  

Question 3 :
The unit of traffic intensity is:

  1. Poisson
  2. Markow
  3. Erlang
  4. Kendall
  

Question 4 :
What will be the average number of empty space in the lorry

  1. 0
  2. 1
  3. 2
  4. 3
  

Question 5 :
Determine the idle time of the service facility

  1. 1 min
  2. 2 min
  3. 3 min
  4. 0 min
  

Question 6 :
Three people A, B, and C are standing on one bank of a river and wish to cross to the opposite bank using a canoe. The canoe can hold maximum 2 people at a time. A can row across in 1min, B takes 6min and C takes 12min. If two people are in the canoe, the slower person dictates the crossing time. What is the smallest time to move all 3 people to the other side of the river?

  1. 19 min
  2. 12 min
  3. 18 min
  4. 13 min
  

Question 7 :
If a two person zero sum game is converted to a Linear Programming Problem,

  1. Number of variables must be two only
  2. There will be no objective function
  3. Row player represents Primal problem, Column player represent Dual problem
  4. Number of constraints is two only
  

Question 8 :
Four people A, B, C and D are standing on one bank of a river and wish to cross to the opposite bank using a canoe. The canoe can hold maximum 2 people at a time. A can row across in 2 min, B takes 4 min, C takes 7 min and D takes 12 min. If two people are in the canoe, the slower person dictates the crossing time. What is the smallest time to move all 4 people to the other side of the river?

  1. 28 min
  2. 27 min
  3. 25 min
  4. 26 min
  

Question 9 :
Find a recurrence relation and initial conditions for 1, 5, 17, 53, 161, 485…

  1. an=3an−1 + 2 and a0 = 0
  2. an=3an−1 - 2 and a0 = 0
  3. an=3an−1 + 2 and a0 = 1
  4. an=3an−1 - 2 and a0 = 1
  

Question 10 :
In linear programming extreme points are:

  1. variables representing unused resources
  2. variables representing an excess above a resource requirement
  3. all the points that simultaneously satisfy all the constraints of the model
  4. corner points on the boundary of the feasible solution space
  

Question 11 :
In a two person zero sum game, the following does not hold correct:

  1. Row player is always a loser
  2. Column Player is always a winner.
  3. Column player always minimizes losses
  4. If one loses, the other gains.
  

Question 12 :
For which of the following problems is most suitable for Probabilistic Dynamic problem solving method?

  1. Distributing medical teams to countries
  2. Scheduling employment levels
  3. Winning in Las Vegas
  4. Stagecoach problem
  

Question 13 :
Consider the constraints for a LPP 7a + 3b ≤ 24, a + 2b ≤ 6 and b ≤ 6. Given a, b ≥ 0. The number of vertex points in the feasibility convex region are?

  1. 4
  2. 6
  3. 8
  4. 10
  

Question 14 :
A contractor has to supply 10,000 bearings per day to an automobile manufacturer. He finds that, when he starts production run, he can produce 25,000 bearing per day. The cost of holding a bearing in stock for a year is Rs. 2 and set up cost of a production run is Rs. 1800. How frequently should production run be made

  1. 10.44 days
  2. 11.44 days
  3. 12 days
  4. 11 days
  

Question 15 :
Having more than one shipping distribution but with the same total cost is known as:

  1. a prohibited solution
  2. an unequal solution
  3. an alternative optimal solution
  4. a transshipment solution
  

Question 16 :
Consider the constraints for a LPP 3a + 5b =15 and 5a + 2b = 10. Given a, b ≥ 0. The number of vertex points in the feasibility convex region are?

  1. 1
  2. 2
  3. 3
  4. 4
  

Question 17 :
Arrival rate of telephone calls at a telephone booth is according to Poisson distribution, with an average time of 9 minutes between consecutive arrivals. The length of telephone call is exponentially distributed with a man of 3 minutes. Find the average queue length that forms from time to time

  1. 1.5 persons
  2. 1 person
  3. 2.5 persons
  4. 12.5 persons
  

Question 18 :
Linear relationships representing a restriction on decision making in a linear programming model are known as

  1. objective function
  2. constraints
  3. extreme points
  4. slack variables
  

Question 19 :
Re-order level of an item is always

  1. Less than its minimum stock
  2. Less than its maximum stock
  3. More than its maximum stock
  4. More than its minimum stock
  

Question 20 :
Consider the constraints for a LPP 7a + 3b ≤ 24 and b ≤ 2. Given a, b ≥ 0. The number of vertex points in the feasibility convex region are?

  1. 2
  2. 4
  3. 6
  4. No Feasible region
  

Question 21 :
In a departmental store one cashier is there to serve the customers and the customers pick up their needs by themselves. The arrival rate is 9 customers for every 5 minutes and the cashier can serve 10 customers in 5 minutes. Assuming Poisson arrival rate and exponential distribution for service rate. Find average number of customers in the system.

  1. 0.11 customers
  2. 9 customers
  3. 11 customers
  4. 0.9 customers
  

Question 22 :
One of the assumption in the game theory is—

  1. All players act rationally and intelligently
  2. Winner alone acts rationally
  3. Loser acts intelligently
  4. Both the players believe luck
  
Pages