Operations Research

71. 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
Correct answer: (A)
solution

72. 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
Correct answer: (B)
gives zero value to one or more of the basic variables

73. 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
Correct answer: (C)
degenerate

74. 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
Correct answer: (A)
pure birth model

75. ______________ 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
Correct answer: (D)
steady state

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

  1. 0
  2. 1
  3. -1
  4. 2
Correct answer: (A)
0

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

  1. arrow
  2. straight line
  3. curve
  4. circle
Correct answer: (D)
circle

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

  1. activity
  2. event
  3. slack
  4. path
Correct answer: (B)
event

79. ______________ is used for non-repetitive jobs

  1. Queue
  2. Replacement
  3. CPM
  4. PERT
Correct answer: (C)
CPM

80. 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.
Correct answer: (C)
when there is a tie between zero opportunity cost cells
Previous
Page 8 of 22
Next