Operations Research Online MCQ Set 5

QN01. Operations Research approach is ______________.

  1. multi-disciplinary
  2. scientific
  3. intuitive
  4. collect essential data
Answer

(A)multi-disciplinary

QN02. A feasible solution to a linear programming problem ______________.

  1. must satisfy all the constraints of the problem simultaneously
  2. need not satisfy all of the constraints, only some of them
  3. must be a corner point of the feasible region.
  4. must optimize the value of the objective function
Answer

(A)must satisfy all the constraints of the problem simultaneously

QN03. If any value in XB column of final simplex table is negative, then the solution is ______________.

  1. infeasible
  2. infeasible
  3. bounded
  4. no solution
Answer

(B)infeasible

QN04. For any primal problem and its dual______________.

  1. optimal value of objective function is same
  2. dual will have an optimal solution iff primal does too
  3. primal will have an optimal solution iff dual does too
  4. both primal and dual cannot be infeasible
Answer

(C)primal will have an optimal solution iff dual does too

QN05. The difference between total float and head event slack is ______________

  1. free float
  2. independent float
  3. interference float
  4. linear float
Answer

(A)free float

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

  1. rows or columns
  2. rows and columns.
  3. rows+columns- 1
  4. rows-columns.
Answer

(A)rows or columns

QN07. To proceed with the Modified Distribution method algorithm for solving an transportation problem, the number of dummy allocations need to be added are______________.

  1. n
  2. n-1
  3. 2n-1
  4. n-2
Answer

(B)n-1

QN08. Select the correct statement

  1. EOQ is that quantity at which price paid by the buyer is minimum
  2. If annual demand doubles with all other parameters remaining constant, the Economic Order Quantity is doubled
  3. Total ordering cost equals holding cost
  4. Stock out cost is never permitted
Answer

(C)Total ordering cost equals holding cost

QN09. Service mechanism in a queuing system is characterized by ______________.

  1. customers behavior
  2. servers behavior
  3. customers in the system
  4. server in the system
Answer

(B)servers behavior

QN10. The objective of network analysis is to______________.

  1. minimize total project duration
  2. minimize toal project cost
  3. minimize production delays, interruption and conflicts
  4. maximize total project duration
Answer

(A)minimize total project duration

QN11. In program evaluation review technique network each activity time assume a beta distribution because______________.

  1. it is a unimodal distribution that provides information regarding the uncertainty of time estimates of activities
  2. it has got finite non-negative error
  3. it need not be symmetrical about model value
  4. the project is progressing well
Answer

(A)it is a unimodal distribution that provides information regarding the uncertainty of time estimates of activities

QN12. If there is no non-negative replacement ratio in solving a Linear Programming Problem then the solution is ______________.

  1. feasible
  2. bounded
  3. unbounded
  4. infinite
Answer

(C)unbounded

QN13. The calling population is considered to be infinite when ______________.

  1. all customers arrive at once
  2. capacity of the system is infinite
  3. service rate is faster than arrival rate
  4. arrivals are independent of each other
Answer

(B)capacity of the system is infinite

QN14. In marking assignments, which of the following should be preferred?

  1. Only row having single zero
  2. Only column having single zero
  3. Only row/column having single zero
  4. Column having more than one zero
Answer

(C)Only row/column having single zero

QN15. A petrol pump have one pump; Vehicles arrive at the petrol pump according to poison input process at average of 12 per hour. The service time follows exponential distribution with a mean of 4 minutes. The pumps are expected to be idle for ______________.

  1. 3/5
  2. 4/5
  3. 5/3
  4. 6/5
Answer

(B)4/5

QN16. If the order quantity (size of order) is increased, ______________

  1. holding costs decrease and ordering costs increase
  2. holding costs increase and ordering costs decrease
  3. the total costs increase and then decrease
  4. storage cost as well as stock-out cost increase
Answer

(B)holding costs increase and ordering costs decrease

QN17. ______________ is a mathematical technique used to solve the problem of allocating limited resource among the competing activities

  1. Linear Programming problem
  2. Assignment Problem
  3. Replacement Problem
  4. Non linear Programming Problem
Answer

(A)Linear Programming problem

QN18. A mixed strategy game can be solved by ______________.

  1. Simplex method
  2. Hungarian method
  3. Graphical method
  4. Degeneracy
Answer

(C)Graphical method

QN19. The activity cost corresponding to the crash time is called the ______________.

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

(D)crash cost

QN20. A set of feasible solution to a Linear Programming Problem is ______________

  1. convex
  2. polygon
  3. triangle
  4. bold
Answer

(A)convex

QN21. In an Linear Programming Problem functions to be maximized or minimized are called ______________.

  1. constraints
  2. objective function
  3. basic solution
  4. feasible solution
Answer

(B)objective function

QN22. If the primal problem has n constraints and m variables then the number of constraints in the dual problem is ______________.

  1. mn
  2. m+n
  3. m-n
  4. m/n
Answer

(A)mn

QN23. The non basic variables are called ______________.

  1. shadow cost
  2. opportunity cost
  3. slack variable
  4. surplus variable
Answer

(A)shadow cost

QN24. Key element is also known as ______________.

  1. slack
  2. surplus
  3. artificial
  4. pivot
Answer

(D)pivot

QN25. The solution to a transportation problem with m-sources and n-destinations is feasible if the numbers of allocations are ______________.

  1. m+n
  2. mn
  3. m-n
  4. m+n-1
Answer

(D)m+n-1

QN26. The allocation cells in the transportation table will be called ______________ cell

  1. occupied
  2. unoccupied
  3. no
  4. finite
Answer

(A)occupied

QN27. To resolve degeneracy at the initial solution, a very small quantity is allocated in ______________ cell

  1. occupied
  2. unoccupied
  3. no
  4. finite
Answer

(B)unoccupied

QN28. The assignment algorithm was developed by ______________ method.

  1. HUNGARIAN
  2. VOGELS
  3. MODI
  4. TRAVELING SALES MAN
Answer

(A)HUNGARIAN

QN29. An assignment problem is a particular case of ______________.

  1. transportation Problem
  2. assignment Problem
  3. travelling salesman problem
  4. replacement Problem
Answer

(A)transportation Problem

QN30. The coefficient of slacksurplus variables in the objective function are always assumed to be ______________.

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

(A)0

QN31. Using ______________ method, we can never have an unbounded solution

  1. Simplex
  2. Dual simplex
  3. Big M
  4. Modi
Answer

(B)Dual simplex

QN32. The customers of high priority are given service over the low priority customers is ______________.

  1. Pre emptive
  2. FIFO
  3. LIFO
  4. SIRO
Answer

(A)Pre emptive

QN33. A queuing system is said to be a ______________ when its operating characteristic are independent upon time

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

(D)steady state

QN34. An activity which does not consume neither any resource nor time is known as ______________.

  1. predecessor activity
  2. successor activity
  3. dummy activity
  4. activity
Answer

(C)dummy activity

QN35. The difference between total and free float is ______________.

  1. total
  2. free
  3. independent
  4. interference
Answer

(D)interference

QN36. The number of time estimates involved in Program Evaluation Review Technique problem is ______________.

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

(C)3

QN37. The assignment problem is always a ______________matrix.

  1. circle
  2. square
  3. rectangle
  4. triangle
Answer

(B)square

QN38. The slack variables indicate ______________.

  1. excess resource available.
  2. shortage of resource
  3. nil resource
  4. idle resource
Answer

(D)idle resource

QN39. If the net evaluation corresponding to any non -basic variable is zero, it is an indication of the existence of an ______________.

  1. initial basic feasible solution
  2. optimum basic feasible solution
  3. optimum solution.
  4. alternate optimum solution.
Answer

(D)alternate optimum solution.

QN40. Mathematical model of linear programming problem is important because ______________.

  1. it helps in converting the verbal description and numerical data into mathematical expression
  2. decision makers prefer to work with formal models
  3. it captures the relevant relationship among decision factors
  4. it enables the use of algebraic technique
Answer

(A)it helps in converting the verbal description and numerical data into mathematical expression

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.