MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 657 Mcqs, each offering curated multiple-choice questions to sharpen your Testing Subject knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
……. is a series of related activities which result in some product or services. |
| A. | Network |
| B. | transportation model |
| C. | assignment |
| D. | none of these |
| Answer» B. transportation model | |
| 2. |
An activity which must be completed before one or more other activities start is known as……….activity. |
| A. | Predecessor |
| B. | Successor |
| C. | Dummy |
| D. | End |
| Answer» B. Successor | |
| 3. |
An event which represents the beginning of more than one activity is known as ………..event. |
| A. | Merge |
| B. | Net |
| C. | Burst |
| D. | None of the above |
| Answer» D. None of the above | |
| 4. |
….……..is that sequence of activities which determines the total project time. |
| A. | Net work |
| B. | Critical path |
| C. | Critical activities |
| D. | None of the above |
| Answer» C. Critical activities | |
| 5. |
Alternative solutions exist of an LP model when |
| A. | One of the constraints is redundant |
| B. | Objective function equation is parallel to one of the constraints |
| C. | Two constraints are parallel |
| D. | All of the above |
| Answer» C. Two constraints are parallel | |
| 6. |
One disadvantage of using North-West Corner rule to find initial solution to the transportationproblem is that |
| A. | It is complicated to use |
| B. | It does not take into account cost of transportation |
| C. | It leads to a degenerate initial solution |
| D. | All of the above |
| Answer» C. It leads to a degenerate initial solution | |
| 7. |
The solution space (region) of an LP problem is unbounded due to |
| A. | An incorrect formulation of the LP model |
| B. | Objective function is unbounded |
| C. | Neither a nor b |
| D. | Both a & b |
| Answer» D. Both a & b | |
| 8. |
While solving a LP model graphically, the area bounded by the constraints is called |
| A. | Feasible region |
| B. | Infeasible region |
| C. | Unbounded solution |
| D. | None of the above |
| Answer» B. Infeasible region | |
| 9. |
During an iteration while moving from one solution to the next, degeneracy may occur when |
| A. | The closed path indicates a diagonal move |
| B. | Two or more occupied cells are on the closed path but neither of them represents a corner of the path. |
| C. | Two or more occupied cells on the closed path with minus sign are tied for lowest circled value |
| D. | Either of the above |
| Answer» D. Either of the above | |
| 10. |
A simulation model used in situations where the state of the system at one point in time does not affect the state of the system at future points in time is called a |
| A. | dynamic simulation model. |
| B. | static simulation model. |
| C. | steady-state simulation model. |
| D. | discrete-event simulation model. |
| Answer» C. steady-state simulation model. | |
| 11. |
While solving a LP problem, infeasibility may be removed by |
| A. | Adding another constraint |
| B. | Adding another variable |
| C. | Removing a constraint |
| D. | Removing a variable |
| Answer» D. Removing a variable | |
| 12. |
To simulate is to try to __________ the features, appearance, and characteristics of a real system. |
| A. | Develop |
| B. | Analyze |
| C. | Multiply |
| D. | Duplicate |
| Answer» E. | |
| 13. |
When events occur at discrete points in time |
| A. | a simulation clock is required. |
| B. | the simulation advances to the next event. |
| C. | the model is a discrete-event simulation. |
| D. | All of the alternatives are correct. |
| Answer» E. | |
| 14. |
The ________ determine(s) the equilibrium of a Markov process. |
| A. | original state probabilities |
| B. | state vector |
| C. | transition matrix |
| D. | fundamental matrix F |
| Answer» D. fundamental matrix F | |
| 15. |
A simulation model uses the mathematical expressions and logical relationships of the |
| A. | real system. |
| B. | computer model. |
| C. | performance measures. |
| D. | estimated inferences. |
| Answer» B. computer model. | |
| 16. |
In order to verify a simulation model |
| A. | compare results from several simulation languages. |
| B. | be sure that the procedures for calculations are logically correct. |
| C. | confirm that the model accurately represents the real system. |
| D. | run the model long enough to overcome initial start-up results. |
| Answer» C. confirm that the model accurately represents the real system. | |
| 17. |
Cumulative probabilities are found by |
| A. | summing all the probabilities associated with a variable. |
| B. | simulating the initial probability distribution. |
| C. | summing all the previous probabilities up to the current value of the variable. |
| D. | any method one chooses. |
| Answer» D. any method one chooses. | |
| 18. |
Simulation should be thought of as a technique for |
| A. | obtaining a relatively inexpensive solution to a problem. |
| B. | increasing one's understanding of a problem. |
| C. | obtaining an optimal solution to a problem. |
| D. | providing quick and dirty |
| Answer» D. providing quick and dirty | |
| 19. |
Numerical values that appear in the mathematical relationships of a model and are considered known and remain constant over all trials of a simulation are |
| A. | parameters. |
| B. | probabilistic input. |
| C. | controllable input. |
| D. | events. |
| Answer» B. probabilistic input. | |
| 20. |
Which of the following are disadvantages of simulation? |
| A. | inability to analyze large and complex real-world situations |
| B. | "time compression" capability |
| C. | could be disruptive by interfering with the real-world system |
| D. | is not usually easily tr |
| Answer» B. "time compression" capability | |
| 21. |
A value for probabilistic input from a discrete probability distribution |
| A. | is the value given by the RAND() function. |
| B. | is given by matching the probabilistic input with an interval of random numbers. |
| C. | is between 0 and 1. |
| D. | must be non-negative. |
| Answer» C. is between 0 and 1. | |
| 22. |
The word "uniform" in the term "uniform random numbers" means |
| A. | all the numbers have the same number of digits. |
| B. | if one number is, say, 10 units above the mean, the next number will be 10 units below the mean. |
| C. | all the numbers are odd or all are even. |
| D. | each number has an equal probability of being drawn. |
| Answer» E. | |
| 23. |
If we are going to simulate an inventory problem, we must |
| A. | Run the simulation for many days. |
| B. | Run the simulation for many days many times, i.e., using multiple sets of random numbers. |
| C. | Run the simulation many times, i.e., using multiple sets of random numbers. |
| D. | Run the simulation once, for a relative short period of time. |
| Answer» C. Run the simulation many times, i.e., using multiple sets of random numbers. | |
| 24. |
The process of determining that the computer procedure that performs the simulation calculations is logically correct is called |
| A. | implementation. |
| B. | validation. |
| C. | verification. |
| D. | repetition. |
| Answer» D. repetition. | |
| 25. |
Common features of simulations--generating values from probability distributions, maintaining records, recording data and summarizing results--led to the development of |
| A. | Excel and Lotus. |
| B. | BASIC, FORTRAN, PASCAL, and C. |
| C. | GPSS, SIMSCRIPT, SLAM, and Arena |
| D. | LINDO and The Management Scientist |
| Answer» D. LINDO and The Management Scientist | |
| 26. |
In assigning random numbers in a Monte Carlo simulation, it is important to ________. |
| A. | develop cumulative probability distributions |
| B. | use random numbers from a random number table |
| C. | use only a single set of random numbers |
| D. | use Excel spreadsheets |
| Answer» B. use random numbers from a random number table | |
| 27. |
A quantity that is difficult to measure with certainty is called a |
| A. | risk analysis. |
| B. | project determinant. |
| C. | probabilistic input. |
| D. | profit/loss process. |
| Answer» D. profit/loss process. | |
| 28. |
Values for the probabilistic inputs to a simulation |
| A. | are selected by the decision maker. |
| B. | are controlled by the decision maker. |
| C. | are randomly generated based on historical information. |
| D. | are calculated by fixed mathematical formulas. |
| Answer» D. are calculated by fixed mathematical formulas. | |
| 29. |
The three types of mathematical simulation models are |
| A. | operational gaming, Monte Carlo, systems simulation |
| B. | Monte Carlo, queuing, maintenance policy. |
| C. | Monte Carlo, systems simulation, computer gaming. |
| D. | system simulation, operational gaming, weather forecasting. |
| Answer» B. Monte Carlo, queuing, maintenance policy. | |
| 30. |
The number of units expected to be sold is uniformly distributed between 300 and 500. If r is a random number between 0 and 1, then the proper expression for sales is |
| A. | 200(r) |
| B. | r + 300 |
| C. | 300 + 500(r) |
| D. | 300 + r(200) |
| Answer» E. | |
| 31. |
A physical model is example of |
| A. | An iconic model |
| B. | An analogue model |
| C. | A verbal model |
| D. | A mathematical model |
| Answer» D. A mathematical model | |
| 32. |
Managerial decisions are based on |
| A. | An evaluation of quantitative data |
| B. | The use of qualitative factors |
| C. | Results generated by formal models |
| D. | All of the above |
| Answer» E. | |
| 33. |
For analyzing a problem, decision-makers should study |
| A. | Its qualitative aspects |
| B. | Its quantitative aspects |
| C. | Both a & b |
| D. | Neither a nor b |
| Answer» D. Neither a nor b | |
| 34. |
The use of decision models |
| A. | Is possible when the variables value is known |
| B. | Reduces the scope of judgement & intuition known with certainty in decision-making |
| C. | Require the use of computer software |
| D. | None of the above |
| Answer» E. | |
| 35. |
. ………..is a method of analyzing the current movement of the same variable in an effort to predict the future movement of the same variable. |
| A. | Goal programming |
| B. | Markov analysis |
| C. | Replacement theory |
| D. | Queuing theory |
| Answer» C. Replacement theory | |
| 36. |
A model that uses a system of symbols to represent a problem is called |
| A. | mathematical. |
| B. | iconic. |
| C. | analog. |
| D. | constrained. |
| Answer» B. iconic. | |
| 37. |
The mathematical model of an LP problem is important because |
| A. | It helps in converting the verbal description & numerical data into mathematical expression |
| B. | Decision-makers prefer to work with formal models |
| C. | It captures the relevant relationship among decision factors |
| D. | It enables the use of algebraic technique |
| Answer» B. Decision-makers prefer to work with formal models | |
| 38. |
Identification and definition of a problem |
| A. | cannot be done until alternatives are proposed. |
| B. | is the first step of decision making. |
| C. | is the final step of problem solving. |
| D. | requires consideration of multiple criteria. |
| Answer» C. is the final step of problem solving. | |
| 39. |
The dual variable represents |
| A. | the marginal value of the constraint |
| B. | the right-hand-side value of the constraint |
| C. | the artificial variable |
| D. | the technical coefficient of the constraint |
| Answer» B. the right-hand-side value of the constraint | |
| 40. |
The number of units shipped from origin i to destination j is represented by |
| A. | xij. |
| B. | xji. |
| C. | cij. |
| D. | cji. |
| Answer» B. xji. | |
| 41. |
The parts of a network that represent the origins are |
| A. | the capacities |
| B. | the flows |
| C. | the nodes |
| D. | the arcs |
| Answer» D. the arcs | |
| 42. |
The assignment problem is a special case of the |
| A. | transportation problem. |
| B. | transshipment problem. |
| C. | maximal flow problem. |
| D. | shortest-route problem. |
| Answer» B. transshipment problem. | |
| 43. |
Arcs in a transshipment problem |
| A. | must connect every node to a transshipment node. |
| B. | represent the cost of shipments. |
| C. | indicate the direction of the flow. |
| D. | All of the alternatives are correct. |
| Answer» D. All of the alternatives are correct. | |
| 44. |
The objective of the transportation problem is to |
| A. | identify one origin that can satisfy total demand at the destinations and at the same time minimize total shipping cost. |
| B. | minimize the number of origins used to satisfy total demand at the destinations. |
| C. | minimize the number of shipments necessary to satisfy total demand at the destinations. |
| D. | minimize the cost of shipping products from several origins to several destinations. |
| Answer» E. | |
| 45. |
The range of feasibility measures |
| A. | the right-hand-side values for which the objective function value will not change. |
| B. | the right-hand-side values for which the values of the decision variables will not change. |
| C. | the right-hand-side values for which the dual prices will not change. |
| D. | each of the above is true. |
| Answer» D. each of the above is true. | |
| 46. |
Which of the following is used to come up with a solution to the assignment problem? |
| A. | MODI method |
| B. | northwest corner method |
| C. | stepping-stone method |
| D. | Hungarian method |
| Answer» E. | |
| 47. |
The values in the c j - z j , or net evaluation, row indicate |
| A. | the value of the objective function. |
| B. | the decrease in value of the objective function that will result if one unit of the variable corresponding to the jth column of the A matrix is brought into the basis. |
| C. | the net change in the value of the objective function that will result if one unit of the variable corresponding to the jth column of the A matrix is brought into the basis. |
| D. | the values of the decision variables. |
| Answer» D. the values of the decision variables. | |
| 48. |
Which method usually gives a very good solution to the assignment problem? |
| A. | northwest corner rule |
| B. | Vogel's approximation method |
| C. | MODI method |
| D. | stepping-stone method |
| Answer» C. MODI method | |
| 49. |
The graph that plots the utility value versus monetary value is called: |
| A. | utility curve. |
| B. | decision tree graph. |
| C. | Laplace curve. |
| D. | benefit curve. |
| Answer» B. decision tree graph. | |
| 50. |
The solution presented in the following table is |
| A. | infeasible |
| B. | degenerate |
| C. | unbounded |
| D. | Optimal |
| Answer» E. | |