McqMate
| 101. |
The solution to a transportation problem with m-sources and n-destinations is feasible if the numbers of allocations are ___________. |
| A. | m+n |
| B. | mn |
| C. | m-n |
| D. | m+n-1 |
| Answer» D. m+n-1 | |
| 102. |
Solution of a Linear Programming Problem when permitted to be infinitely large is called _________. |
| A. | unbounded |
| B. | bounded |
| C. | optimum solution |
| D. | no solution |
| Answer» A. unbounded | |
| 103. |
The server utilization factor is also known as ___________ |
| A. | erlang distribution |
| B. | poisson distribution |
| C. | exponential distribution |
| D. | traffic intensity |
| Answer» D. traffic intensity | |
| 104. |
When the total demand is equal to supply then the transportation problem is said to be _________ |
| A. | balanced |
| B. | unbalanced |
| C. | maximization |
| D. | minimization |
| Answer» A. balanced | |
| 105. |
When the total demand is not equal to supply then it is said to be __________. |
| A. | balanced |
| B. | unbalanced |
| C. | maximization |
| D. | minimization |
| Answer» B. unbalanced | |
| 106. |
The allocation cells in the transportation table will be called ____________ cell |
| A. | occupied |
| B. | unoccupied |
| C. | no |
| D. | finite |
| Answer» A. occupied | |
| 107. |
In the transportation table, empty cells will be called ___________. |
| A. | occupied |
| B. | unoccupied |
| C. | basic |
| D. | non-basic |
| Answer» B. unoccupied | |
| 108. |
In a transportation table, an ordered set of___________or more cells is said to form a loop |
| A. | 2 |
| B. | 3 |
| C. | 4 |
| D. | 5 |
| Answer» C. 4 | |
| 109. |
Closed loops may be ____________ in shape |
| A. | square |
| B. | rectangle |
| C. | triangle |
| D. | diagonal |
| Answer» A. square | |
| 110. |
To resolve degeneracy at the initial solution, a very small quantity is allocated in ____________ cell |
| A. | occupied |
| B. | basic |
| C. | non-basic |
| D. | unoccupied |
| Answer» D. unoccupied | |
| 111. |
For finding an optimum solution in transportation problem ____________ method is used. |
| A. | Modi |
| B. | Hungarian |
| C. | Graphical |
| D. | simplex |
| Answer» A. Modi | |
| 112. |
_____________ is a completely degenerate form of a transportation problem |
| A. | Assignment |
| B. | Least Cost Method |
| C. | North West Corner |
| D. | Vogel's Approximation |
| Answer» A. Assignment | |
| 113. |
The assignment algorithm was developed by ____________. |
| A. | MODI |
| B. | HUNGARIAN |
| C. | HUHN |
| D. | VOGELS |
| Answer» B. HUNGARIAN | |
| 114. |
An Linear Programming Problem have ____________ optimal solution |
| A. | 1 |
| B. | 2 |
| C. | more than 1 |
| D. | more than 2 |
| Answer» C. more than 1 | |
| 115. |
All equality constraints can be replaced equivalently by _____________ inequalities |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» B. 2 | |
| 116. |
Linear Programming Problem is a technique of finding the ____________. |
| A. | optimal value |
| B. | approximate value |
| C. | initial value |
| D. | infeasible value |
| Answer» A. optimal value | |
| 117. |
The linear function to be maximized or minimized is called _____________. |
| A. | injective function |
| B. | surjective function |
| C. | bijective function |
| D. | optimal function |
| Answer» D. optimal function | |
| 118. |
An assignment problem is a particular case of ____________. |
| A. | linear programming problem |
| B. | transportation problem |
| C. | replacement problem |
| D. | network problme |
| Answer» B. transportation problem | |
| 119. |
An n-tuple of real numbers which satisfies the constraints of Linear Programming Problem is called ___________ |
| A. | solution |
| B. | basic solution |
| C. | feasible solution |
| D. | basic feasible solution |
| Answer» A. solution | |
| 120. |
Any solution to a Linear Programming Problem which also satisfies the non- negative notifications of the problem has _________. |
| A. | solution |
| B. | basic solution |
| C. | feasible solution |
| D. | basic feasible solution |
| Answer» C. feasible solution | |
| 121. |
If the primal has an unbound objective function value then the other problem has ___________ . |
| A. | solution |
| B. | basic solution |
| C. | feasible solution |
| D. | no feasible solution |
| Answer» D. no feasible solution | |
| 122. |
The coefficient of slack\surplus variables in the objective function are always assumed to be ______. |
| A. | zero |
| B. | 1 |
| C. | M |
| D. | -M |
| Answer» A. zero | |
| 123. |
The coefficient of an artificial variable in the objective function of penalty method are always assumed to be _____. |
| A. | zero |
| B. | 1 |
| C. | -1 |
| D. | -M |
| Answer» D. -M | |
| 124. |
Chose the correct statement: A degenerate solution is one that_________. |
| A. | gives an optimum solution to the Linear Programming Problem |
| B. | gives zero value to one or more of the basic variables |
| C. | yields more than one way to achieve the objective |
| D. | makes use of all available resources |
| Answer» B. gives zero value to one or more of the basic variables | |
| 125. |
If there is no non-negative replacement ratio in a sllution which is sought to be improved, then the solution is_____. |
| A. | bounded |
| B. | unbounded |
| C. | basic solution |
| D. | non-basic solution |
| Answer» B. unbounded | |
| 126. |
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_____. |
| A. | degenerate |
| B. | non-degenerate |
| C. | basic solution |
| D. | non-basic solution |
| Answer» A. degenerate | |
| 127. |
Using ________method, we can never have an unbounded solution |
| A. | Simplex Method |
| B. | Dual Simplex Method |
| C. | Big-M Method |
| D. | Search Approach Method |
| Answer» B. Dual Simplex Method | |
| 128. |
The process that performs the services to the customer is known as ___________. |
| A. | queue |
| B. | service channel |
| C. | customers |
| D. | server |
| Answer» B. service channel | |
| 129. |
The customers of high priority are given service over the low priority customers is____________. |
| A. | pre emptive |
| B. | non pre emptive |
| C. | FIFO |
| D. | LIFO |
| Answer» A. pre emptive | |
| 130. |
Given arrival rate = 15/hr, service rate = 20/hr, the value of traffic intensity is ___________. |
| A. | 4/3 |
| B. | 3/4 |
| C. | 3/2 |
| D. | 5 |
| Answer» B. 3/4 | |
| 131. |
The model in which only arrivals are counted and no departure takes place are called _________. |
| A. | pure birth model |
| B. | pure death model |
| C. | birth-death model |
| D. | death-birth model |
| Answer» A. pure birth model | |
| 132. |
A queuing system is said to be a ________ when its operating characteristic are dependent upon time |
| A. | death model |
| B. | birth model |
| C. | transient state |
| D. | steady state |
| Answer» C. transient state | |
| 133. |
A queuing system is said to be a __________when its operating characteristic are independent upon time |
| A. | death model |
| B. | birth model |
| C. | transient state |
| D. | steady state |
| Answer» D. steady state | |
| 134. |
_________ of a queuing system is the state where the probability of the number of customers in the system depends upon time |
| A. | death model |
| B. | birth model |
| C. | transient state |
| D. | steady state |
| Answer» D. steady state | |
| 135. |
An activity is represented by __________. |
| A. | a straight line |
| B. | a curve |
| C. | an arrow |
| D. | a circle |
| Answer» C. an arrow | |
| 136. |
An activity which does not consume neither any resource nor time is known as________. |
| A. | activity |
| B. | predecessor activity |
| C. | successor activity |
| D. | dummy activity |
| Answer» D. dummy activity | |
| 137. |
The initial event which has all outgoing arrows with no incoming arrow is numbered _____________. |
| A. | zero |
| B. | 1 |
| C. | 2 |
| D. | -2 |
| Answer» A. zero | |
| 138. |
Slack is also known as ____________. |
| A. | activity |
| B. | event |
| C. | float |
| D. | time |
| Answer» C. float | |
| 139. |
An activity is critical if its ______________float is zero |
| A. | total |
| B. | free |
| C. | independent |
| D. | interference |
| Answer» A. total | |
| 140. |
The difference between total and free float is __________. |
| A. | total |
| B. | free |
| C. | independent |
| D. | interference |
| Answer» D. interference | |
| 141. |
What type of distribution does a time follow in program evaluation review technique model? |
| A. | Poisson |
| B. | Exponential |
| C. | Normal |
| D. | Unimodel |
| Answer» C. Normal | |
| 142. |
In a network diagram an event is denoted by the symbol __________. |
| A. | circle |
| B. | arrow |
| C. | dotted arrow |
| D. | double circle |
| Answer» A. circle | |
| 143. |
A project consists of a number of tasks which are called _________. |
| A. | activities |
| B. | events |
| C. | dummy activity |
| D. | successor |
| Answer» A. activities | |
| 144. |
The number of time estimates involved in Program Evaluation Review Technique problem is _______. |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 145. |
An _________ represent the start or completion of some activity and as such it consumes no time |
| A. | event |
| B. | activity |
| C. | floats |
| D. | time |
| Answer» A. event | |
| 146. |
A activity in a network diagram is said to be __________ if the delay in its start will further delay the project completion time. |
| A. | critical |
| B. | non critical |
| C. | PERT |
| D. | crash |
| Answer» A. critical | |
| 147. |
_________ is used for non-repetitive jobs |
| A. | network |
| B. | critical |
| C. | PERT |
| D. | CPM |
| Answer» D. CPM | |
| 148. |
____________ is employed in construction and business problems |
| A. | network |
| B. | critical |
| C. | PERT |
| D. | CPM |
| Answer» C. PERT | |
| 149. |
The assignment problem is always a ________matrix. |
| A. | square |
| B. | sub |
| C. | unit |
| D. | null |
| Answer» A. square | |
| 150. |
The similarity between assignment problem and transportation problem is _______. |
| A. | both are rectangular matrices |
| B. | both are square matrices |
| C. | both can be solved y graphical method |
| D. | both have objective function and non-negativity constraints |
| Answer» D. both have objective function and non-negativity constraints | |
Done Reading?