Operations Research Online MCQ Set 6

QN01. While solving a linear programming problem infeasibility may be removed by ______________.

  1. adding another constraint
  2. adding another variable
  3. removing a constraint
  4. removing a variable
Answer

(C)removing a constraint

QN02. The right hand side constant of a constraint in a primal problem appears in the corresponding dual as______________.

  1. a coefficient in the objective function
  2. a right hand side constant of a function
  3. an input output coefficient a left hand side constraint
  4. coefficient variable
Answer

(A)a coefficient in the objective function

QN03. During iteration while moving from one solution to the next, degeneracy may occur when______________

  1. the closed path indicates a diagonal move
  2. two or more occupied cells are on the closed path but neither of them represents a corner of the path.
  3. two or more occupied cells on the closed path with minus sign are tied for lowest circled value.
  4. the closed path indicates a rectangle move.
Answer

(C)two or more occupied cells on the closed path with minus sign are tied for lowest circled value.

QN04. Maximization assignment problem is transformed into a minimization problem by______________.

  1. adding each entry in a column from the maximum value in that column
  2. subtracting each entry in a column from the maximum value in that column
  3. subtracting each entry in the table from the maximum value in that table
  4. adding each entry in the table from the maximum value in that table
Answer

(C)subtracting each entry in the table from the maximum value in that table

QN05. Priority queue discipline may be classified as______________.

  1. pre-emptive or non-pre-emptive
  2. limited
  3. unlimited
  4. finite
Answer

(C)unlimited

QN06. Replace an item when______________.

  1. average cost upto date is equal to the current maintenance cost
  2. average cost upto date is greater than the current maintenance cost
  3. average cost upto date is less than the current maintenance cost.
  4. next year running cost in more than average cost of nth year
Answer

(A)average cost upto date is equal to the current maintenance cost

QN07. In time cost trade off function analysis______________.

  1. cost decreases linearly as time increases
  2. cost increases linearly as time decreases
  3. cost at normal time is zero
  4. cost increases linearly as time increases
Answer

(A)cost decreases linearly as time increases

QN08. The transportation problem deals with the transportation of ______________.

  1. a single product from a source to several destinations
  2. a single product from several sources to several destinations
  3. a single product from several sources to a destination
  4. a multi -product from several sources to several destinations
Answer

(A)a single product from a source to several destinations

QN09. The minimum number of lines covering all zeros in a reduced cost matrix of order n can be ______________.

  1. at the most n
  2. at the least n
  3. n-1
  4. n+1
Answer

(A)at the most n

QN10. For a 2.5% increase in order quantity (under fundamental EOQ problem) the total relevant cost would ______________

  1. increase by 2.5%.
  2. decrease by 2.5%.
  3. increase by 0.25%.
  4. decrease by 0.25%.
Answer

(A)increase by 2.5%.

QN11. In the basic EOQ model, if the lead time increases from 2 to 4 days, the EOQ will ______________

  1. double increase
  2. remain constant
  3. but not double
  4. decrease by a factor of two
Answer

(B)remain constant

QN12. When the sum of gains of one player is equal to the sum of losses to another player in a game, this situation is known as ______________.

  1. two-person game
  2. two-person zero-sum game
  3. zero-sum game
  4. non-zero-sum game
Answer

(C)zero-sum game

QN13. In the network, one activity may connect any ______________ nodes

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

(B)2

QN14. Graphical method is also known as ______________.

  1. Simplex Method
  2. Dual Simplex Method
  3. Big-M Method
  4. Search-Approach Method
Answer

(D)Search-Approach Method

QN15. If the given Linear Programming Problem is in its standard form then primal-dual pair is ______________.

  1. symmetric
  2. un symmetric
  3. square
  4. triangle
Answer

(B)un symmetric

QN16. The method used to solve Linear Programming Problem without use of the artificial variable is called ______________.

  1. Simplex Method
  2. Big-M Method
  3. Dual Simplex Method
  4. Graphical Mehtod
Answer

(C)Dual Simplex Method

QN17. When the total demand is equal to supply then the transportation problem is said to be ______________

  1. balanced
  2. unbalanced
  3. maximization
  4. minimization
Answer

(A)balanced

QN18. For finding an optimum solution in transportation problem ______________ method is used.

  1. Simplex
  2. Big-M
  3. Modi
  4. Hungarian
Answer

(C)Modi

QN19. Linear Programming Problem is a technique of finding the ______________.

  1. optimal value
  2. approximate value
  3. initial value
  4. infeasible value
Answer

(A)optimal value

QN20. Any solution to a Linear Programming Problem which also satisfies the non- negative notifications of the problem has ______________.

  1. solution
  2. basic solution
  3. basic feasible solution
  4. feasible solution
Answer

(D)feasible solution

QN21. Customers arrive at a box office window, being manned ny single individual, according to Poisson input process with mean rate of 20 per hour, while the mean service time is 2 minutes. Which of the following is not true for this system?

  1. E(n) = 2 customers
  2. E(m) = 4/3 customers
  3. E(v) = 6 minutes
  4. E(w) = 16 minutes
Answer

(A)E(n) = 2 customers

QN22. A game is said to be strictly determinable if______________.

  1. maximin value equal to minimax value
  2. maximin value is less than or equal to minimax value
  3. maximin value is greater than or equal to minimax value
  4. maximin value is not equal to minimax value
Answer

(A)maximin value equal to minimax value

QN23. The irreducible minimum duration of the project is called ______________.

  1. critical time
  2. normal time
  3. cost slope
  4. crash duration
Answer

(D)crash duration

QN24. The cost of a slack variable is ______________.

  1. 0
  2. 1
  3. 2
  4. -1
Answer

(A)0

QN25. Linear Programming Problem that can be solved by graphical method has ______________.

  1. linear constraints
  2. quadratic constraints
  3. non linear constraints
  4. bi-quadratic constraints
Answer

(A)linear constraints

QN26. If one or more variable vanish then a basic solution to the system is called ______________.

  1. non feasible region
  2. feasible region
  3. degenerate solution
  4. basic solution
Answer

(C)degenerate solution

QN27. ______________ method is an alternative method of solving a Linear Programming Problem involving artificial variables

  1. Simplex Method
  2. Big-M Method
  3. Dual Simplex Method
  4. Graphical Mehtod
Answer

(B)Big-M Method

QN28. The server utilization factor is also known as ______________

  1. erlang distribution
  2. poisson distribution
  3. exponential distribution
  4. traffic intensity
Answer

(D)traffic intensity

QN29. In a transportation table, an ordered set of______________ or more cells is said to form a loop

  1. 2
  2. 3
  3. 4
  4. 5
Answer

(C)4

QN30. A Linear Programming Problem have ______________ optimal solution

  1. 1
  2. 2
  3. more than 1
  4. more than 2
Answer

(C)more than 1

QN31. An n-tuple of real numbers which satisfies the constraints of Linear Programming Problem is called ______________

  1. solution
  2. basic solution
  3. basic feasible solution
  4. feasible solution
Answer

(A)solution

QN32. Chose the correct statement: A degenerate solution is one that______________.

  1. gives an optimum solution to the Linear Programming Problem
  2. gives zero value to one or more of the basic variables
  3. yields more than one way to achieve the objective
  4. makes use of all available resources
Answer

(B)gives zero value to one or more of the basic variables

QN33. At any iteration of the usual simplex method, if there is at least one basic variable in the basis at zero level and all the index numbers are non-negative, the current solution is ______________.

  1. basic solution
  2. non basic solution
  3. degenerate
  4. non degenerate
Answer

(C)degenerate

QN34. The model in which only arrivals are counted and no departure takes place are called ______________.

  1. pure birth model
  2. pure death model
  3. birth death model
  4. death birth model
Answer

(A)pure birth model

QN35. ______________ of a queuing system is the state where the probability of the number of customers in the system depends upon time

  1. pure birth model
  2. pure death model
  3. transient state
  4. steady state
Answer

(D)steady state

QN36. The initial event which has all outgoing arrows with no incoming arrow is numbered ______________.

  1. 0
  2. 1
  3. -1
  4. 2
Answer

(A)0

QN37. In a network diagram an event is denoted by the symbol ______________.

  1. arrow
  2. straight line
  3. curve
  4. circle
Answer

(D)circle

QN38. An ______________ represent the start or completion of some activity and as such it consumes no time

  1. activity
  2. event
  3. slack
  4. path
Answer

(B)event

QN39. ______________ is used for non-repetitive jobs

  1. Queue
  2. Replacement
  3. CPM
  4. PERT
Answer

(C)CPM

QN40. The assignment problem will have alternate solutions when the total opportunity cost matrix has ______________

  1. atleast one zero in each row and column
  2. when all rows have two zeros
  3. when there is a tie between zero opportunity cost cells
  4. if two diagonal elements are zeros.
Answer

(C)when there is a tie between zero opportunity cost cells

ed010d383e1f191bdb025d5985cc03fc?s=120&d=mm&r=g

DistPub Team

Distance Publisher (DistPub.com) provide project writing help from year 2007 and provide writing and editing help to hundreds student every year.