41. All negative constraints must be 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
42. In linear programming problem if all constraints are less than or equal to, then thefeasible region is
A. above lines
B. below the lines
C. unbounded
D. none of the above
Answer
B. below the lines
43. ___ 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
A. network
44. 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
C. burst
45. If two constraints do not intersect in the positive quadrant of the graph, then
A. the problem is infeasible
B. the solution is unbounded
C. one of the constraints is redundant
D. none of the above
Answer
D. none of the above
46. Constraint in LP problem are called active if they
A. represent optimal solution
B. at optimality do not consume all the available resources
C. both of (a) and (b)
D. none of the above
Answer
A. represent optimal solution
47. Alternative solutions exists 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
B. objective function equation is parallel to one of the constraints
48. While solving an LP problem, infeasibility may be removed by
A. adding another constraint
B. adding another variable
C. removing a constraint
D. removing a variable
Answer
C. removing a constraint
49. ___ 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
B. critical path
50. Activities lying on the critical path are called ___
A. net work
B. critical path
C. critical activities
D. none of the above
Answer
C. critical activities
51. It ___ at which an activity can start.
A. est
B. eft
C. lst
D. lft
Answer
A. est
52. ___ is the earliest starting time plus activity time.
A. est
B. eft
C. lst
D. lft
Answer
B. eft
53. ___ is the latest time by which an activity can be started without delaying thecompletion of the project.
A. est
B. eft
C. lst
D. lft
Answer
C. lst
54. ___ is the latest time by which an activity can be finished without delaying thecompletion of the project.
A. est
B. eft
C. lst
D. lft
Answer
D. lft
55. ___ is the duration by which an activity can be delayed without delaying theproject
A. slack
B. total float
C. free float
D. independent float
Answer
B. total float
56. ___ is the time by which the completion of an activity can be delayed beyond itsearliest finish time without affecting the earliest start time of a succeeding activity
A. slack
B. total float
C. free float
D. independent float
Answer
C. free float
57. ___ is activity oriented.
A. cpm
B. pert
C. lp
D. none of the above
Answer
A. cpm
58. ___ is event oriented.
A. cpm
B. pert
C. lp
D. none of the above
Answer
B. pert
59. PERT emphasis on ___
A. time
B. activity
C. a) and b)
D. none of the above
Answer
A. time
60. Full form of PERT is
A. performance evaluation review technique
B. programme evaluation review technique
C. programme evaluation research technique
D. none of these.
Answer
A. performance evaluation review technique
61. ___ is a scheme or design of something intended or device.
A. programme
B. project
C. network
D. float
Answer
C. network
62. An activity which must be completed before one or more other activities start is knownas ___ activity.
A. dummy
B. predecessor
C. successor
D. none of these
Answer
B. predecessor
63. The event is commonly represented by ___ in network diagram
A. nodes
B. arrow
C. triangle
D. none of these
Answer
A. nodes
64. ___ is the disconnection of an activity before the completion of activities in a projectnetwork diagram.
A. dangling
B. looping
C. dummy
D. none of the above
Answer
C. dummy
65. ___ is an activity oriented diagram.
A. cpm
B. pert
C. histogram
D. none of the above
Answer
A. cpm
66. ___ is the duration by which an activity can be delayed without delaying theproject.
A. total float
B. slack
C. earliest event time
D. none of these
Answer
A. total float
67. ___ is the shortest possible time in which an activity can be delayed withoutdelaying the project.
A. pessimistic time estimate
B. optimistic time estimate
C. most likely time estimate
D. none of these
Answer
B. optimistic time estimate
68. Which of the following is not a part of decision tree problem specification?
A. a list of alternatives
B. a list of possible state of nature
C. evpi
D. pay off associated with alternative/ state of nature combination.
Answer
C. evpi
69. If a decision theory problem has 3 decision alternatives and 4 states of nature, thenumber of payoffs in that problem will be
A. 3
B. 4
C. 12
D. 64
Answer
C. 12
70. In a decision theory problem under complete uncertainty, which one of the followingapproaches will not be possible?
A. expected monetary value
B. maxmin
C. minimax
D. hurwicz
Answer
A. expected monetary value
71. For decision making under uncertainty, identify the decision rule that is appropriatefor the optimist.
A. laplace
B. maximax
C. minimax regret
D. maxmin
Answer
B. maximax
72. What decision-making condition must exist for the decision tree to be a valuable tool?
A. certainty
B. uncertainty
C. risk
D. it does not matter, the tool is appropriate in all environments
Answer
C. risk
73. Which of the following is (are) types of decision-making environments?
A. decision making under uncertainty
B. decision making under certainty
C. decision making under risk
D. none of the above
Answer
B. decision making under certainty
74. A good decision always implies that
A. will obtain the best final results
B. have used appropriate quantitative analysis.
C. have considered all alternatives
D. have followed a logical process.
Answer
D. have followed a logical process.
75. All of the following are steps in the decision-making process EXCEPT
A. define the problem
B. list alternatives
C. identify the possible outcomes
D. compute the posterior probabilities.
Answer
D. compute the posterior probabilities.
76. The equally likely decision criteria is also known as
A. bayes
B. laplace
C. minimax
D. hurwicz
Answer
B. laplace
77. Opportunity loss refers to
A. the expected value of a bad decision
B. the expected loss from a bad decision
C. the difference between actual pay off and the optimal pay off
D. the regret from not having made a decision
Answer
C. the difference between actual pay off and the optimal pay off
78. The criteria of expected monetary value is used for making decisions under
A. certainty
B. uncertainty
C. risk
D. all of the above
Answer
D. all of the above
79. The maximax criteria is ___
A. optimistic
B. neutral
C. pessimistic
D. can be any one of the above
Answer
C. pessimistic
80. Which of the following might be viewed as an optimistic decision criterion?
A. hurwicz criterion
B. maximin
C. maximax
D. minimax
Answer
C. maximax
