### Operations Research

11. 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
it is a unimodal distribution that provides information regarding the uncertainty of time estimates of activities

12. 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
unbounded

13. 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
capacity of the system is infinite

14. 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
Only row/column having single zero

15. 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
4/5

16. 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
holding costs increase and ordering costs decrease

17. ______________ 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
Linear Programming problem

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

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

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

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