A feasible solution to a linear programming problem
1.Must satisfy all problem constraints simultaneously
2.Need not satisfy all constraints
3.Must be a corner point of the feasible region
4.Must optimize the value of the objective function
A good decision always implies that
1.Will obtain the best final results
2.Have used appropriate quantitative analysis.
3.Have considered all alternatives
4.Have followed a logical process.
A model is
1.An essence of reality
2.An approximation
3.An idealization'
4.All of the above
A physical model is an example of
1.An iconic model
2.An analogue model
3.A verbal model
4.A mathematical model
Activities lying on the critical path are called _____
1.Net work
2.Critical path
3.Critical activities
4.None of the above
All of the following are steps in the decision-making process EXCEPT
1.Define the problem
2.List alternatives
3.Identify the possible outcomes
4.Compute the posterior probabilities.
An activity which must be completed before one or more other activities start is known as ______ activity.
1.Dummy
2.Predecessor
3.Successor
4.None of these
An event which represents the beginning of more than one activity is known as _______ event.
1.Merge
2.Net
3.Burst
4.None of the above
An optimization model
1.Mathematically provides best decision
2.Provides decision with limited context
3.Helps in evaluating various alternatives constantly
4.All of the above
Any activity which does not consume either any resource or time is called ______________ activity.
1.Predecessor
2.Successor
3.Dummy
4.End
Constraint in LP problem are called active if they
1.Represent optimal solution
2.At optimality do not consume all the available resources
3.Both of (a) and (b)
4.None of the above
Decision variables are
1.Controllable
2.Uncontrollable
3.Parameters
4.None of the above
For decision making under uncertainty, identify the decision rule that is appropriate for the optimist.
1.Laplace
2.Maximax
3.Minimax regret
4.Maxmin
If a decision theory problem has 3 decision alternatives and 4 states of nature, the number of payoffs in that problem will be
1.3
2.4
3.12
4.64
In linear programming problem if all constraints are less than or equal to, then the feasible region is
1.Above lines
2.Below the lines
3.Unbounded
4.None of the above
It ______________ at which an activity can start.
1.EST
2.EFT
3.LST
4.LFT
L _____ is that sequence of activities which determines the total project time.
1.Net work
2.Critical path
3.Critical activities
4.None of the above
Modern scientific management research originated during ____
1.World war II
2.World war I
3.1990
4.1993
Opportunity loss refers to
1.The expected value of a bad decision
2.The expected loss from a bad decision
3.The difference between actual pay off and the optimal pay off
4.The regret from not having made a decision
The application of OR techniques involves ______________ approach
1.Individual
2.Team
3.Critical
4.None of the above
The best use of linear programming technique is to find an optimal use of
1.Money
2.Man power
3.Machine
4.All of the above
The criteria of expected monetary value is used for making decisions under
1.Certainty
2.Uncertainty
3.Risk
4.All of the above
The decision making criteria that should be used to achieve maximum long term pay off is
1.EOL
2.EMV
3.Hurwicz
4.Maximax
The initial solution of a transportation problem can be obtained by applying any known method. But the only condition is
1.The solution be optimal
2.The solution be optimal
3.The solution not be degenerate
4.All of the above
The minimum EOL will always result in the same decision as
1.Minimax
2.Maximin
3.Maximum EMV
4.Maximax
The minimum expected opportunity loss is
1.Equal to EVPI
2.Minimum regret
3.Equal to EMV
4.Both (a) and (b)
The objective of network analysis is to
1.Minimize total project duration
2.Minimize total project cost
3.Minimize production delays, interruption and conflicts
4.All of the above
What decision-making condition must exist for the decision tree to be a valuable tool?
1.Certainty
2.Uncertainty
3.Risk
4.It does not matter, the tool is appropriate in all environments
When total supply is equal to total demand in a transportation problem , the problem is said to be
1.Balanced
2.Unbalanced
3.Degenerate
4.None of the above
Which of the following as an assumption of an LP model
1.Divisibility
2.Proportionality
3.Additively
4.All of the above
Which of the following criterion is not used for decision making under uncertainty?
1.Maximin
2.Maximax
3.Minimax
4.Minimize expected loss
Which of the following is not a category of linear programming problems?
1.Resource allocation problem
2.Cost benefit trade off problem
3.Distribution network problem
4.All of the above are categories of linear programming problems.
Which of the following is not a part of decision tree problem specification?
1.a list of alternatives
2.A list of possible state of nature
3.EVPI
4.Pay off associated with alternative / state of nature combination.
Which of the following may not be in a linear programming formulation?
1.<=.
2.>.
3.=.
4.All the above.
While solving LP problem graphically, the area bounded by the constraints is called
1.Feasible region
2.Infeasible region
3.Unbounded solution
4.None of the above
__ is the duration by which an activity can be delayed without delaying the project.
1.Total float
2.Slack
3.Earliest event time
4.None of these
_____ is a series of related activities which result in some product or services.
1.Network
2.transportation model
3.assignment
4.None of these
_____ is the disconnection of an activity before the completion of activities in a project network diagram.
1.Dangling
2.Looping
3.Dummy
4.None of the above
_____ is the shortest possible time in which an activity can be delayed without delaying the project.
1.Pessimistic time estimate
2.Optimistic time estimate
3.Most likely time estimate
4.None of these
______ is a method of analyzing the current movement of the same variable in an effort to predict the future movement of the same variable.
1.Goal programming
2.Markov analysis
3.Replacement theory
4.Queuing theory
______ is an important Operations research technique to be used for determining optimal allocation of limited resources to meet the given objectives.
1.Waiting line theory
2.Net work analysis
3.Decision analysis
4.Linear programming
_______ is event oriented.
1.CPM
2.PERT
3.LP
4.None of the above
_______ is the duration by which an activity can be delayed without delaying the project
1.Slack
2.Total float
3.Free float
4.Independent float
________ Example of probabilistic model
1.Game theory
2.Charts
3.Graphs
4.All the above.
________ helps management to evaluate alternative course of action for selecting the best course of action
1.Operations research
2.Quantitative technique
3.Management research
4.None of the above
________ is a scheme or design of something intended or device.
1.Programme
2.Project
3.Network
4.Floating ad
________ is activity oriented.
1.CPM
2.PERT
3.LP
4.None of the above
________ Is known as symbolic model
1.Iconic
2.Mathematical
3.Analogue
4.None of the above
________ is the time by which the completion of an activity can be delayed beyond its earliest finish time without affecting the earliest start time of a succeeding activity
1.Slack
2.Total float
3.Free float
4.Independent float
_________ is the latest time by which an activity can be started without delaying the completion of the project.
1.EST
2.EFT
3.LST
4.LFT