1. The solution to a transportation problem with m-sources and n-destinations is feasible if the numbers of allocations are ___________.
Correct : D. m+n-1
2. Solution of a Linear Programming Problem when permitted to be infinitely large is called _________.
Correct : A. unbounded
3. The server utilization factor is also known as ___________
Correct : D. traffic intensity
4. When the total demand is equal to supply then the transportation problem is said to be _________
Correct : A. balanced
5. When the total demand is not equal to supply then it is said to be __________.
Correct : B. unbalanced
6. The allocation cells in the transportation table will be called ____________ cell
Correct : A. occupied
7. In the transportation table, empty cells will be called ___________.
Correct : B. unoccupied
8. In a transportation table, an ordered set of___________or more cells is said to form a loop
Correct : C. 4
9. Closed loops may be ____________ in shape
Correct : A. square
10. To resolve degeneracy at the initial solution, a very small quantity is allocated in ____________ cell
Correct : D. unoccupied
11. For finding an optimum solution in transportation problem ____________ method is used.
Correct : A. Modi
12. _____________ is a completely degenerate form of a transportation problem
Correct : A. Assignment
13. The assignment algorithm was developed by ____________.
Correct : B. HUNGARIAN
14. An Linear Programming Problem have ____________ optimal solution
Correct : C. more than 1
15. All equality constraints can be replaced equivalently by _____________ inequalities
Correct : B. 2
16. Linear Programming Problem is a technique of finding the ____________.
Correct : A. optimal value
17. The linear function to be maximized or minimized is called _____________.
Correct : D. optimal function
18. An assignment problem is a particular case of ____________.
Correct : B. transportation problem
19. An n-tuple of real numbers which satisfies the constraints of Linear Programming Problem is called ___________
Correct : A. solution
20. Any solution to a Linear Programming Problem which also satisfies the non- negative notifications of the problem has _________.
Correct : C. feasible solution
21. If the primal has an unbound objective function value then the other problem has ___________ .
Correct : D. no feasible solution
22. The coefficient of slack\surplus variables in the objective function are always assumed to be ______.
Correct : A. zero
23. The coefficient of an artificial variable in the objective function of penalty method are always assumed to be _____.
Correct : D. -M
24. Chose the correct statement: A degenerate solution is one that_________.
Correct : B. gives zero value to one or more of the basic variables
25. If there is no non-negative replacement ratio in a sllution which is sought to be improved, then the solution is_____.
Correct : B. unbounded
26. 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_____.
Correct : A. degenerate
27. Using ________method, we can never have an unbounded solution
Correct : B. Dual Simplex Method
28. The process that performs the services to the customer is known as ___________.
Correct : B. service channel
29. The customers of high priority are given service over the low priority customers is____________.
Correct : A. pre emptive
30. Given arrival rate = 15/hr, service rate = 20/hr, the value of traffic intensity is ___________.
Correct : B. 3/4
31. The model in which only arrivals are counted and no departure takes place are called _________.
Correct : A. pure birth model
32. A queuing system is said to be a ________ when its operating characteristic are dependent upon time
Correct : C. transient state
33. A queuing system is said to be a __________when its operating characteristic are independent upon time
Correct : D. steady state
34. _________ of a queuing system is the state where the probability of the number of customers in the system depends upon time
Correct : D. steady state
35. An activity is represented by __________.
Correct : C. an arrow
36. An activity which does not consume neither any resource nor time is known as________.
Correct : D. dummy activity
37. The initial event which has all outgoing arrows with no incoming arrow is numbered _____________.
Correct : A. zero
38. Slack is also known as ____________.
Correct : C. float
39. An activity is critical if its ______________float is zero
Correct : A. total
40. The difference between total and free float is __________.
Correct : D. interference
41. What type of distribution does a time follow in program evaluation review technique model?
Correct : C. Normal
42. In a network diagram an event is denoted by the symbol __________.
Correct : A. circle
43. A project consists of a number of tasks which are called _________.
Correct : A. activities
44. The number of time estimates involved in Program Evaluation Review Technique problem is _______.
Correct : C. 3
45. An _________ represent the start or completion of some activity and as such it consumes no time
Correct : A. event
46. A activity in a network diagram is said to be __________ if the delay in its start will further delay the project completion time.
Correct : A. critical
47. _________ is used for non-repetitive jobs
Correct : D. CPM
48. ____________ is employed in construction and business problems
Correct : C. PERT
49. The assignment problem is always a ________matrix.
Correct : A. square
50. The similarity between assignment problem and transportation problem is _______.
Correct : D. both have objective function and non-negativity constraints