McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Bachelor of Business Administration (BBA) , Master of Commerce (M.com) .
| 151. |
......................... deals with making sound decisions under conditions of certainty, risk and uncertainty. |
| A. | Game theory |
| B. | Network analysis |
| C. | Decision theory |
| D. | None of these |
| Answer» C. Decision theory | |
| 152. |
....................... deals with the concepts such as critical path, float, events, etc. |
| A. | Game theory |
| B. | Decision theory |
| C. | Queuing theory |
| D. | Network analysis |
| Answer» D. Network analysis | |
| 153. |
............................... is used to imitate an operation prior to actual performance. |
| A. | Inventory control |
| B. | Simulation |
| C. | Game theory |
| D. | Integrated Production Model |
| Answer» B. Simulation | |
| 154. |
............................... is concerned with determination of the most economic replacement policy. |
| A. | Probabilistic programming |
| B. | Linear programming |
| C. | Search theory |
| D. | Replacement theory |
| Answer» D. Replacement theory | |
| 155. |
The O R technique which helps in minimising total waiting and service cost is: |
| A. | Game theory |
| B. | Queuing theory |
| C. | Both a and b |
| D. | Decision theory |
| Answer» B. Queuing theory | |
| 156. |
Linear Programming technique is a: |
| A. | Constrained optimisation technique |
| B. | Technique for economic allocation of resources |
| C. | Mathematical technique |
| D. | All of the above |
| Answer» D. All of the above | |
| 157. |
A constraint in a Linear Programming Model restricts: |
| A. | Value of objective function |
| B. | Value of decision variable |
| C. | Use of available resources |
| D. | All of the above |
| Answer» D. All of the above | |
| 158. |
Before formulating a formal L P model, it is better to: |
| A. | Verbally identify decision variables |
| B. | Express the objective function in words |
| C. | Express each constraint in words |
| D. | All of the above |
| Answer» D. All of the above | |
| 159. |
Linear Programming Technique helps to find an optimal use of: |
| A. | Machine |
| B. | Money |
| C. | Manpower |
| D. | All of the above |
| Answer» D. All of the above | |
| 160. |
Which of the followings is an assumption of Linear Programming Technique? |
| A. | Divisibility |
| B. | Additivity |
| C. | Proportionality |
| D. | All of the above |
| Answer» D. All of the above | |
| 161. |
Which of the following is true with regard to a Linear Programming Model? |
| A. | No guarantee to get integer valued solution |
| B. | The relationship among decision variables is liner |
| C. | Both a and b |
| D. | None of the these |
| Answer» D. None of the these | |
| 162. |
The graphical method if LPP uses: |
| A. | Linear equations |
| B. | Constraint equations |
| C. | Objective function |
| D. | All of the above |
| Answer» D. All of the above | |
| 163. |
Constraints in an LPP are treated as active, if they: |
| A. | Do not consume all the available resources at optimality |
| B. | Represent optimal solution |
| C. | Both a and b |
| D. | None of these |
| Answer» B. Represent optimal solution | |
| 164. |
While solving a LPP graphically, the area bounded by constraints is called ................. |
| A. | Feasible region |
| B. | Infeasible region |
| C. | Unbounded region |
| D. | None of these |
| Answer» A. Feasible region | |
| 165. |
While solving an LPP, infeasibility may be removed by: |
| A. | Removing a variable |
| B. | Removing a constraint |
| C. | Adding a variable |
| D. | Adding a constraint |
| Answer» B. Removing a constraint | |
| 166. |
........................variables are fictitious and cannot have any physical meaning. |
| A. | Slack variables |
| B. | Surplus variables |
| C. | Artificial variables |
| D. | Decision variables |
| Answer» C. Artificial variables | |
| 167. |
An optimal solution is considered as the ................... among the feasible solutions. |
| A. | Worst |
| B. | Best |
| C. | Ineffective |
| D. | None of these |
| Answer» B. Best | |
| 168. |
........................... method is used to solve an assignment problem. |
| A. | American method |
| B. | Hungarian method |
| C. | German method |
| D. | British method |
| Answer» B. Hungarian method | |
| 169. |
The allocated cells in the transportation table are called .............................. |
| A. | Occupied cells |
| B. | Empty cells |
| C. | Unoccupied cells |
| D. | None of these |
| Answer» A. Occupied cells | |
| 170. |
In transportation Problems, VAM stands for ......................... |
| A. | Value Addition Method |
| B. | Vogel’s Approximation Method |
| C. | Virgenean Approximation Method |
| D. | None of these |
| Answer» B. Vogel’s Approximation Method | |
| 171. |
Initial feasible solution to a transportation Problem can be found out by ......................... |
| A. | VAM |
| B. | MODI Method |
| C. | Both a and b |
| D. | None of these |
| Answer» A. VAM | |
| 172. |
........................ is applied to determine optimal solution. |
| A. | NWCR |
| B. | VAM |
| C. | MODI Method |
| D. | None of these |
| Answer» C. MODI Method | |
| 173. |
A Transportation Problem is said to be unbalanced when total supply is not equal to ............ |
| A. | Total cost |
| B. | Total demand |
| C. | Both a and b |
| D. | None of these |
| Answer» B. Total demand | |
| 174. |
For a minimisation Transportation Problem, the objective is to minimise: |
| A. | Profit |
| B. | Cost |
| C. | Solution |
| D. | None of these |
| Answer» B. Cost | |
| 175. |
....................... is an important Operations Research Technique to analyse the queuing behaviour. |
| A. | Game theory |
| B. | Waiting line theory |
| C. | Decision theory |
| D. | Simulation |
| Answer» B. Waiting line theory | |
| 176. |
An organisation chart is an example of ........................... |
| A. | Iconic model |
| B. | Mathematical model |
| C. | Analogue model |
| D. | None of these |
| Answer» C. Analogue model | |
| 177. |
........................ model is a map which indicates roads, highways, towns and inter-relationships |
| A. | Iconic model |
| B. | Analogue model |
| C. | Mathematical model |
| D. | None of these |
| Answer» B. Analogue model | |
| 178. |
Operations Research techniques help to find ................... solution. |
| A. | Feasible solution |
| B. | Infeasible solution |
| C. | Optimal solution |
| D. | None of these |
| Answer» C. Optimal solution | |
| 179. |
Operations Research Techniques involves ..................... approach. |
| A. | Team approach |
| B. | Critical approach |
| C. | Individual approach |
| D. | None of these |
| Answer» C. Individual approach | |
| 180. |
A LPP model doesnot contain: |
| A. | Decision |
| B. | Constraints |
| C. | Feasible solution |
| D. | Spread Sheet |
| Answer» D. Spread Sheet | |
| 181. |
Straight lines shown in a linear programming graph indicates ........................... |
| A. | Objective function |
| B. | Constraints |
| C. | Points |
| D. | All of the above |
| Answer» B. Constraints | |
| 182. |
Non-negativity constraints are written as ...................... |
| A. | Equality |
| B. | Non-equality |
| C. | Greater than or equal to |
| D. | Less than or equal to |
| Answer» C. Greater than or equal to | |
| 183. |
PERT stand for: |
| A. | Performance Evaluation Review Technique |
| B. | Programme Evaluation Review Technique |
| C. | Programme Evaluation Research Technique |
| D. | None of these |
| Answer» B. Programme Evaluation Review Technique | |
| 184. |
An activity which must be completed before commencement of one or more other activities is called................................. |
| A. | Successor activity |
| B. | Predecessor activity |
| C. | Dummy activity |
| D. | None of these |
| Answer» B. Predecessor activity | |
| 185. |
In network diagram, events are commonly represented by ......................... |
| A. | Arrows |
| B. | Nodes |
| C. | Triangles |
| D. | None of these |
| Answer» B. Nodes | |
| 186. |
......................... is activity oriented network diagram. |
| A. | CPM |
| B. | PERT |
| C. | Histogram |
| D. | Ogive |
| Answer» A. CPM | |
| 187. |
................... is an event oriented network diagram. |
| A. | CPM |
| B. | PERT |
| C. | Histogram |
| D. | Ogive |
| Answer» B. PERT | |
| 188. |
An activity which does not consume either resource or time is called ............................. |
| A. | Predecessor activity |
| B. | Successor activity |
| C. | Dummy activity |
| D. | Terminal activity |
| Answer» C. Dummy activity | |
| 189. |
......................... is a series of activities related to a project. |
| A. | Network |
| B. | Transportation Model |
| C. | Assignment model |
| D. | None of these |
| Answer» A. Network | |
| 190. |
An event which represents the beginning of more than one activity is a : |
| A. | Merge event |
| B. | Net event |
| C. | Burst event |
| D. | None of these |
| Answer» C. Burst event | |
| 191. |
Activities lying on critical path are called ............................ |
| A. | Critical activities |
| B. | Non-critical activities |
| C. | Dummy activities |
| D. | None of these |
| Answer» A. Critical activities | |
| 192. |
Activities that cannot be started until one or more of the other activities are completed, are called.......................................... |
| A. | Dummy activities |
| B. | Initial activities |
| C. | Successor activities |
| D. | Predecessor activities |
| Answer» C. Successor activities | |
| 193. |
............................ is the sequence of activities which determines the total project duration. |
| A. | Critical path |
| B. | Network |
| C. | Non-critical activities |
| D. | None of these |
| Answer» A. Critical path | |
| 194. |
PERT emphasises on ........................... |
| A. | Activity |
| B. | Time |
| C. | Cost |
| D. | None of these |
| Answer» B. Time | |
| 195. |
..................... is the duration by which an activity can be delayed without delaying the completion of the project. |
| A. | Earliest Start Time |
| B. | Earliest Finish Time |
| C. | Latest Start Time |
| D. | Latest Finish Time |
| Answer» C. Latest Start Time | |
| 196. |
The EST + activity duration = .............................. |
| A. | Earliest Finish Time |
| B. | Latest Start Time |
| C. | Latest Finish Time |
| D. | None of these |
| Answer» A. Earliest Finish Time | |
| 197. |
............................ is the latest time by which an activity can be finished without delaying the completion of the project. |
| A. | LST |
| B. | LFT |
| C. | EFT |
| D. | EST |
| Answer» B. LFT | |
| 198. |
......................... is a scheme or design of something intended to do. |
| A. | Network |
| B. | Float |
| C. | Project |
| D. | Program |
| Answer» A. Network | |
| 199. |
In a network diagram, activity is denoted by ............................ |
| A. | Node |
| B. | Arrow |
| C. | Triangle |
| D. | None of these |
| Answer» B. Arrow | |
| 200. |
.......................... is the duration by which an activity can be delayed without delaying the project. |
| A. | Slack |
| B. | Total float |
| C. | Both a and b |
| D. | None of these |
| Answer» B. Total float | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.