1. The application of OR techniques involves ………… approach
Correct : B. Team
2. Opportunity loss refers to
Correct : C. the difference between the actual payoff and the optimal payoff.
3. All of the following are steps in the decision-making process EXCEPT:
Correct : B. Compute the posterior probabilities
4. Which of the following is (are) types of decision-making environments?
Correct : D. All of the above
5. A good decision always implies that we
Correct : C. have followed a logical process.
6. Which of the following might be viewed as an "optimistic" decision criterion?
Correct : C. Maximax
7. Decision alternatives
Correct : A. should be identified before decision criteria are established.
8. The equally likely decision criterion is also known as
Correct : B. Laplace.
9. Which of the following is a property of all linear programming problems?
Correct : A. alternate courses of action to choose from
10. A point that satisfies all of a problem's constraints simultaneously is a(n)
Correct : D. None of the above
11. The first step in formulating an LP problem is
Correct : B. Understand the managerial problem being faced.
12. LP theory states that the optimal solution to any problem will lie at
Correct : B. a corner point of the feasible region.
13. Consider the following linear programming problem:
Maximize 12X + 10Y
Subject to:
4X + 3Y ch7 <= 480
2X + 3Y ch7 <= 360
all variables >= 0
Which of the following points (X,Y) could be a feasible corner point?
Correct : B. (120,0)
14. Management science and operations research both involve
Correct : B. quantitative approaches to decision making.
15. Which of the following does not represent a factor a manager might consider when employing linear programming for a production scheduling?
Correct : D. none of the above
16. The quantitative analysis approach requires
Correct : C. mathematical expressions for the relationships.
17. In labor planning formulation, how would you write the constraint that there are only 10 fulltime tellers (labeled as T) available?
Correct : C. T ≤10
18. A type of linear programming problem that is used in marketing is called the
Correct : A. media selection problem.
19. The maximization or minimization of a quantity is the
Correct : D. objective of linear programming.
20. Decision variables
Correct : A. tell how much or how many of something to produce, invest, purchase, hire, etc.
21. Which of the following is a valid objective function for a linear programming problem?
Correct : B. Min 4x + 3y + (2/3)z
22. Which of the following statements is NOT true?
Correct : C. An infeasible solution violates all constraints.
23. A solution that satisfies all the constraints of a linear programming problem except the nonnegativity constraints is called
Correct : C. infeasible.
24. In converting a less-than-or-equal constraint for use in a simplex table, we must add
Correct : B. a slack variable.
25. Slack
Correct : B. Is the amount by which the left side of a ≤ constraint is smaller than the right side.
26. Unboundedness is usually a sign that the LP problem
Correct : D. has been formulated improperly.
27. To find the optimal solution to a linear programming problem using the graphical method
Correct : D. None of the alternatives is correct.
28. Which of the following special cases does not require reformulation of the problem in order
to obtain a solution?
Correct : A. alternate optimality
29. Whenever all the constraints in a linear program are expressed as equalities, the linear program is said to be written in
Correct : A. standard form.
30. In applying Vogel's approximation method to a profit maximization problem, row and column penalties are determined by:
Correct : D. finding the difference between the two highest unit costs in each row and column.
31. The northwest corner rule requires that we start allocating units to shipping routes in the:
Correct : D. Upper left-hand corner of the table.
32. In a transportation problem, when the number of occupied routes is less than the number of rows plus the number of columns -1, we say that the solution is:
Correct : C. Infeasible.
33. The only restriction can be placed on the initial solution of a transportation problem is that:
Correct : B. all constraints must be satisfied.
34. The table represents a solution that is:
Correct : C. degenerate.
35. Which of the following is used to come up with a solution to the assignment problem?
Correct : D. Hungarian method
36. The graph that plots the utility value versus monetary value is called:
Correct : A. utility curve.
37. What is wrong with the following table?
Correct : A. The solution is infeasible.
38. The solution presented in the following table is
Correct : D. Optimal
39. The solution shown was obtained by Vogel's approximation. The difference between the objective function for this solution and that for the optimal is
Correct : C. 80
40. Which method usually gives a very good solution to the assignment problem?
Correct : B. Vogel's approximation method
41. Infeasibility means that the number of solutions to the linear programming models that satisfies all constraints is
Correct : B. 0.
42. The stepping-stone method requires that one or more artificially occupied cells with a flow of zero be created in the transportation tableau when the number of occupied cells is fewer than
Correct : B. m + n − 1
43. The per-unit change in the objective function associated with assigning flow to an unused arc in the transportation simplex method is called the
Correct : A. net evaluation index.
44. The difference between the transportation and assignment problems is that
Correct : A. total supply must equal total demand in the transportation problem
45. An example of a heuristic is the
Correct : A. minimum-cost method.
46. A solution to a transportation problem that has less than m + n − 1 cells with positive allocations in the transportation table is
Correct : D. a degenerate solution.
47. Using the transportation simplex method, the optimal solution to the transportation problem has been found when
Correct : D. the net evaluation index for each unoccupied cell is ≥ 0.
48. Identifying the outgoing arc in Phase II of the transportation simplex method is performed using the
Correct : C. stepping-stone method.
49. To use the transportation simplex method, a transportation problem that is unbalanced requires the use of
Correct : C. a dummy origin or destination.
50. The problem which deals with the distribution of goods from several sources to several destinations is the
Correct : B. transportation problem
51. The parts of a network that represent the origins are
Correct : C. the nodes
52. The optimal solution is found in an assignment matrix when the minimum number of straight
lines needed to cover all the zeros equals
Correct : B. (the number of agents).
53. The objective of the transportation problem is to
Correct : D. minimize the cost of shipping products from several origins to several destinations.
54. The MODI method is used to
Correct : B. identify an incoming arc.
55. Which of the following is not true regarding the linear programming formulation of a transportation problem?
Correct : C. The number of constraints is (number of origins) × (number of destinations).
56. In the general linear programming model of the assignment problem,
Correct : D. one agent is assigned to one and only one task.
57. Which of the following is not true regarding an LP model of the assignment problem? ]
Correct : B. All constraints are of the ≥ form.
58. The assignment problem constraint x31 + x32 + x33 + x34 ≤ 2 means
Correct : A. agent 3 can be assigned to 2 tasks.
59. The assignment problem is a special case of the
Correct : A. transportation problem.
60. The field of management science
Correct : D. each of the above is true.
61. Identification and definition of a problem
Correct : B. is the first step of decision making.
62. The quantitative analysis approach requires
Correct : C. mathematical expressions for the relationships.
63. Arcs in a transshipment problem
Correct : C. indicate the direction of the flow.
64. A physical model that does not have the same physical appearance as the object being modeled is
Correct : A. an analog model.
65. George Dantzig is important in the history of management science because he developed
Correct : C. the simplex method for linear programming.
66. A model that uses a system of symbols to represent a problem is called
Correct : A. mathematical.
67. The number of units shipped from origin i to destination j is represented by
Correct : A. xij.
68. The range of feasibility measures
Correct : C. the right-hand-side values for which the dual prices will not change.
69. The amount that the objective function coefficient of a decision variable would have to improve before that variable would have a positive value in the solution is the
Correct : C. reduced cost.
70. The values in the c j - z j , or net evaluation, row indicate
Correct : 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.
71. In the simplex method, a tableau is optimal only if all the cj – zj values are
Correct : A. zero or negative.
72. For the basic feasible solution to remain optimal
Correct : A. all cj - zj values must remain ≤ 0.
73. The dual variable represents
Correct : A. the marginal value of the constraint
74. The parts of a network that represent the origins are
Correct : C. the nodes
75. Slack
Correct : B. is the amount by which the left side of a < constraint is smaller than the right side.
76. The critical path
Correct : D. is the longest path.
77. Operations research analysts do not
Correct : A. Predict future operations
78. Decision variables are
Correct : A. Controllable
79. A model is
Correct : D. All of the above
80. A physical model is an example of
Correct : A. An iconic model
81. Every mathematical model
Correct : C. Represents data in numerical form
82. Operations research approach is
Correct : A. Multi disciplinary
83. In an assignment problem,
Correct : D. None of the alternatives is correct.
84. An optimization model
Correct : D. All of the above
85. Operations research is applied
Correct : D. All of the above
86. Operations Research techniques helps to find ………..solution
Correct : C. Optimal
87. OR provides solution only if the elements are
Correct : A. Quantified
88. ………. Theory is an important operations research technique to analyze the queuing
behaviour.
Correct : A. Waiting line
89. ………… model involves all forms of diagrams
Correct : A. iconic
90. . …. Is known as symbolic model
Correct : B. Mathematical
91. A map indicates roads, highways, towns and the interrelationship is an ……model
Correct : C. analogue
92. Constraints in an LP model represent
Correct : D. all of the above
93. Linear programming is a
Correct : D. all of the above
94. A constraint in an LP model restricts
Correct : D. all of the above
95. ……….. is an important Operations research technique to be used for determining optimal allocation of limited resources to meet the given objectives.
Correct : D. Linear programming
96. The best use of linear programming technique is to find an optimal use of
Correct : D. all of the above
97. Given the following table that presents the solution for a queuing problem with a constant service rate, on the average, how many customers are in the system?
Correct : C. 1.607
98. Given the following table that presents the solution for a queuing problem with a constant service rate, on the average, how many minutes does a customer spend in the service facility?
Correct : B. 0.321 minutes
99. Given the following table that presents the solution for a queuing problem with a constant service rate, what percentage of available service time is actually used?
Correct : D. none of the above
100. Which of the following is usually the most difficult cost to determine?