MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 2265 Mcqs, each offering curated multiple-choice questions to sharpen your Current Affairs knowledge and support exam preparation. Choose a topic below to get started.
| 151. |
Which of the following criterion is not used for decision making under uncertainty? |
| A. | maximin |
| B. | maximax |
| C. | minimax |
| D. | minimize expected loss |
| Answer» E. | |
| 152. |
The minimum EOL will always result in the same decision as |
| A. | minimax |
| B. | maximin |
| C. | maximum emv |
| D. | maximax |
| Answer» D. maximax | |
| 153. |
Decision theory is concerned with |
| A. | methods of arriving at an optimal decision |
| B. | selecting optimal decision in sequential manner |
| C. | analysis of information that is available |
| D. | all of the above |
| Answer» E. | |
| 154. |
Which of the following might be viewed as an optimistic decision criterion? |
| A. | hurwicz criterion |
| B. | maximin |
| C. | maximax |
| D. | minimax |
| Answer» D. minimax | |
| 155. |
The maximax criteria is…….. |
| A. | optimistic |
| B. | neutral |
| C. | pessimistic |
| D. | can be any one of the above |
| Answer» D. can be any one of the above | |
| 156. |
The criteria of expected monetary value is used for making decisions under |
| A. | certainty |
| B. | uncertainty |
| C. | risk |
| D. | all of the above |
| Answer» E. | |
| 157. |
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» D. the regret from not having made a decision | |
| 158. |
The equally likely decision criteria is also known as |
| A. | bayes |
| B. | laplace |
| C. | minimax |
| D. | hurwicz |
| Answer» C. minimax | |
| 159. |
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» E. | |
| 160. |
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» E. | |
| 161. |
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» C. decision making under risk | |
| 162. |
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» D. it does not matter, the tool is appropriate in all environments | |
| 163. |
For decision making under uncertainty, identify the decision rule that is appropriatefor the optimist. |
| A. | laplace |
| B. | maximax |
| C. | minimax regret |
| D. | maxmin |
| Answer» C. minimax regret | |
| 164. |
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» B. maxmin | |
| 165. |
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» D. 64 | |
| 166. |
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» D. pay off associated with alternative/ state of nature combination. | |
| 167. |
………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» C. most likely time estimate | |
| 168. |
………… 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» B. slack | |
| 169. |
…………..is an activity oriented diagram. |
| A. | cpm |
| B. | pert |
| C. | histogram |
| D. | none of the above |
| Answer» B. pert | |
| 170. |
…….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» D. none of the above | |
| 171. |
The event is commonly represented by …… in network diagram |
| A. | nodes |
| B. | arrow |
| C. | triangle |
| D. | none of these |
| Answer» B. arrow | |
| 172. |
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» C. successor | |
| 173. |
…….. is a scheme or design of something intended or device. |
| A. | programme |
| B. | project |
| C. | network |
| D. | float |
| Answer» D. float | |
| 174. |
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» B. programme evaluation review technique | |
| 175. |
………. is event oriented. |
| A. | cpm |
| B. | pert |
| C. | lp |
| D. | none of the above |
| Answer» C. lp | |
| 176. |
PERT emphasis on ……….. |
| A. | time |
| B. | activity |
| C. | and b) |
| D. | none of the above |
| Answer» B. activity | |
| 177. |
……….is activity oriented. |
| A. | cpm |
| B. | pert |
| C. | lp |
| D. | none of the above |
| Answer» B. pert | |
| 178. |
……………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» C. free float | |
| 179. |
……… 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» D. independent float | |
| 180. |
……….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» E. | |
| 181. |
………. 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» D. lft | |
| 182. |
………… is the earliest starting time plus activity time. |
| A. | est |
| B. | eft |
| C. | lst |
| D. | lft |
| Answer» C. lst | |
| 183. |
It ………. at which an activity can start. |
| A. | est |
| B. | eft |
| C. | lst |
| D. | lft |
| Answer» B. eft | |
| 184. |
………..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 | |
| 185. |
Activities lying on the critical path are called…………. |
| A. | net work |
| B. | critical path |
| C. | critical activities |
| D. | none of the above |
| Answer» D. none of the above | |
| 186. |
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» D. removing a variable | |
| 187. |
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» C. two constraints are parallel. | |
| 188. |
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» B. at optimality do not consume all the available resources | |
| 189. |
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» E. | |
| 190. |
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 | |
| 191. |
………. 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 | |
| 192. |
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» C. unbounded | |
| 193. |
Straight lines shown in a linear programming graph indicates |
| A. | objective function |
| B. | constraints |
| C. | points |
| D. | all the above |
| Answer» C. points | |
| 194. |
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» D. less than or equal to | |
| 195. |
Which of the following may not be in a linear programming formulation? |
| A. | <=. |
| B. | >. |
| C. | 0 |
| D. | all the above |
| Answer» C. 0 | |
| 196. |
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» D. removing a variable | |
| 197. |
A linear programming model does not contain which of the following components? |
| A. | data |
| B. | decisions |
| C. | constraints |
| D. | a spread sheet |
| Answer» E. | |
| 198. |
Which of the following is not a category of linear programming problems? |
| A. | resource allocation problem |
| B. | cost benefit trade off problem |
| C. | distribution network problem |
| D. | all of the above are categories of linear programming problems. |
| Answer» E. | |
| 199. |
While solving LP problem 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 | |
| 200. |
The solution space of a 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) and (b) |
| Answer» D. both (a) and (b) | |