Operations Research Mid - I, September - 2014

1.In simplex table the value of Zj - Cj for basic variable will be
  • negative
  • positive
  • zero
  • unity
Answer: C
2.In simplex table key column is determined by
  • most negative value of Cj - Zj
  • most negative value of Zj - Cj
  • both
  • none
Answer: B
3.The dummy source or destination in a TP is added to
  • to satisfy Rim condition
  • prevent solution from becoming degenerate
  • ensue total cost does not exceed limit
  • none of the above
Answer: A
4.One disadvantage of using NWCM to find IBFS to transportation problem is that
  • it is complicated to use
  • transportation cost is not considered
  • it leads to a degenerate initial solution
  • all the above
Answer: B
5.The solution to a TP with m rows and n columns is feasible if no. of positive allocations are
  • m + n
  • m x n
  • m + n - 1
  • m + n + 1
Answer: C
6.For a sales man who has to visit n cities which of the following ways are his tour plan
  • n!
  • (n + 1)!
  • (n - 1)!
  • n
Answer: C
7.The Hungarian method for solving an assignment problem can also be used to solve
  • a transportation problem
  • a travelling sales man problem
  • both A and B
  • none
Answer: B
8.An assignment problem can be solved by
  • simplex method
  • transportation method
  • both
  • none
Answer: C
9.Processing of 2 jobs through m machines can be done
  • Johnson's rule
  • Jackson's rule
  • graphical method
  • none
Answer: C
10.According to Johnson's rule, the job with shortest processing time in first machining center is to be placed in sequence
  • first
  • last
  • middle
  • none
Answer: A
11.Entries in Cj - Zj are known as ____________________ costs.
Answer: reduced
12.The basic variable will have Cj - Zj = ____________________
Answer: zero
13.A transportation problem is said to be balanced if ____________________
Answer: demand = supply
14.The cost of dummy cells in TP is taken as ____________________
Answer: zero
15.The criterion used in LCM is cell units ____________________ of TP matrix.
Answer: lowest cost
16.We can convert the maximisation AP to minimisation AP by multiplying every cell with ____________________
Answer: -1
17.If an assignment problem is a square then it is called ____________________
Answer: balanced assignment problem
18.In an assignment problem the number of allocations in each row and column are ____________________
Answer: equal
19.In processing 2 jobs through m machines, vertical line indicates __________________ is idle.
Answer: job 1
20.____________________ suggested a sequencing rule.
Answer: S.M. Johnson