Operations Research

41. 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

View answer

42. 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

View answer

43. 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.

View answer

44. 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

View answer

45. Priority queue discipline may be classified as______________.

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

View answer

46. 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

View answer

47. 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

View answer

48. 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

View answer

49. 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

View answer

50. 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%.

View answer