DS Merge2

Id 1
Question Q. 1 If P(A) = 0.6, P(B) = 0.4, P(A and B) = 0.0 , what can
be said about events A and B?
A (a) Independent
B (b) Mutually exclusive
C (c) Posterior probability
D (d) All of the above
Answer b
Marks 1
Unit 5
Id 2
Question Q. 2 The probability of event A occurring is 0.3, while

the probability that event B occurs is 0.8. The
probability that event A and event B occur
simultaneously is 0.2. If it is known that event A
occurred, what is the probability that event B occurred
also?
A (a) 0.67
B (b) 0.25
C (c) 0.16
D (d) 0.90
Answer a
Marks 1
Unit 5
Id 3
Question Q. 3 A production process is known to produce a

particular item in such a way that 3% of these are
defective. If three items are randomly selected as they
come off the production line, what is the probability
that all three are defective (assuming that they are all
independent)?
A (a) 0.027
B (b) 0.09
C (c) 0.00027
D (d) 0.000027
Answer b
Marks 1
Unit 5
Id 4
Question Q. 4 A company is considering producing some new

products. Based on past records, management believes
that there is a 60% chance that the first product will be
successful, and a 40% chance that the second product
will be successful. As these products are completely
different, it may be assumed that the success of one is
totally independent of the success of the other. If two
products are introduced to the market, what is the
probability that both are successful?
A (a) 0.12
B (b) 0.60
C (c) 0.24
D (d) 0.36
Answer c
Marks 1
Unit 5
Id 5
Question Q. 5 In a throw of coin what is the probability of

getting head.
A (a) 1
B (b) 2
C (c) ½
D (c) 0
Answer c
Marks 1
Unit 5
Id 6
Question Q. 6 In a throw of dice what is the probability of getting

number greater than 5
A (a) ½
B (b) 1/3
C (c) 1/5
D (d) 1/6
Answer d
Marks 1
Unit 5
Id 7
Question Q. 7 If two events are independent, then
A (a) they must be mutually exclusive
B (b) the sum of their probabilities must be equal to one
C (c) their intersection must be zero
D (d) None of these alternatives is correct.
Answer d
Marks 1
Unit 5
Id 8
Question Q. 8 Probability lies between :
A (a) -1 and +1
B (b) 0 and 1
C (c) 0 and n
D (d) 0 and co
Answer b
Marks 1
Unit 5
Id 9
Question Q. 9 A set of all possible outcomes of an experiment is

called :
A (a) Combination
B (b) Sample point
C (c) Sample space
D (d) Compound event
Answer c
Marks 1
Unit 5
Id 10
Question Q. 10 The events having no experimental outcomes in

common is called :
A (a) Equally likely events
B (b) Exhaustive events
C (c) Mutually exclusive events
D (d) Independent events .
Answer c
Marks 1
Unit 5
Id 11
Question Q. 11 The probability associated with the reduced

sample space is called:
A (a) Conditional probability
B (b) Statistical probability

C (c) Mathematical probability
D (d) Subjective probability
Answer a
Marks 1
Unit 5
Id 12
Question Q. 12 If A is any event in S and A its complement, then

P(A) is equal to:
A (a) 1
B (b) 0
C (c) 1-A
D (d) 1-P(A)
Answer d
Marks 1
Unit 5
Id 13
Question Q. 13 When certainty is involved in a situation, its

probability is equal to:
A (a) Zero
B (b) Between-I and + 1
C (c) Between 0 and 1
D (d) One
Answer d
Marks 1
Unit 5
Id 14
Question Q. 14 Which of the following cannot be taken as

probability of an event?
A (a) 0
B (b) 0.5
C (c) 1
D (d) -1
Answer d
Marks 1
Unit 5
Id 15
Question Q. 15 The term 'sample space' is used for:
A (a) All possible outcomes
B (b) All possible coins
C (c) Probability
D (d) Sample
Answer a
Marks 1
Unit 5
Id 16
Question Q. 16 The term 'event' is used for:
A (a) Time
B (b) A sub-set of the sample space
C (c) Probability
D (d) Total number of outcomes.
Answer b
Marks 1
Unit 5
Id 17
Question Q. 17 When the occurrence of one event has no effect

on the probability of the occurrence of another event,
the events are called :
A (a) Independent
B (b) Dependent
C (c) Mutually exclusive
D (d) Equally likely
Answer a
Marks 1
Unit 5
Id 18
Question Q. 18 The six faces of the die are called equally likely if
the die is :
A (a) Small
B (b) Fair
C (c) Six-faced
D (d) Round
Answer b
Marks 1
Unit 5
Id 19
Question Q. 19 If we toss a coin and P(T)=2P(H), then probability

of head is equal to:
A (a) 0
B (b) ½
C (c) 1/3
D (d) 2/3
Answer c
Marks 1
Unit 5
Id 20
Question Q. 20 Given P(A) = 0.3, P(B) = 0.5 and P(AUB)=0.8,then:
A (a) A and B are not mutually exclusive events
B (b) A and B are equally likely events
C (c) A and Bare independent events
D (d) A and B are mutually exclusive events
Answer d
Marks 1
Unit 5
Id 21
Question Q. 22 Two dice are rolled. Probability of getting similar

faces is:
A (a) 5/36
B (b) 1/6
C (c) 1/3
D (d) ½
Answer b
Marks 1
Unit 5
Id 22
Question Q. 24 Probability of getting a red ace if a card is drawn

at random from pack of 52 cards is
A (a) 1/52
B (b) 1/26
C (c) 1/13
D (d) 1
Answer b
Marks 1
Unit 5
Id 23
Question Q. 25 A survey of 120 business executives revealed the

following results: (1) 80 Read the Financial Times (2) 60
read the Economist (3) 40 read both the Financial Times
and the Economist
A (a) 0.333
B (b) 0.833
C (c) 0.666
D (d) 0.5
Answer a
Marks 1
Unit 5
Id 24
Question Q. 26 If an executive is picked at random, find the

probability that he or she reads both the Financial
Times and the Economist.
A (a) 0.333
B (b) 0.833
C (c) 0.666
D (d) 0.5
Answer b
Marks 1
Unit 5
Id 25
Question Q. 27 A standard normal distribution has:
A (a) the mean equal to the variance
B (b) mean equal 1 and variance equal 1

C (c) mean equal 0 and variance equal 1
D (d) mean equal 0 and standard deviation equal 0
Answer c
Marks 1
Unit 5
Id 26
Question Q. 31 Shape of normal curve can be related to (a) Circle

(b) (c) L (d) bell Q. 32 Total Area under the normal
curve is
A (a) 0
B (b) Greater than 1
C (c) 1
D (d) Less than 1
Answer d
Marks 1
Unit 5
Id 27
Question Q. 33 A Bernoulli trial has:
A (a) At least two outcomes
B (b) At most two outcomes
C (c) Two outcomes
D (d) Fewer than two outcomes
Answer c
Marks 1
Unit 5
Id 28
Question Q. 35 In a binomial probability distribution, the sum of

probability of failure and probability of success is
always:
A (a) Zero
B (b) Less than 0.5
C (c) Greater than 0.5
D (d) One
Answer d
Marks 1
Unit 5
Id 29
Question Q. 36 If n = 6 and p= 0.9 then the value of P(x = 7) is:
A (a) Zero
B (b) Less than zero
C (c) More than zero
D (d) One
Answer a
Marks 1
Unit 5
Id 30
Question Q. 37 In a multiple choice test there are five possible

answers to each of 20 questions. If a candidate guesses
the correct answer each time, the mean number of
correct answers is:
A (a) 4
B (b) 5
C (c) 1/5
D (d) 20
Answer a
Marks 1
Unit 5
Id 31
Question Q. 38 If the probability of a success is 0.80, and there

are n=10 trials, then the mean of the binomial
distribution is would be
A (a) 1.6
B (b) 1.26
C (c) 8
D (d) 0.08
Answer c
Marks 1
Unit 5
Id 32
Question Q. 39 If n = 10 and p = 0.8, then the variance of the

binomial distribution is
A (a) 1.6
B (b) 1.26
C (c) 8
D (d) 0.08
Answer a
Marks 1
Unit 5
Id 1
Question Q. 1 -------- is a series of related activities which result in some product or services.
A (a) Network
B (b) transportation mode
C (c) assignment
D (d) none of these
Answer a
Marks 1
Unit 4
Id 2
Q. 2 Any activity which does not consume either any resource or time is called
Question activity.
A (a) Predecessor
B (b) Successor
C (c) Dummy
D (d) End
Answer c
Marks 1
Unit 4
Id 3
Q. 3 An activity which must be completed before one or more other activities start
Question is known as activity.
A (a) Predecessor
B (b) Successor
C (c) Dummy
D (d) End
Answer a
Marks 1
Unit 4
Id 4
Q. 4 Activities that cannot be started until one or more of the other activities are
Question completed, but immediately succeed them are called ----------- activities
A (a) Predecessor
B (b) Successor
C (c) Dummy
D (d) End
Answer a
Marks 1
Unit 4
Id 5
Q. 5 An event which represents the beginning of more than one activity is known as
Question --------event.
A (a) Merge
B (b) Net
C (c) Burst
D (d) None of the above
Answer c
Marks 1
Unit 4
Id 6
Question Q. 6----------- is that sequence of activities which determines the total project time.
A (a) Net work
B (b) Critical path
C (c) Critical activities
Answer b
Marks 1
Unit 4
Id 7
Question Q. 7 Activities lying on the critical path are called---------
A (a) Net work
B (b) Critical path
C (c) Critical activities
Answer c
Marks 1
Unit 4
Id 8
Question Q. 8 It----------- at which an activity can start.
A (a) EST
B (b) EFT
C (c) LST
D (d) LFT
Answer a
Marks 1
Unit 4
Id 9
Question Q. 9 With respect to PERT and CPM, slack
A (a) marks the start or completion of a task.
(b) is the amount of time a task may be delayed without changing the overall
B project completion time.
C (c) is a task or subproject that must be completed.
D (d) is the latest time an activity can be started without delaying the entire project.
Answer b
Marks 1
Unit 4
Id 10
Q. 10 An activity has an optimistic time of 15 days, a most likely time of 18 days, and
Question a pessimistic time of 27 days. What is its expected time?
A (a) 60 days
B (b) 20 days
C (c) 18 days
D (d) 19 days
Answer d
Marks 1
Unit 4
Id 11
Q. 11 An activity has an optimistic time of 11 days, a most likely time of 15 days, and
Question a pessimistic time of 23 days. What is its variance?
A (a) 16.33
B (b) 15.6
C (c) 4
D (d) 2
Answer c
Marks 1
Unit 4
Id 12
Q. 12 Time an activity would take assuming very unfavorable conditions is

Question represented by the
A (a) Optimistic time
B (b) Most likely time
C (c) Pessimistic time
D (d) Expected time
Answer c
Marks 1
Unit 4
Id 13
Question Q. 13 In an AON network representation, the -------- represents the activities.
A (a) Arrow
B (b) Node
C (c) Time estimate
D (d) Arcs
Answer b
Marks 1
Unit 4
Id 14
Q. 15 The earliest start (ES) of an activity is the ----------- earliest finish (EF) of the
Question immediate
A (a) smallest, successors
B (b) largest, successors
C (c) smallest, predecessors
D (d) largest, predecessors
Answer d
Marks 1
Unit 4
Id 15
Q. 16 The time of an activity in a network can be approximated by which

Question distribution?
A (a) Binomial
B (b) Normal
C (c) Chi-square
D (d) Beta
Answer d
Marks 1
Unit 4
Id 16
Question Q. 17 Which of these may require the use of a dummy activity?
A (a) Gantt Chart
B (b) Activity-on-arrow network.
C (c) Activity-on-node network.

D (d) Both b and C
Answer b
Marks 1
Unit 4
Id 17
Question Q. 18 CPM is :
A (a) Critical Project Management
B (b) Critical Path Management
C (c) Critical Path Method
D (d) Crash Project Method
Answer c
Marks 1
Unit 4
Id 18
Q. 19 Activities G, P, and R are the immediate predecessors for activity W. If the

earliest finish times for the three are 12, 15, and 10, then the earliest start time for
Question W
A (a) is 10.
B (b) is 12.
C (c) is 15.
D (d) cannot be determined. –
Answer c
Marks 1
Unit 4
Id 19
Q. 20 Activities K, M and S immediately follow activity H, and their latest start times
Question are 14, 18, and 11. The latest finish time for activity H
A (a) is 11.
B (b) is 14.
C (c) is 18.
D (d) can not be determined.
Answer a
Marks 1
Unit 4
Id 20
Question Q. 21 The critical path
A (a) is any path that goes from the starting node to the completion node.
B (b) is a combination of all paths.
C (c) is the shortest path.
D (d) is the longest path.
Answer d
Marks 1
Unit 4
Id 21
Question Q. 22 Which of the following statements regarding PERT times is true?
(a) Optimistic time estimate is an estimate of the minimum time an activity will
A require.
(b) Optimistic time estimate is an estimate of the maximum time an activity will
B require.
(c) Most likely time estimate is an estimate of the maximum time an activity will
C require.
(d) Pessimistic time estimate is an estimate of the minimum time an activity will
D require.
Answer a
Marks 1
Unit 4
Id 22
Q. 23 At the completion of the forward and backward passes, the slack for an
Question activity is given by the
A (a) difference between early start and early finish.
B (b) difference between early start and latest finish.
C (c) difference between latest start and early finish
D (d) difference between latest start and early start
Answer d
Marks 1
Unit 4
Id 23
Q. 24 A project has three paths: A--B—C has a length of 25 days. A—D—C has a
length of 15 days. A—E--C has a length of 20 days. Which of the following
Question statements is correct?
A (a) A—D—C is the critical path.
B (b) A—B—C has the most slack.
C (c) The expected duration of the project is 25 days.
D (d) The expected duration of this project is 60 days.
Answer c
Marks 1
Unit 4
Id 24
Question Q. 25 With respect to PERT and CPM, slack
A (a) is a task or subproject that must be completed.
B (b) is the latest time an activity can be started without delaying the entire project.
(c) is the amount of time a task may be delayed without changing the overall
C project completion time.
D (d) marks the start or completion of a task
Answer c
Marks 1
Unit 4
Id 25
Question Q. 26 A dummy activity is required when
A (a) two or more activities have the same ending events.
(b) the network contains two or more activities that have identical starting and
B ending events.
C (c) two or more activities have different ending events.
D (d) two or more activities have the same starting events.
Answer b
Marks 1
Unit 4
Id 26
Question Q. 27 PERT analysis computes the variance of the total project completion time as
A (a) the sum of the variances of all activities in the project.
B (b) the sum of the variances of all activities on the critical path.
C (c) the sum of the variances of all activities not on the critical path.
D (d) the variance of the final activity of the project.
Answer b
Marks 1
Unit 4
Id 27
Q. 28 The time of activity in a project can be estimated to have a most likely

completion time of 7 days, an optimistic time of 6 days, and a per!simi;:ltic time 1.,,f
9 days. Which of the following is true of the Expected time and the variance for this
Question activity
A (a) 0.25 days, 7.17 days
B (b) 7.33 days, 0.25 days
C (c) 7.17 days, 0.25 days
D (d) 3.67 days, 0.25 days
Answer c
Marks 1
Unit 4
Id 28
Q. 29 A project's critical path is composed of activities A, B, and C. Activity A has a

standard deviation of 2, activity B has a standard deviation of 1, and activity C has a
Question standard deviation of 2. What is the standard deviation of the critical path?
A (a) 25
B (b) 9
C (c) 3
D (d) 5
Answer c
Marks 1
Unit 4
Id 29
Q. 30 Activities A and B are both 6 days long and the only immediate predecessors
to activity C. Activity A has ES=8 and LS=8 and activity B has ES=7 and LS=10. What is
Question the ES of activity C?
A (a) 14
B (b) 15
C (c) 16
D (d) 13
Answer a
Marks 1
Unit 4
Id 30
Question Q. 31 Dummy activities
A (a) Are found in both AOA and AON networks
B (b) Have a duration equal to the shortest non-dummy activity in the network.
C (c) Cannot be on the critical path.
D (d) Are used when two activities have identical starting and ending events.
Answer d
Marks 1
Unit 4
Id 31
Question Q. 32 Full form of PERT is
A (a) Performance evaluation review technique
B (b) Programme Evaluation Review technique

C (c) Programme Evaluation Research Technique
D (d) None of these.
Answer b
Marks 1
Unit 4
Id 32
Q. 33----- is the duration by which an activity can be delayed without delaying the
Question project.
A (a) Total float
B (b) latest time
C (c) Earliest event time
D (d) None of these
Answer a
Marks 1
Unit 4
Id 33
Question Q. 34 ---- is the earliest starting time plus activity time.
A (a) EST
B (b) EFT
C (c) LST
D (d) LFT
Answer b
Marks 1
Unit 4
Id 34
Question Q. 35 Generally PERT technique deals with the project of
A (a) repetitive nature
B (b) non- repetitive nature
C (c) deterministic nature
D (d) none of the above
Answer d
Marks 1
Unit 4
Id 35
Q. 36 The activity which can be delayed without affecting the execution of the
Question immediate e'ici,E.:eciilg activity determined by
A (a) total float
B (b) free float
C (c) independent float
Answer b
Marks 1
Unit 4
Id 36
Question Q. 37 A dummy activity is used in the network diagram when
A (a) two parallel activities have the same tail and head events
(b) the chain of activities may have common event yet be independent by
B themselves
C (c) both a and b

Answer c
Marks 1
Unit 4
Id 37
Question Q. 44 In 2-machine and 5 jobs possible sequence of jobs are
A (a) 1
B (b) 5
C (c) 120
D (d) 2
Answer c
Marks 1
Unit 4
Id 38
Question Q. 45 In sequencing objective is
A (a) Maximize total elapsed time
B (b) Minimize total elapsed time
C (c) Maximize cost
D (d) Minimize sales
Answer b
Marks 1
Unit 4
Id 1
In a decision theory problem under complete

uncertainty, which one of the following approaches
Question will not be possible?
A Expected monetary value
B Maximin
C Minimax
D Hurwitz
Answer a
Marks 1
Unit 3
Id 2
What will you obtain when you sum the profit for
each combination of a state and action times the
Question probability of the occurrence of the state?
A (a) Expected monetary value
B (b) Expected opportunity loss
C (c) Expected value of perfect information
Answer a
Marks 1
Unit 3
Id 3
Q. 3 Which of the following refers to the chance

occurrences that can affect the outcome of an
Question individual's decision?
A (a) Payoff
B (b) State of nature
C (c) Course of action
D (d) Decision criteria
Answer b
Marks 1
Unit 3
Id 4
Q. 4 A situation in which a decision maker knows all of

the possible outcomes of a decision and also knows
the probability associated with each outcome is
Question referred to as
A (a) Certainty
B (b) Risk
C (c) Uncertainty
D (d) Competition
Answer b
Marks 1
Unit 3
Id 5
Q. 5 A matrix that, for each state of nature and

strategy, shows the difference between a strategy's
Question payoff and the best strategy's payoff is called
A (a) maximin matrix
B (b) a minimax regret matrix
C (c) payoff matrix
D (d) maximax matrix

Answer b
Marks 1
Unit 3
Id 6
Q. 6 Which theory concerns making sound decisions

Question under conditions of certainty, risk and uncertainty
A (a) Game Theory
B (b) Network Analysis
C (c) Decision Theory
Answer c
Marks 1
Unit 3
Id 7
Question Q. 7 A pessimistic decision making criterion is
A maximax
B equally likely
C maximin
D decision making under certainty
Answer c
Marks 1
Unit 3
Id 8
Q. 8 In decision making under , there are several

Question possible outcomes for each alternative, and the
decision maker knows the probability of occurrence of
each outcome.
A (a) risk
B (b) utility
C (c) certainty
D (d) probability
Answer a
Marks 1
Unit 3
Id 9
Q. 9 Each player should follow the same strategy

regardless of the other player's strategy in which of
Question the following games?
A (a) Constant Strategy
B (b) Mixed Strategy
C (c) Pure Strategy
D (d) Dominance strategy
Answer c
Marks 1
Unit 3
Id 10
Question Q. 10 In a zero-sum game,
A (a) what one player wins, the other loses.
(b) the sum of each player's winnings if the game is

B played many times must be zero.
(c) the game is fair each person has an equal chance

C of winning.
D (d) long-run profits must be zero.
Answer a
Marks 1
Unit 3
Id 11
Q. 11 In a decision theory problem under complete

uncertainty, which one of the following approaches
Question will not be possible?
A (a) Expected monetary value
B (b) Maxmin
C (c) Minimax
D (d) Hurwicz
Answer a
Marks 1
Unit 3
Id 12
Q. 12 For decision making under uncertainty, identify

Question the decision rule that is appropriate for the optimist.
A (a) Laplace
B (b) Maximax
C (c) Minimax regret
D (d) Maxmin
Answer b
Marks 1
Unit 3
Id 13
Q. 13 The equally likely decision criteria is also known
Question as
A (a) Bayes
B (b) Laplace
C (c) Minimax
D (d) Hurwicz
Answer b
Marks 1
Unit 3
Id 14
Q. 14 The criteria of expected monetary value is used

Question for making decisions under
A (a) Certainty
B (b) Uncertainty
C (c) Risk
D (d) all of the above
Answer c
Marks 1
Unit 3
Id 15
Question The maximax criteria is
A Optimistic
B Neutral
C Pessimistic
D Can be any one of the above

Answer a
Marks 1
Unit 3
Id 16
Q. 16 Which of the following might be viewed as ar-

Question pessimistic decision criterion?
A (a) Hurwicz criterion
B (b) Maximin
C (c) Maximax
D (d) Minimax
Answer b
Marks 1
Unit 3
Id 17
Question Q. 17 In a zero-sum game,
A (a) what one player wins, the other loses.
(b) the sum of each player's winnings if the game is

B played many times must be zero.
(c) the game is fair each person has an equal chance of

C winning.
D (d) long-run profits must be zero.
Answer a
Marks 1
Unit 3
Id 18
Question Q. 18 Point of intersection of pure strategies is called :

A (a) Payoff
B (b) Zero sum game
C (c) Saddle point
D (d) Algebraic
Answer c
Marks 1
Unit 3
Id 19
Q. 19 In a maximization problem when each element

is subtracted from largest element.. the resultant
Question matrix indicates
A (a) Pay-off matrix
B (b) Game matrix
C (c) Minimum matrix
D (d) Opportunity loss matrix
Answer d
Marks 1
Unit 3
Id 20
Q. 20 A mixed strategy 2 x 2 game is solved by

Question method.
A Sub-game method
B Algebraic method
C Dominance rule
D (d) Saddle point method
Answer b
Marks 1
Unit 3
Id 21
Q. 21 In a pure strategy game, probability of selection

Question of his optimal strategy by a player is
A (a) 0
B (b) 1
C (c) 0.5
Answer b
Marks 1
Unit 3
Id 22
Question Q. 23 Point of intersection of pure strategies called :
A Value of game
B Probability of optimum strategy
C Algebraic sum
D None of the above
Answer a
Marks 1
Unit 3
Id 23
Question Q. 24 A mixed strategy is decision of player tz select :
A (a) Same strategy
B (b) Constant Strategy

C (c) Different strategy
D (d)Only one strategy
Answer c
Marks 1
Unit 3
Id 24
Q. 25 The equally likely decision criterion is also

Question known as
A (a) Bay's
B (b) Laplace
C (c) Hurwicz
D (d) Maximin
Answer b
Marks 1
Unit 3
Id 25
Q. 26 A decision maker who looks at the worst result

for every decision, and chooses the decision with the
Question least disappointing possibility is using :
A Minimax regret approach
B Conservative approach
C Optimistic approach
D Equally approach
Answer b
Marks 1
Unit 3
Id 26
Question Q. 27 The decision alternatives
A : (a) Show what might occur in the problem
B (b) Are not under the control of the decision maker
C (c) List the actions the decision maker can select
Answer c
Marks 1
Unit 3
Id 27
Q. 28 Rules for selecting the best alternatives are

Question called :
A (a) Objective
B (b) Outcome
C (c) Events
D (d) Criteria
Answer d
Marks 1
Unit 3
Id 28
Q. 34 The size of payoff matrix of a game can be

Question reduced by using the principle of
A (a) Game inversion
B (b) Rotation reduction
C (c) Dominance
D (d) Game transpose
Answer d
Marks 1
Unit 3
Id 29
Question Q. 35 Game theory models are classified by the
A (a) Number of players
B (b) Sum of all payoffs
C (c) ' Number of strategies
Answer d
Marks 1
Unit 3
Id 30
Q. 36 Which of the following criteria is not used for

Question decision making under uncertainty
A (a) Maximin
B (b) Maximax
C (c) Minimax
D (d) Minimize expected loss
Answer d
Marks 1
Unit 3
Id 31
Question Q. 37 Which of the following criteria is not used for

decision making under risk
A (a) Maximize expected return
B (b) Maximize return
C (c) Minimize expected loss
(d) Knowledge of likelihood occurrence of each state

D of nature
Answer b
Marks 1
Unit 3
Id 32
Q. 38 The difference between the expected profit

under condition of risk and the expected profit with
Question perfect information is called
A (a) Expected value of perfect information
B (b) Expected marginal loss
C (c) Expected opportunity loss
D a) None of the above
Answer a
Marks 1
Unit 3
Id 33
Q. 40 The optimization technique which helps in

Question minimizing total waiting and service costs is
A (a) Queuing Theory
B (b) Decision Theory
C (c) Both A and B

Answer a
Marks 1
Unit 3
Id 34
Q. 42 The passenger and the train in queuing system

Question describers
A Customer and server
B Server and customer
C Both Servers
D (d) Both Customers
Answer a
Marks 1
Unit 3
Id 35
Question Q. 43 In Queuing Model which cost is difficult to find
A (a) Service cost
B (b) Facility cost
C (c) Calling cost
D (d) Waiting cost
Answer b
Marks 1
Unit 3
Id 36
Question Q. 44 A single channel system must have

A (a) One queue discipline
B (b) One waiting line
C (c) One customer allowed to stand
(d) One stage where service is received before exiting

D the system.
Answer b
Marks 1
Unit 3
Id 37
Q. 45 The number of customers in the waiting line

Question means
A (a) Service order
B (b) Queue length
C (c) Waiting time in queue
Answer c
Marks 1
Unit 3
Id 38
Q. 46 Which of the following items is not a part of the

Question queuing system?
A (a) Arrival rate
B (b) Service facility
C (c) Queue
D (d) Activity flow
Answer c
Marks 1
Unit 3
Id 39
Question Q. 47 The Server utilization factor is also known as
A (a) Traffic intensity
B (b) Poisson distribution
C (c) Exponential distribution
D (d) Server Idleness
Answer c
Marks 1
Unit 3
Id 40
Q. 48 In queue Model, M/M/2, the number of servers

Question is
A (a) 1
B (b) M
C (c) 2
D (d) None of these
Answer b
Marks 1
Unit 3
Id 41
Q. 49 The most important factors to consider in

Question analyzing a queuing system are
A (a) The service and arrival rate

B (b) The nature of the calling population
C (c) The queue discipline
Answer c
Marks 1
Unit 3
Id 42
Q. 50 The customers are selected for service a:

Question random. This is known as
A First-come, first served
B Random service discipline
C Last come first served
D None of the above
Answer b
Marks 1
Unit 3
Id 43
Q. 51 The customer who arrives at a system, move

Question from one queue to other in multiple server system is
A (a) Balking
B (b) Cropping
C (c) Reneging
D (d) Jockeying
Answer b
Marks 1
Unit 3
Id 44
Q. 52 In a departmental store customers arrive at a

rate of 15 customers per hour. The average number of
customers that can be handled by cashier is 20 per
Question hour. The time between successive customer is
A (a) 5 min
B (b) 3 min
C (c) 4 min
D (d) 6 min
Answer c
Marks 1
Unit 3
Id 45
Q. 55 The customer who arrives at a bank, see a long

Question line, and leaves to return another time is
A Cropping
B Jockeying
C Balking
D Reneging
Answer c
Marks 1
Unit 3
Id 46
Q. 56 In a departmental store customers arrive at a

rate of 24 customers per hour. The average number of
Question
customers that can be handled by cashier is 30 per
hour. What is service rate in this problem?
A (a) 30
B (b) 3
C (c) 24
D (d) 10
Answer a
Marks 1
Unit 3
Id 47
Q. 57 The machine and the repairmen in queuing

Question system describes
A (a) Customer and server
B (b) Server and customer
C (c) Both Servers
D (d) Both Customers
Answer a
Marks 1
Unit 3
Id 48
Q. 58 In the A/B/C designation for queuing systems,

Question the A term represents information about
A (a) Service time
B (b) Arrival rate
C (c) Number of channels
D (d) Queue size

Answer b
Marks 1
Unit 3
Id 49
Question Q. 59 For unloading cargo, queue discipline is used
A (a) First come first served
B (b) Last come first served
C (c) Random come first served
Answer b
Marks 1
Unit 3
Id 1
Question Q. 1 Simulation
A Does not guarantee optimality.
Flexible and does not require the assumptions of

B theoretical models+
Allows testing of the system without affecting the real

C system.
D All of the above
Answer d
Marks 1
Unit 2
Id 2
A simulation model uses the mathematical expressions

Question and logical relationships of the
A Real system.
B Computer model.
C Performance measures.
D Estimated inferences.
Answer a
Marks 1
Unit 2
Id 3
All of the following are various ways of generating

Question random numbers except
A Table of random numbers
B Use of computer
C Spin of roulette wheel
D Fibonacci series
Answer d
Marks 1
Unit 2
Id 4
Question Analysis of a Markov process
A Describes future behavior of the system.
B Optimizes the system.
C Leads to higher order decision making.
D All of the above.
Answer a
Marks 1
Unit 2
Id 5
Markov analysis assumes that the states are both----

Question and-----
A Finite, recurrent
B Infinite, absorbing
C Generally inclusive, always independent
D Collectively exhaustive, mutually exclusive
Answer d
Marks 1
Unit 2
Id 6
In Markov analysis, the likelihood that any system will
Question change from one period to the next is revealed by the
A Identity matrix.
B Transition elasticity.
C Matrix of state probabilities.
D Matrix of transition probabilities
Answer d
Marks 1
Unit 2
Id 7
Which technique is used to imitate an operation prior

Question to actual performance?
A Simulation
B Queuing Models
C Inventory Models
D Game Theory
Answer a
Marks 1
Unit 2
Id 8
Question Values for the probabilistic inputs to a simulation are
A Selected by the decision maker.
B Controlled by the decision maker.
C Randomly generated based on historical information.
D Calculated by fixed mathematical formulas

Answer c
Marks 1
Unit 2
Id 9
Question Simulation should be thought of as a technique for
A Increasing ones understanding of a problem.
Obtaining a relatively inexpensive solution to a

B problem.
C Obtaining an optimal solution to a problem,
D None of the above
Answer a
Marks 1
Unit 2
Id 10
Question The following is not an assumption of Markov analysis..
A There is an infinite number of possible states
The probability of changing states remains the same

B over time.
We can predict any future state from the previous

C state and the matrix of transition probabilities.
D All of the above
Answer a
Marks 1
Unit 2
Id 11
Question A condition in which state probabilities do not change

after a long number of period is
A Constant
B Redundant
C Stagnant
D Equilibrium
Answer d
Marks 1
Unit 2
Id 12
The probability that an entity in the Markov process is

Question in a particular state is indicated by
A Transition Matrix
B State Probability Vector
C Identity Matrix
D Equilibrium matrix
Answer a
Marks 1
Unit 2
Id 13
Question The first step in simulation is to
A Construct a numerical model
B Validate the model.
C Set up possible courses of action for testing.
D Define the problem
Answer a
Marks 1
Unit 2
Id 14
Which of the following statements is incorrect

Question regarding the advantages of simulation-
A Simulation is relatively easy to explain and understand.
B Simulation guarantees an optimal solution.
C Simulation models are flexible.
A simulation model provides 'a convenient

D experimental laboratory for the real system
Answer b
Marks 1
Unit 2
Id 15
Question Which of the following are advantages of simulation?
A Simulation allows "what-if 7' type of questions.
Simulation can usually be performed by hand or using

B a smell calculator.
Simulation does not interfere with the real-world

C system.
D a and c only
Answer d
Marks 1
Unit 2
Id 16
Question Markov analysis is a technique that deals with the

probabilities of future occurrences by
A Using Baye's theorem,
B Analyzing presently known probabilities.
C Time series forecasting.
D The maximal flow technique
Answer b
Marks 1
Unit 2
Id 17
Question In transition probability matrix
A The sum of each column is 1
B The sum of each column is 0
C The sum of each row is 1
D The sum of each row is 0
Answer c
Marks 1
Unit 2
Id 18
Question Markov Analysis studies
A Market
B Brand Name
C Brand Switching Behavior
D None of the above
Answer c
Marks 1
Unit 2
Id 19
The simulation model uses the mathematical

Question expressions and logical relationships of the
A Real system.
B Computer model
Answer d
Marks 1
Unit 2
Id 20
The fax machine in an office is very unreliable. If it was

working yesterday, there is a 90% chance it will work
today. if it was not working yesterday, there is a 5%
chance it will work today. The probability that it is not
Question working today, if it was not working yesterday, is
A 0.90
B 0.10
C 0.05
D 0.95
Answer d
Marks 1
Unit 2
Id 21
Question In Markov analysis, we assume that the states are
A Mutually exclusive
B Collectively Exhaustive
C Finite
D All of the above
Answer d
Marks 1
Unit 2
Id 22
Question Simulation is a
A Optimization method
B Descriptive Method
C Measuring Method
D All of the above
Answer b
Marks 1
Unit 2
Id 23
A market research organization studied the car

purchasing behavior in a certain region. It was found
that there are currently 50000 small car owner and
30,000 large car owners in the region. What is current
Question market share vector?
A U =[ 0.5 0.31 ]
B V [0.62 0.38)
C W = [0.6 0.4]
D Can't say
Answer a
Marks 1
Unit 2
Id 24
For a situation with weekly purchase of either an Coke

Question or Pepsi cold drink,
The weekly purchase is the trial and the cold drink is

A the state.
The weekly purchase is the state and the cold drink is

B the trial.
The weekly purchase is the trend and the cold drink is

C the transition.
The weekly purchase is the transition and the cold

D drink is the trend.
Answer a
Marks 1
Unit 2
Id 25
In a matrix of transition probability, the diagonal

Question element represents.
A Gain
B Loss
C Retention
D None of the above
Answer c
Marks 1
Unit 2
Id 26
Question Which of the following is not true?
The probabilities of switching from one state to

A another are called transition probabilities.
Markov chain analysis assumes that the given system

B has a finite number of states.
Switching of different brands of soap within a given

C set is likely to be a case of non-absorbing chains.
An absorbing state is one which if a customer reaches

in, then be has to immediately leave it and return to
D the initial state
Answer d
Marks 1
Unit 2
Id 27
Question An LPP deals with problems involving only
A Single objective
B Multiple objectives.
C Two objective.
D None of these.
Answer a
Marks 1
Unit 2
Id 28
Question In LPP, feasible solution
Must satisfy all the constraints of the problem

A simultaneously
Need not satisfy all of the constraints, only some of

B them
C Must optimize the value of the objective function.
D Must be a corner point of the feasible region.
Answer a
Marks 1
Unit 2
Id 29
While solving LPP graphically to find optimum solution,

Question which of the method is used
A Corner point method
B lso- Line method
C Simplex method
D Both a and b
Answer d
Marks 1
Unit 2
Id 30
Question Which of the following is associated with any LPP
A Simulated solution
B Optimum solution
C Network flow
D Quadratic equation
Answer b
Marks 1
Unit 2
Id 31
Question Which of the following is not associated with any LPP
A Feasible solution
B Optimum solution
C Basic solution
Answer d
Marks 1
Unit 2
Id 32
Question Which of the following is not true about feasible region
It cannot be determined in a graphical solution of an

A LPP.
B It is independent of the objective function.
It implies that there must be a convex region satisfying

C all the constraints.
An extreme point of the convex feasible region gives

D the optimum solution.
Answer a
Marks 1
Unit 2
Id 33
Question The constraints in LPP model represent

A Availability
B Requirement
C Objective
D .Both a and b
Answer d
Marks 1
Unit 2
Id 34
In mathematical programming, the goal represented

Question by objective function includes
A Profit value
B Total cost and revenue
C Production capacity
D of the above
Answer d
Marks 1
Unit 2
Id 35
In LPP maximization problem, the optimal solution

Question occurring at the corner point yields the
A Mid value of objective function
B Highest value of objective function
C Lowest value of objective function
D Mean value of objective function
Answer b
Marks 1
Unit 2
Id 36
Question Practically multiple optimal solutions
A are infeasible
B are unbounded
C are degenerate
provide management with greater flexibility in

D selecting and using resources
Answer d
Marks 1
Unit 2
Id 37
Infeasibility means that the number of solutions to the

linear programming problem that satisfies all
Question constraints is
A Zero.
B At least 1.
C All.
D At least 2.
Answer a
Marks 1
Unit 2
Id 38
Graphical method of linear programming is useful

Question when the number of decision variables is
A 1
B 2
C 3
D More than 3
Answer b
Marks 1
Unit 2
Id 39
Question In LPP, the area bounded by all the given constraints is
A Non feasible region
B Basic solution
C Feasible region
D Optimum basic feasible solution
Answer c
Marks 1
Unit 2
Id 40
Question Decision variables
Tell about how much or how many of something to

A produce, invest, purchase, hire, etc,
B Represent the values of the constraints.
C Measure the objective function.
D Must exist for each constraint.
Answer a
Marks 1
Unit 2
Id 41
Question Multiple solution exist in a LPP when
A One of the constraint is redundant
B Objective function is parallel to one of the constraints
C Two constraints are parallel
D All of the above
Answer b
Marks 1
Unit 2
Id 42
The overall goal stated as to represent the function of

Question decision variable in LPP is best classified as
A Constraint function
B Objective function
C Functional modeling
D Programme function
Answer b
Marks 1
Unit 2
Id 1
In transportation problem, the points of demand is

Question classified as
A (a) Transportation
B (b) Sources
C (c) Destinations
D (d) Origins
Answer c
Marks 1
Unit 1
Id 2
In transportation problem, the points of supply is

Question classified as
A (a) Transportation
B (b) Sources
C (c) Destinations
D (d) Cost
Answer b
Marks 1
Unit 1
Id 3
The objectives such as minimizing the total

Question transportation cost are considered as
A (a) Assignment Models
B (b) Transportation Models
C (c) Destination Models

D (d) Origins Models
Answer b
Marks 1
Unit 1
Id 4
Which of the following is true about assignment

Question problem:
(a) An assignment problem can be solved by

A enumeration method
(b) An assignment problem can be solved by Floods

B technique
(c) An assignment problem can be solved by Hungarian

C method
D id) All of the above
Answer d
Marks 1
Unit 1
Id 5
In Assignment Problem the variable of decision

Question variable is
A (a) Any positive value
B (b) One or zero
C (c) Two or one
D (d) Any value
Answer b
Marks 1
Unit 1
Id 6
An artificial source added to a transportation table

when total demand is greater than total supply is
Question called
A (a) Filler source
B (b) Dummy destination
C (c) Dummy source
D (d) Supply source
Answer c
Marks 1
Unit 1
Id 7
What is said to be present when total demand equals

Question total supply in a transportation problem?
A An equilibrium problem
B A harmonized problem
C A balanced problem
D All of the above
Answer c
1
Marks
Unit 1
Id 8
Which of the following statements is accurate with

Question regard to assignment problems?
A (a) A job can be assigned to more than one workman.

B (13) Only one workman can be assigned to each job.
C (c) A workman can be assigned to more than one job.
D (d) both a and c
Answer b
Marks 1
Unit 1
Id 9
Question The matrix of assignment problem is always a
A (a) Identity matrix
B (b) Rectangular matrix.
C (c) Transpose matrix.
D (d) Square matrix.
Answer d
Marks 1
Unit 1
Id 10
Which of the following accurately describes step of

the NWCM , after making the initial allocation of units
Question in the northwest cell?
A (a) Move down first, and then move right.
B (b) Move right first, and then move down.
(c) Move right or down first, depending on whether

the demand requirement or the supply capacity,
C respectively, is exhausted first.
D (id) Move diagonally first
Answer c
Marks 1
Unit 1
Id 11
In a transportation problem, units are allocated from

Question sources to destinations
A (a) At a maximum cost
B (b) At a minimum cost
C (c) At a minimum profit
D (d) At a minimum revenue
Answer b
Marks 1
Unit 1
Id 12
Question In an assignment. problem, in Row Reduction step.
(a) Subtract all the element from highest value of

A matrix
(b) Subtract smallest value of each row from its

B corresponding row element
(c) Subtract each value of a row from its largest value

C of that corresponding row.
(d) Subtract smallest value of each column from its

D corresponding column element
Answer c
Marks 1
Unit 1
Id 13
Which of the following is an assumption of
Question assignment problems?
(a) The number of assignees and the number of jobs

A are the same
(b) The objective is to minimize the number of

B assignments not made.
(e) Each job is to be performed by exactly one

C assignee.
D (d) a. and c. only.
Answer d
Marks 1
Unit 1
Id 14
Question In North-West Corner Rule, if the demand in the

column is satisfied one must move to the
A (a) Left cell in the next column,
B (b) Down cell in the next row
C (c) Right cell in the next column.
D (d) Left cell in the next row.
Answer c
Marks 1
Unit 1
Id 15
In transportation problem if total supply greater

Question than total demand we add . (if supply points are
along row wise)
A (a) Dummy row with cost, O.
B (b) Dummy column with cost 0.

C (c) Dummy row with cost 1.
D (d) Dummy column with cost 1.
Answer b
Marks 1
Unit 1
Id 16
When the problem involves the allocation of n

Question different facilities to n different tasks, it is often
termed as
A (a) Transportation problem
B (b) Assignment problem.
C (c) Queue problem
D (d) Facility planning
Answer b
Marks 1
Unit 1
Id 17
Question In an assignment problem
A (a) The number of rows and columns must be

equal.
B (b) The number of rows must equal or exceed the
number of columns.
C (c) The number of columns must equal or exceed
the number of rows.
D (d) The number of rows must exceed the number
of columns.
Answer a
Marks 1
Unit 1
Id 18
In North-West Corner Rule, if the supply in the
Question row is satisfied one must move (supply points are
along the row wise)
A Down in the next row,
B Next lowest cost cell
C Right cell in the next column.
D Left cell in the next row.
Answer a
Marks 1
Unit 1
Id 19
Question The Transportation problem is said to be balanced

if
A (a) Total supply is not equal to total demand.
B (b) Total supply is greater than total demand
C (c) Total supply is lesser than total demand,
D (d) Total supply is equal to total demand.
Answer d
Marks 1
Unit 1
Id 20
Question The two most common objectives for the

assignment problem are the minimization of
A (a) Total profit or inexperience
B (b) Total costs or inexperience
C (c) Total costs or total time
D (d) Total sales or inexperience
Answer c
Marks 1
Unit 1
Id 21
Question An assignment algorithm was developed by
A (a) Hungarian
B (b) Vogel's
C (c) Modi
D (d) Erlang
Answer a
Marks 1
Unit 1
Id 22
Question The Least cost method
A (A) Is used to find an initial feasible solution
B (b) Is used to find an optimal solution
C (c) Is based on the concept of minimizing

opportunity cost
D (d) None of the given
Answer c
Marks 1
Unit 1
Id 23
Question The North-West Corner Rule is used to find
A (a) An Initial feasible solution,
B (1) An optimal solution.

C (c) Non optimal solution.
D (d) None of these
Answer a
Marks 1
Unit 1
Id 24
Question The only restriction for the initial solution of a

transportation problem is that
A (a) Demand must equal supply.
B (b) All constraints must be satisfied.
C (c) Nonzero quantities in a majority of the cells.
D (d) Number of rows equal to number of columns
Answer a
Marks 1
Unit 1
Id 25
Question Which of the following is not a step in the

Hungarian method of assignment?
A (a) Find the opportunity-cost table
B (b) Draw horizontal and vertical line to cover all

zeros of opportunity- cost table
C (c) Enumerate all possible solutions
D (d) Revise the opportunity-cost table
Answer c
Marks 1
Unit 1
Id 26
Question Maximization case in transportation problem the
objective is to
A Maximize the total profit.
B Minimize the total loss .
C Neither maximize nor minimize,
D Optimal cost.
Answer a
Marks 1
Unit 1
Id 27
In a transportation problem, when number of

Question occupied cells is less than number of rows plus
number of columns we say that solution is
A (a) Feasible solution
B (b) Multiple solution
C (c) Degenerate solution
D (d) Unbalanced solution
Answer c
Marks 1
Unit 1
DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH
302: DECISION SCIENCE – MCQs
Q. no Question Answer
1. Decision Science approach is. A
a. Multi-disciplinary
b. Scientific
c. Intuitive
d. All of the above
2. For analyzing a problem, decision-makers should studyIts qualitative C
aspects
2. Its quantitative aspects
3. Both a & b
4. Neither a nor b
3. Decision variables are A
a) Controllable
b) Uncontrollable
c) Parameters
d) None of the above
4. A model is B
a) An essence of reality
b) An approximation
c) An idealization
d) All of the above
5. Managerial decisions are based on D
a. An evaluation of quantitative data
b. The use of qualitative factors+
c. Results generated by formal models
d. All of the above
6. The use of decision models C
a) Is possible when the variables value is known
b) Reduces the scope of judgement & intuition known withcertainty
in decision-making
c) Require the use of computer software
7. c
Prof. Iftekhar Khan www.dimr.edu.in

Every mathematical model

a. Must be deterministic
b. Requires computer aid for its solution
c. Represents data in numerical form
d. All of the above
8. A physical model is example of A

a. An iconic model
b. An analogue model
c. A verbal model
d. A mathematical model
9. An optimization model C
a. Provides the best decision
b. Provides decision within its limited context
c. Helps in evaluating various alternatives
d. All of the above
10. The quantitative approach to decision analysis is a C
a. Logical approach
b. Rational approach
c. Scientific approach
d. All of the above
11. The qualitative approach to decision analysis relies on D
a. Experience
b. Judgement
c. Intuition
d. All of the above
12. The mathematical model of an LP problem is important because A
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
13. Linear programming is a D

a. Constrained optimization technique
b. Technique for economic allocation of limited resources
c. Mathematical technique
d. All of the above
14. A constraint in an LP model restricts d

a. Value of objective function

b. Value of a decision variable
c. Use of the available resources
d. All of the above
15. The distinguishing feature of an LP model is A

a. Relationship among all variables is linear
b. It has single objective function & constraints
c. Value of decision variables is non-negative
d. All of the above
16. Constraints in an LP model represents D

a. Limitations
b. Requirements
c. Balancing limitations & requirements
d. All of the above
17. Non-negativity condition is an important component of LP model because B
a. Variables value should remain under the control of the decision-maker
b. Value of variables make sense & correspond to real-world problems
c. Variables are interrelated in terms of limited resources
d. None of the above
18. Before formulating a formal LP model, it is better to D
a. Express each constrain in words
b. Express the objective function in words
c. Verbally identify decision variables
d. All of the above
19. Maximization of objective function in an LP model means A
a. Value occurs at allowable set of decisions
b. Highest value is chosen among allowable decisions
c. Neither of above
d. Both a & b
20. Which of the following is not a characteristic of the LP model B
a. Alternative courses of action
b. An objective function of maximization type
c. Limited amount of resources
d. Non-negativity condition on the value of decision variables.
21. The best use of linear programming technique is to find an optimal use of d
a. Money
b. Manpower
c. Machine

d. All of the above

22. Which of the following is not a characteristic of the LP d
a. Resources must be limited
b. Only one objective function
c. Parameters value remains constant during the planning period
d. The problem must be of minimization type
23 Non-negativity condition in an LP model implies D
a. A positive coefficient of variables in objective function
b. A positive coefficient of variables in any constraint
c. Non-negative value of resources
24 Which of the following is an assumption of an LP model D
a. Divisibility
b. Proportionality
c. Additivity
d. All of the above
25 Which of the following is a limitation associated with an LP model D

a. The relationship among decision variables in linear
b. No guarantee to get integer valued solutions
c. No consideration of effect of time & uncertainty on LP model
d. All of the above
26 The graphical method of LP problem uses D
a. Objective function equation
b. Constraint equations
c. Linear equations
d. All of the above
27 A feasible solution to an LP problem A
a. Must satisfy all of the problem’s constraints simultaneously
b. Need not satisfy all of the constraints, only some of them
c. Must be a corner point of the feasible region
d. Must optimize the value of the objective function
28 Which of the following statements is true with respect to the optimal D
solution of an LP problem
a. Every LP problem has an optimal solution
b. Optimal solution of an LP problem always occurs at an extreme point
c. At optimal solution all resources are completely used
d. If an optimal solution exists, there will always be at least one at a corner
29 a

An iso-profit line represents

a. An infinite number of solutions all of which yield the same profit
b. An infinite number of solution all of which yield the same cost
c. An infinite number of optimal solutions
d. A boundary of the feasible region
30 If an iso-profit line yielding the optimal solution coincides with a constaint d
line, then
a. The solution is unbounded
b. The solution is infeasible
c. The constraint which coincides is redundant
31 While plotting constraints on a graph paper, terminal points on both the C
axes are connected by a straight line because
a. The resources are limited in supply
b. The objective function as a linear function
c. The constraints are linear equations or inequalities
d. All of the above
32 A constraint in an LP model becomes redundant because D
a. Two iso-profit line may be parallel to each other
b. The solution is unbounded
c. This constraint is not satisfied by the solution values
33 If two constraints do not intersect in the positive quadrant of the graph, A
then
a. The problem is infeasible
c. One of the constraints is redundant
34 Constraints in LP problem are called active if they A
a. Represent optimal solution
b. At optimality do not consume all the available resources
c. Both a & b
35 The solution space (region) of an LP problem is unbounded due to C
a. An incorrect formulation of the LP model
b. Objective function is unbounded
c. Neither a nor b
d. Both a & b
36 a

While solving a LP model graphically, the area bounded by the constraints is

called a. Feasible region
b. Infeasible region
c. Unbounded solution
37 37. Alternative solutions exist of an LP model when B

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
38 While solving a LP problem, infeasibility may be removed by c
a. Adding another constraint
b. Adding another variable
c. Removing a constraint
39 If a non-redundant constraint is removed from an LP problem then A
a. Feasible region will become larger
b. Feasible region will become smaller
c. Solution will become infeasible
40 If one of the constraint of an equation in an LP problem has an unbounded B
solution, then
a. Solution to such LP problem must be degenerate
b. Feasible region should have a line segment
c. Alternative solutions exist
41 The initial solution of a transportation problem can be obtained by applying B
any known method. However, the only condition is that a. The solution be
optimal
b. The rim conditions are satisfied
c. The solution not be degenerate
d. All of the above
42 The dummy source or destination in a transportation problem is added to A
a. Satisfy rim conditions
b. Prevent solution from becoming degenerate
c. Ensure that total cost does not exceed a limit
43 The occurrence of degeneracy while solving a transportation problem means b
that
a. Total supply equals total demand

b. The solution so obtained is not feasible

c. The few allocations become negative
44 An alternative optimal solution to a minimization transportation problem B
exists whenever opportunity cost corresponding to unused route of
transportation is:
a. Positive & greater than zero
b. Positive with at least one equal to zero
c. Negative with at least one equal to zero
45 One disadvantage of using North-West Corner rule to find initial solution to B
the transportation problem 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
46 The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ C
columns (destination) is feasible if number of positive allocations are
a. m+n
b. m*n
c. m+n-1
d. m+n+1
47 If an opportunity cost value is used for an unused cell to test optimality, it B
should be
a. Equal to zero
b. Most negative number
c. Most positive number
d. Any value
48 During an iteration while moving from one solution to the next, degeneracy C
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
49 The large negative opportunity cost value in an unused cell in a a
transportation table is chosen to improve the current solution because
a. It represents per unit cost reduction
b. It represents per unit cost improvement
c. It ensure no rim requirement violation


50 The smallest quantity is chosen at the corners of the closed path with c
negative sign to be assigned at unused cell because
a. It improve the total cost
b. It does not disturb rim conditions
c. It ensure feasible solution
d. All of the above
51 When total supply is equal to total demand in a transportation problem, the C
problem is said to be
a. Balanced
b. Unbalanced
c. Degenerate
52 Which of the following methods is used to verify the optimality of the A
current solution of the transportation problem a. Least cost method
b. Vogel’s approximation method
c. Modified distribution method
d. All of the above
53 The degeneracy in the transportation problem indicates that C
a. Dummy allocation(s) needs to be added
b. The problem has no feasible solution
c. The multiple optimal solution exist
d. a & b but not c
54 An assignment problem is considered as a particular case of a transportation D
problem because
a. The number of rows equals columns
b. All xij = 0 or 1
c. All rim conditions are 1
d. All of the above
55 An optimal assignment requires that the maximum number of lines that can d
be drawn through squares with zero opportunity cost be equal to the
number of a. Rows or columns
b. Rows & columns
c. Rows + columns – 1
56 While solving an assignment problem, an activity is assigned to a resource A
through a square with zero opportunity cost because the objective is to a.
Minimize total cost of assignment
b. Reduce the cost of assignment to zero
c. Reduce the cost of that particular assignment to zero
d. All of the above
57 The method used for solving an assignment problem is called c

a. Reduced matrix method

b. MODI method
c. Hungarian method
58 The purpose of a dummy row or column in an assignment problem is to A
a. Obtain balance between total activities & total resources
b. Prevent a solution from becoming degenerate
c. Provide a means of representing a dummy problem
59 Maximization assignment problem is transformed into a minimization C
problem by
a. Adding each entry in a column from the maximization value in that
column
b. Subtracting each entry in a column from the maximum value in that
column
c. Subtracting each entry in the table from the maximum value in that table
d. Any one of the above
60 If there were n workers & n jobs there would be A
a. n! solutions
b. (n-1)! solutions
c. (n!)n solutions
d. n solutions
61 An assignment problem can be solved by c
a. Simplex method
b. Transportation method
c. Both a & b
62 For a salesman who has to visit n cities which of the following are the ways D
of his tour plan a. n!
b. (n+1)!
c. (n-1)!
d. n
63 The assignment problem D
a. Requires that only one activity be assigned to each resource
b. Is a special case of transportation problem
c. Can be used to maximize resources
d. All of the above
64 An assignment problem is a special case of transportation problem, where b
a. Number of rows equals number of columns
b. All rim conditions are 1

c. Values of each decision variable is either 0 or 1

d. All of the above
65 Every basic feasible solution of a general assignment problem, having a B
square pay-off matrix of order, n should have assignments equal to a. 2n+1
b. 2n-1
c. m+n-1
d. m+n
66 To proceed with the MODI algorithm for solving an assignment problem, the C
number of dummy allocations need to be added are a. n
b. 2n
c. n-1
d. 2n-1
67 The Hungarian method for solving an assignment problem can also be used B
to solve
a. A transportation problem
b. A travelling salesman problem
c. A LP problem
d. Both a & b
68 An optimal solution of an assignment problem can be obtained only if D
a. Each row & column has only one zero element
b. Each row & column has at least one zero element
c. The data is arrangement in a square matrix
69 Customer behavior in which the customer moves from one queue to C
another in a multiple channel situation is a. Balking
b. Reneging
c. Jockeying
d. Altering
70 Which of the following characteristics apply to queuing system C

a. Customer population
b. Arrival process
c. Both a & b
d. Neither a nor b
71 Which of the following is not a key operating characteristics apply to D
queuing system a. Utilization factor
b. Percent idle time
c. Average time spent waiting in the system & queue
72 Priority queue discipline may be classified as c

a. Finite or infinite
b. Limited & unlimited
c. Pre-emptive or non-pre-emptive
d. All of the above
73 The calling population is assumed to be infinite when A
a. Arrivals are independent of each other
b. Capacity of the system is infinite
c. Service rate is faster than arrival rate
d. All of the above
74 Which of the cost estimates & performance measures are not used for D
economic analysis of a queuing system
a. Cost per server per unit of time
b. Cost per unit of time for a customer waiting in the system
c. Average number of customers in the system
d. Average waiting time of customers in the system
75 A calling population is considered to be infinite when B
a. All customers arrive at once
b. Arrivals are independent of each other
c. Arrivals are dependent upon each other
d. All of the above
76 The cost of providing service in a queuing system decreases with D
a. Decreased average waiting time in the queue
b. Decreased arrival rate
c. Increased arrival rate
77 Service mechanism in a queuing system is characterized by A
a. Server’s behavior
b. Customer’s behavior
c. Customers in the system
d. All of the above
78 Probabilities of occurrence of any state are D
a. Collectively exhaustive
b. Mutually exclusive
c. Representing one of the finite numbers of states of nature in the system
d. All of the above
79 In a matrix of transition probability, the probability values should add up to a
one in each a. Row
b. Column
c. Diagonal

d. All of the above

80 In a matrix of transition probability, the element aij where i=j is a C
a. Gain
b. Loss
c. Retention
81 In Markov analysis, state probabilities must A
a. Sum to one
b. Be less than one
c. Be greater than one
82 State transition probabilities in the Markov chain should A
a. Sum to 1
b. Be less than 1
c. Be greater than 1
83 If a matrix of transition probability is of the order n*n, then the number of A
equilibrium equations would be a. n
b. n-1
c. n+1
84 In the long run, the state probabilities become 0 & 1 C
a. In no case
b. In same cases
c. In all cases
d. Cannot say
85 While calculating equilibrium probabilities for a Markov process, it is B
assumed that
a. There is a single absorbing state
b. Transition probabilities do not change
c. There is a single non-absorbing state
86 The first-order Markov chain is generally used when A
a. Transition probabilities are fairly stable
b. Change in transition probabilities is random
c. No sufficient data are available
d. All of the above
87 A problem is classified as Markov chain provided d

a. There are finite number of possible states

b. States are collectively exhaustive & mutually exclusive

c. Long-run probabilities of being in a particular state will be constant over
time
d. All of the above
88 The transition matrix elements remain positive from one point to the next. c
This property is known as:
a. Steady-state property
b. Equilibrium property
c. Regular property
d. All of the above
89 Markov analysis is useful for: C
a. Predicting the state of the system at some future time
b. Calculating transition probabilities at some future time
c. All of the above
90 Which of the following is not one of the assumptions of Markov analysis: C
a. There are a limited number of possible states
b. A future state can be predicted from the preceding one
c. There are limited number of future periods
d. All of the above
91 An advantage of simulation as opposed to optimization is that D

a. Several options of measure of performance can be examined
b. Complex real-life problems can be studied
c. It is applicable in cases where there is an element of randomness in a
system d. All of the above
92 The purpose of using simulation technique is to D
a. Imitate a real-world situation
b. Understand properties & operating characteristics of complex real-life
problems
c. Reduce the cost of experiment on a model of real situation
d. All of the above
93 Which of the following is not the special purpose simulation language A
a. BASIC
b. GPSS
c. GASP
d. SIMSCRIPT
94 As simulation is not an analytical model, therefore the result of simulation c
must be viewed as
a. Unrealistic
b. Exact

c. Approximation
d. Simplified
95 While assigning random numbers in Monte Carlo simulation, it is B
a. Not necessary to assign the exact range of random number interval as the
probability
b. Necessary to develop a cumulative probability distribution
c. Necessary to assign the particular appropriate random numbers
d. All of the above
96 Analytical results are taken into consideration before a simulation study so C
as to
a. Identify suitable values of the system parameters
b. Determine the optimal decision
c. Identify suitable values of decision variables for the specific choices of
system parameters d. All of the above
97 Biased random sampling is made from among alternatives which have B
a. Equal probability
b. Unequal probability
c. Probability which do not sum to 1
98 Large complicated simulation models are appreciated because C
a. Their average costs are not well-defined
b. It is difficult to create the appropriate events
c. They may be expensive to write and use as an experimental device
d. All of the above
99 Simulation should not be applied in all cases because it D
a. Requires considerable talent for model building & extensive computer
programming efforts
b. Consumes much computer time
c. Provides at best approximate solution to problem
d. All of the above
100 Simulation is defined as d
a. A technique that uses computers
b. An approach for reproducing the processes by which events by chance &
changes are created in a computer
c. A procedure for testing & experimenting on models to answer what if ,
then so & so types of questions
d. All of the above
101 The general purpose system simulation language b
a. Requires programme writing
b. Does not require programme writing
c. Requires predefined coding forms

d. Needs a set of equations to describe a system

102 Special simulation languages are useful because they d
a. Reduce programme preparation time & cost
b. Have the capability to generate random variables
c. Require no prior programming knowledge
d. All of the above
103 Few causes of simulation analysis failure are d

a. Inadequate level of user participation
b. Inappropriate levels of detail
c. Incomplete mix of essential skills
d. All of the above
104 To make simulation more popular, we need to avoid d

a. Large cost over runs
b. Prolonged delays
c. User dissatisfaction with simulation results
d. All of the above
1. The application of OR techniques involves ......................... approach
a) Individual
b) Team
c) Critical
Answer- : (b)
2. Opportunity loss refers to
a) the expected value of a bad decision.
b) the expected loss from a bad decision.
c) the difference between the actual payoff and the optimal payoff.
d) the regret from not having made a decision.

Answer-:(c)
3. All of the following are steps in the decision-making process EXCEPT:
a) Define the problem
b) Compute the posterior probabilities
c) Identify possible outcomes
d) List payoffs
Answer-:(b)
4. 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) All of the above
Answer -: (d)
5. A good decision always implies that we
a) will obtain the best final results
b) have used appropriate quantitative analysis.
c) have followed a logical process.
d) have based the decision on all available appropriate information.
Answer-: (c) have followed a logical process.
6. Which of the following might be viewed as an "optimistic" decision criterion?
a) Hurwicz criterion
b) Maximin
c) Maximax
d) Minimax
Answer-:(c)
7. Decision alternatives
a) should be identified before decision criteria are established.
b) are limited to quantitative solutions
c) are evaluated as a part of the problem definition stage.
d) are best generated by brain-storming.
Answer-:(a)
8. The equally likely decision criterion is also known as
a) Bayes'.
b) Laplace.
c) minimax.
d) Hurwicz.
Answer-: (b)
9. Which of the following is a property of all linear programming problems?
a) alternate courses of action to choose from
b) minimization of some objective
c) a computer program
d) usage of graphs in the solution
Answer-:(a)
10. A point that satisfies all of a problem's constraints simultaneously is a(n)

a) maximum profit point.
b) corner point.
c) intersection of the profit line and a constraint.
Answer-: (d)
11. The first step in formulating an LP problem is
a) Graph the problem.
b) Understand the managerial problem being faced.
c) Identify the objective and the constraints.
d) Define the decision variables.
Answer-:(b) understand the managerial problem being faced.

12. LP theory states that the optimal solution to any problem will lie at
a) the origin.
b) a corner point of the feasible region.
c) the highest point of the feasible region.
d) the lowest point in the feasible region.
Answer-:(b)
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?
a) (40,48)
b) (120,0)
c) (180,120)
d) (30,36)
Answer-: (b)
14. Management science and operations research both involve
a) qualitative managerial skills.
b) quantitative approaches to decision making.
c) operational management skills.

d) scientific research as opposed to applications.
Answer-: (b)
15. Which of the following does not represent a factor a manager might considerwhen
employing linear programming for a production scheduling?
a) labor capacity
b) employee skill levels
c) warehouse limitations
d) none of the above
Answer-: (d) none of the above
16. The quantitative analysis approach requires
a) the manager's prior experience with a similar problem.

b) a relatively uncomplicated problem.
c) mathematical expressions for the relationships.
d) each of the above is true.
Answer-: (c)
17. In labor planning formulation, how would you write the constraint that there are only 10 full- time
tellers (labeled as T) available?
a) T + 10 > 0
b) T > 10
c) T ≤10
d) All of the above are correct ways.
Answer-:(c)
18. A type of linear programming problem that is used in marketing is called the
a) media selection problem.
b) Madison Avenue problem.
c) marketing allocation problem.
d) all of the above
Answer-: (a)
19. The maximization or minimization of a quantity is the
a) goal of management science.
b) decision for decision analysis.
c) constraint of operations research.
d) objective of linear programming.
Answer-: (d) objective of linear programming.

20. Decision variables
a) tell how much or how many of something to produce, invest, purchase, hire, etc.
b) represent the values of the constraints.
c) measure the objective function.
d) must exist for each constraint.
Answer-: (a)
21. Which of the following is a valid objective function for a linear programming problem?
a) Max 5xy
b) Min 4x + 3y + (2/3)z
c) Max 5x2+ 6y2
d) Min (x1 + x2)/x3

Answer-: (b)
22. Which of the following statements is NOT true?
a) A feasible solution satisfies all constraints.
b) An optimal solution satisfies all constraints.
c) An infeasible solution violates all constraints.
d) A feasible solution point does not have to lie on the boundary of the feasible region.
Answer-: (c)
23. A solution that satisfies all the constraints of a linear programming problem except thenon-
negativity constraints is called
a) optimal.
b) feasible.
c) infeasible.
d) semi-feasible.
Answer-: (c)
24. In converting a less-than-or-equal constraint for use in a simplex table, we must add
a) a surplus variable.
b) a slack variable.
c) an artificial variable.
d) both a surplus and a slack variable.
Answer-: (b)
25. Slack
a) Is the difference between the left and right sides of a constraint.
b) Is the amount by which the left side of a ≤ constraint is smaller than the right side.
c) Is the amount by which the left side of a ≥ constraint is larger than the right side.
d) Exists for each variable in a linear programming problem.
Answer-: (b)
26. Unboundedness is usually a sign that the LP problem
a) has finite multiple solutions.
b) is degenerate.
c) contains too many redundant constraints.
d) has been formulated improperly.
Answer-: (d)
27. To find the optimal solution to a linear programming problem using the graphical method
a) find the feasible point that is the farthest away from the origin.
b) find the feasible point that is at the highest location.
c) find the feasible point that is closest to the origin.
d) None of the alternatives is correct.
Answer-: (d)
28. Which of the following special cases does not require reformulation of the problem inorder to
obtain a solution?
a) alternate optimality
b) infeasibility
c) unboundedness
d) each case requires a reformulation.
Answer-: (a)
29. Whenever all the constraints in a linear program are expressed as equalities, thelinear
program is said to be written in
a) standard form.
b) bounded form.
c) feasible form.
d) alternative form.
Answer-: (a)
30. In applying Vogel's approximation method to a profit maximization problem, row andcolumn
penalties are determined by:
a) finding the largest unit cost in each row or column.
b) finding the smallest unit cost in each row or column.
c) finding the difference between the two lowest unit costs in each row and column.
d) finding the difference between the two highest unit costs in each row and column.
Answer-: (d)
31. The northwest corner rule requires that we start allocating units to shipping routes in the:
a) middle cell.
b) Lower right corner of the table.
c) Upper right corner of the table.
d) Upper left-hand corner of the table.
Answer-:(d)
32. In a transportation problem, when the number of occupied routes is less than the numberof rows
plus the number of columns -1, we say that the solution is:
a) Unbalanced.
b) Degenerate.
c) Infeasible.
d) Optimal.
Answer-: (c)
33. The only restriction can be placed on the initial solution of a transportation problem is that:
a) must have nonzero quantities in a majority of the boxes.
b) all constraints must be satisfied.
c) demand must equal supply.
d) must have a number (equal to the number of rows plus the number of columnsminus one)
of boxes which contain nonzero quantities.
Answer-: (b)
34. The table

represents a solution that is:
a) an initial solution.
b) Infeasible.
c) degenerate.
d) all of the above

Answer-: (c)
35. 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-: (d)
36. 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-:(a)
37. What is wrong with the following table?
a) The solution is infeasible.
b) The solution is degenerate.
c) The solution is unbounded.

d) Nothing is wrong.
Answer-: (a)
38. The solution presented in the following table is
a) infeasible
b) degenerate
c) unbounded
d) Optimal
Answer-:(d)
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
a) 40
b) 60
c) 80
d) 100
Answer-: (c)
40. 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-:(b)
41. Infeasibility means that the number of solutions to the linear programming modelsthat
satisfies all constraints is
a) at least 1.
b) 0.
c) an infinite number.
d) at least 2.
Answer-: (b)
42. The stepping-stone method requires that one or more artificially occupied cells with a flowof zero
be created in the transportation tableau when the number of occupied cells is fewer than
a) m + n − 2
b) m + n − 1
c) m + n
d) m + n + 1
Answer-: (b)
43. The per-unit change in the objective function associated with assigning flow to anunused arc in
the transportation simplex method is called the
a) net evaluation index.
b) degenerate value.
c) opportunity loss.
d) simplex multiplier.
Answer-: (a)
44. The difference between the transportation and assignment problems is that
a) total supply must equal total demand in the transportation problem
b) the number of origins must equal the number of destinations in thetransportation

problem
c) each supply and demand value is 1 in the assignment problem
d) there are many differences between the transportation and assignment problems
Answer-: (c)
45. An example of a heuristic is the
a) minimum-cost method.
b) stepping-stone method.
c) Hungarian method.
d) MODI method.
Answer-: (a)
46. A solution to a transportation problem that has less than m + n − 1 cells withpositive
allocations in the transportation table is
a) an optimal solution.
b) an initial feasible solution.
c) a minimum-cost solution.
d) a degenerate solution.
Answer-:(d)
47. Using the transportation simplex method, the optimal solution to the transportationproblem has
been found when
a) there is a shipment in every cell.
b) more than one stepping-stone path is available.
c) there is a tie for outgoing cell.
d) the net evaluation index for each unoccupied cell is ≥ 0.
Answer-: (d)
48. Identifying the outgoing arc in Phase II of the transportation simplex method isperformed using
the
a) minimum cost method.
b) MODI method.
c) stepping-stone method.
d) matrix reduction method.
Answer-: (c)
49. To use the transportation simplex method, a transportation problem that isunbalanced
requires the use of
a) artificial variables.
b) one or more transshipment nodes.
c) a dummy origin or destination.
d) matrix reduction.
Answer-: (c) a dummy origin or destination.
50. The problem which deals with the distribution of goods from several sources toseveral
destinations is the
a) maximal flow problem
b) transportation problem
c) assignment problem
d) shortest-route problem
Answer-: (b)
51. The parts of a network that represent the origins are
a) the capacities
b) the flows
c) the nodes
d) the arcs
Answer-: (c)
52. The optimal solution is found in an assignment matrix when the minimum number ofstraight lines
needed to cover all the zeros equals
a) (the number of agents) − 1.
b) (the number of agents).

c) (the number of agents) + 1.
d) (the number of agents) + (the number of tasks).
Answer-: (b)
53. 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 thedestinations.
d) minimize the cost of shipping products from several origins to severaldestinations.
Answer-: (d)
54. The MODI method is used to
a) identify an outgoing arc.
b) identify an incoming arc.
c) identify unoccupied cells.
d) identify an initial feasible solution.
Answer-:(b)
55. Which of the following is not true regarding the linear programming formulation ofa
transportation problem?
a) Costs appear only in the objective function.
b) The number of variables is (number of origins) × (number of destinations).
c) The number of constraints is (number of origins) × (number of destinations).
d) The constraints' left-hand side coefficients are either 0 or 1.
Answer-: (c)
56. In the general linear programming model of the assignment problem,

a) one agent can do parts of several tasks.
b) one task can be done by several agents.
c) each agent is assigned to its own best task.
d) one agent is assigned to one and only one task.
Answer-: (d)
57. Which of the following is not true regarding an LP model of the assignment problem? ]
a) Costs appear in the objective function only.
b) All constraints are of the ≥ form.
c) All constraint left-hand side coefficient values are 1.
d) All decision variable values are either 0 or 1.
Answer-: (b)
58. The assignment problem constraint x31 + x32 + x33 + x34 ≤ 2 means
a) agent 3 can be assigned to 2 tasks.
b) agent 2 can be assigned to 3 tasks.
c) a mixture of agents 1, 2, 3, and 4 will be assigned to tasks.
d) there is no feasible solution.
Answer-: (a)
59. The assignment problem is a special case of the
a) transportation problem.
b) transshipment problem.
c) maximal flow problem.
d) shortest-route problem.
Answer-: (a)
60. The field of management science
a) concentrates on the use of quantitative methods to assist in decision making.
b) approaches decision making rationally, with techniques based on the scientific method.
c) is another name for decision science and for operations research.
Answer-: (d)
61. 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-: (b)
a) the manager’s prior experience with a similar problem.
Answer-: (c)
63. 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-: (c)
64. A physical model that does not have the same physical appearance as the objectbeing
modeled is
a) an analog model.
b) an iconic model.
c) a mathematical model.
d) a qualitative model.
Answer-: (a)
Answer-: (b)
66. George Dantzig is important in the history of management science because he developed
a) the scientific management revolution.
b) World War II operations research teams.
c) the simplex method for linear programming.
d) powerful digital computers.
Answer-: (c)
67. A model that uses a system of symbols to represent a problem is called
a) mathematical.
b) iconic.
c) analog.
d) constrained.
Answer-: (a)
68. The number of units shipped from origin i to destination j is represented by
a) xij.
b) xji.
c) cij.
d) cji.
Answer- a)
69. Which of the following special cases does not require reformulation of the problem inorder to
obtain a solution?
b) infeasibility
c) unboundedness
Answer-: (a)
70. 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 willnot
change.
c) the right-hand-side values for which the dual prices will not change.
Answer-: (c)
71. The amount that the objective function coefficient of a decision variable would haveto
improve before that variable would have a positive value in the solution is the
a) dual price.
b) surplus variable.
c) reduced cost.
d) upper limit.
Answer-: (c)
72. 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 thevariable
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 ofthe
variable corresponding to the jth column of the A matrix is brought into thebasis.
d) the values of the decision variables.
Answer- : (c )
73. In the simplex method, a tableau is optimal only if all the cj – zj values are
a) zero or negative.
b) zero.
c) negative and nonzero.
d) positive and nonzero.
Answer- : (a )
74. For the basic feasible solution to remain optimal
a) all cj - zj values must remain  0.
b) no objective function coefficients are allowed to change.
c) the value of the objective function must not change.
Answer- : (a )
75. 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- : (a )
a) the axes
b) the flow
c) the nodes
d) the arrows
Answer- : (c )
a) xij.
b) xji.
c) cij.
d) cji.
Answer- : (a )
78. Slack
a) is the difference between the left and right sides of a constraint.
b) is the amount by which the left side of a < constraint is smaller than the rightside.
c) is the amount by which the left side of a > constraint is larger than the rightside.
d) exists for each variable in a linear programming problem.
Answer-: (b)
b) the number of origins must equal the number of destinations in thetransportation

problem
Answer- : (c )
80. The critical path
a) is any path that goes from the starting node to the completion node.
b) is a combination of all paths.
c) is the shortest path.
d) is the longest path.
Answer- : (d )
81. Operations research analysts do not
a) Predict future operations
b) Build more than one model
c) Collect relevant data
d) Recommend decision and accept
Answer- : (a )
82. Decision variables are
a) Controllable
b) Uncontrollable
c) Parameters
Answer- : (a )
83. A model is
b) An approximation
c) An idealization’
d) All of the above

Answer- :(d )
84. A physical model is an example of
a) An iconic model
b) An analogue model
c) A verbal model
d) A mathematical model
Answer- : (a )
85. Every mathematical model
a) Must be deterministic
b) Requires computer aid for solution.
c) Represents data in numerical form
d) All of the above
Answer- : (c )
86. Operations research approach is
a) Multi disciplinary
b) Scientific
c) Intuitive
d) All of the above
Answer- : (a )
87. In an assignment problem,

Answer- : (d )
88. An optimization model
a) Mathematically provides best decision
b) Provides decision with limited context
c) Helps in evaluating various alternatives constantly
d) All of the above
Answer- : (d )
89. Operations research is applied
a) Military
b) Business
c) Administration’
d) All of the above
Answer- : (d )
90. Operations Research techniques helps to find ...................... solution
a) Feasible
b) Non feasible
c) Optimal
d) Non optimal
Answer- : (c )
91. OR provides solution only if the elements are
a) Quantified
b) Qualified
c) Feasible
d) Optimal
Answer- : (a )
92 Theory is an important operations research technique to analyze the queuing
behaviour.
a) Waiting line
b) Net work
c) Decision
d) Simulation
Answer- : (a )
93 model involves all forms of diagrams
a) iconic
b) mathematical
c) analogue
d) schematic
Answer- : (a )
94 Is known as symbolic model
a) Iconic
b) Mathematical
c) Analogue
Answer- : (b )
95. A map indicates roads, highways, towns and the interrelationship is an ……model
a) Iconic
b) mathematical
c) analogue
Answer- : (c )
96. Constraints in an LP model represent
a) Limitations
b) Requirements
c) Balancing limitation
d) all of the above
Answer- : (d )
97. Linear programming is a
a) Constraint optimization technique
b) Technique for economic allocation of limited resources.
c) Mathematical technique
d) all of the above
Answer- : (d )
98. A constraint in an LP model restricts
a) Value of objective function
b) Value of decision variable
c) Use of available resource
d) all of the above
Answer- : (d )
99 ................ is an important Operations research technique to be used for determining
optimal allocation of limited resources to meet the given objectives.
a) Waiting line theory
b) Net work analysis
c) Decision analysis
d) Linear programming
Answer- : (d )
100. The best use of linear programming technique is to find an optimal use of
a) Money
b) Man power
c) Machine
d) all of the above
Answer- : (d )
101. Given the following table that presents the solution for a queuing problem witha
constant service rate, on the average, how many customers are in the system?
a) 0.893
b) 0.714
c) 1.607
d) 0.375
Answer-: (c)
102. 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?
a) 0.893 minutes
b) 0.321 minutes
c) 0.714 minutes
d) 1.607 minutes
Answer-: (b)
constant service rate, what percentage of available service time is actually used?
a) 0.217
b) 0.643
c) 0.321

Answer-: (d)
104. Which of the following is usually the most difficult cost to determine?
a) service cost
b) facility cost
c) calling cost
d) waiting cost
Answer-: (d)
constant service rate, the probability that the server is idle is
e) 0.217
f) 0.643
g) 0.286
h) 0.714
Answer-: (c)
106. Markov analysis is a technique that deals with the probabilities of future occurrences by
a) using Bayes' theorem.
b) analyzing presently known probabilities.
c) time series forecasting.
d) the maximal flow technique.
Answer-: (b)
107. Decision makers in queuing situations attempt to balance
i) operating characteristics against the arrival rate.
j) service levels against service cost.
k) the number of units in the system against the time in the system.
l) the service rate against the arrival rate.
Answer-: (b)
108. The manner in which units receive their service, such as FCFS, is the
m) queue discipline.
n) channel.
o) steady state.
p) operating characteristic.
Answer-: (a)
109. What queue discipline is assumed by the waiting line models presented in thetextbook?
q) first-come first-served.
r) last-in first-out.
s) shortest processing time first.
t) No discipline is assumed.
Answer-: (a)
110. In Markov analysis, we are concerned with the probability that the
u) state is part of a system.
v) system is in a particular state at a given time.
w) time has reached a steady state.

x) transition will occur.
Answer-: (b)
111. For a situation with weekly dining at either an Italian or Mexican restaurant,
a) the weekly visit is the trial and the restaurant is the state.
b) the weekly visit is the state and the restaurant is thetrial.
c) the weekly visit is the trend and the restaurant is the transition.
d) the weekly visit is the transition and the restaurant is thetrend.
Answer-: (a)
112. A transition probability describes
a) the probability of a success in repeated, independent trials.
b) the probability a system in a particular state now will be in a specific state nextperiod.
c) the probability of reaching an absorbing state.
Answer-: (b)
113. Performance measures dealing with the number of units in line and the timespent
waiting are called
y) queuing facts.
z) performance queues. aa)
system measures.
bb)operating characteristic.
Answer-: (d)
114. The probability of going from state 1 in period 2 to state 4 in period 3 is

a) p12
b) p23
c) p14
d) p43
Answer-: (c)
115. The probability that a system is in a particular state after a large number of periodsis
a) independent of the beginning state of the system.
b) dependent on the beginning state of the system.
c) equal to one half.
d) the same for every ending system.
Answer-: (a)
116. Analysis of a Markov process
a) describes future behavior of the system.
b) optimizes the system.
c) leads to higher order decision making.
d) All of the alternatives are true.
Answer-: (a)
117. If the probability of making a transition from a state is 0, then that state is called a(n)
a) steady state.
b) final state.
c) origin state.
d) absorbing state.
Answer-: d) absorbing state.

118. Absorbing state probabilities are the same as
a) steady state probabilities.
b) transition probabilities.
c) fundamental probabilities.
d) None of the alternatives is true.
Answer-: (d)
119. Markov analysis might be effectively used for
a) technology transfer studies.
b) university retention analysis.
c) accounts receivable analysis.
d) all of the above
Answer-: (d)
120. The following is not an assumption of Markov analysis.
a) There is an infinite number of possible states.
b) The probability of changing states remains the same over time.
c) (a) and (d)
d) We can predict any future state from the previous state and the matrix oftransition
probabilities.
Answer-:(c)
121. The total cost for a waiting line does NOT specifically depend on
cc) the cost of waiting.
dd) the cost of service.
ee) the number of units in the system.

ff) the cost of a lost customer.
Answer-: (d)
122. Markov analysis assumes that conditions are both
a) complementary and collectively exhaustive.
b) collectively dependent and complementary.
c) collectively dependent and mutually exclusive.
d) collectively exhaustive and mutually exclusive.
Answer-: (d)
123. Occasionally, a state is entered which will not allow going to another state in the future.
This is called
a) an equilibrium state.
b) stable mobility.
c) market saturation.
Answer-: (d)
e) using Bayes' theorem.
f) analyzing presently known probabilities.
g) time series forecasting.
h) the maximal flow technique.
Answer-: (b)
125. In Markov analysis, the likelihood that any system will change from one period tothe next is
revealed by the
a) identity matrix.
b) transition-elasticities.
c) matrix of state probabilities.
d) matrix of transition probabilities.
Answer-: (d)
126. The condition that a system can be in only one state at any point in time is known as
a) Transient state.
b) Absorbent condition.
c) Mutually exclusive condition.
d) Collectively exhaustive condition.
Answer-:(c)
127. At any period n, the state probabilities for the next period n+1 is given by thefollowing
formula:
a) n(n+1)=n(n)Pn
b) n(n+1)=n(0)P
c) n(n+1)=(n+1)P
d) n(n+1)=n(n)P
Answer-: (d) n(n+1)=n(n)P
128. If we decide to use Markov analysis to study the transfer of technology,
a) our study will be methodologically flawed.

b) our study will have only limited value because the Markov analysis tells us "what"will
happen, but not "why."
c) we can only study the transitions among three different technologies.
d) only constant changes in the matrix of transition probabilities can be handled inthe
simple model.
Answer-: (b)
129. The following data consists of a matrix of transition probabilities (P) of three competing
companies, the initial market share state 16_10.gif(1), and the equilibrium probability states.
Assume that each state represents a firm (Company 1, Company 2, and Company 3, respectively)
and the transition probabilities represent changes from one month to thenext.
The market share of Company 1 in the next period is
a) 0.10
b) 0.20
c) 0.42
d) 0.47
Answer-: (d)
130. Markov analysis assumes that the states are both and .
a) finite, recurrent
b) infinite, absorbing
c) generally inclusive, always independent
d) collectively exhaustive, mutually exclusive

Answer-: (d)
131. A simulation model uses the mathematical expressions and logical relationships ofthe
gg)real system.
hh)computer model.
ii) performance measures.
jj) estimated inferences.
Answer-: (a)
132. The determine(s) the equilibrium of a Markov process.
a) original state probabilities
b) state vector
c) transition matrix
d) fundamental matrix F
Answer-: (c)
133. 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-: (c)
134. 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-: (c)
135. 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-: (b)
136. 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-: (d)
137. Common features of simulations--generating values from probability distributions,

maintaining records, recording data and summarizing results--led to the developmentof
a) Excel and Lotus.
b) BASIC, FORTRAN, PASCAL, and C.
c) GPSS, SIMSCRIPT, SLAM, and Arena
d) LINDO and The Management Scientist
Answer-: (c)
138. 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-:( b)
Simulation
1. Simulation
a) does not guarantee optimality.
b) is flexible and does not require the assumptions of theoretical models.
c) allows testing of the system without affecting the real system.
Answer-: d) All of the alternatives are correct.
2. 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-: b) static simulation model.
3. 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.


4. 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-: c) verification.
5. 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-: a) parameters.
6. 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-: d) each number has an equal probability of being drawn.

7. The first step in simulation is to

a) set up possible courses of action for testing.
b) construct a numerical model.
c) validate the model.
d) define the problem.
Answer-: d) define the problem.
8. 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 transferable to other problems
Answer-: d) is not usually easily transferable to other problems
9. 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-: c) summing all the previous probabilities up to the current

value of the variable.
10. Which of the following statements is INCORRECT regarding the advantages ofsimulation?
a) Simulation is relatively easy to explain and understand.
b) Simulation guarantees an optimal solution.

c) Simulation models are flexible.
d) A simulation model provides a convenient experimental laboratory for the real system.
Answer-: b) Simulation guarantees an optimal solution.
11. 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-: b) run the simulation for many days many times, i.e., using
multiple sets of random numbers.
12. 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 answers to complex problems.
Answer-: b) increasing one's understanding of a problem.
13. 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-:a) develop cumulative probability distributions

14. To simulate is to try to the features, appearance, and characteristics of a real

system.
a) Develop
b) Analyze
c) Multiply
d) Duplicate
Answer-:d) Duplicate
15. 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-: a) operational gaming, Monte Carlo, systems simulation
16. Which of the following as an assumption of an LP model
a) Divisibility
b) Proportionality
c) Additively
d) all of the above
Answer- : d )
17. Most of the constraints in the linear programming problem are expressed as ……….
a) Equality
b) Inequality
c) Uncertain
d) all of the above
Answer- : b )
18. A feasible solution to a linear programming problem

a) Must satisfy all problem constraints simultaneously
b) Need not satisfy all constraints
c) Must be a corner point of the feasible region
d) Must optimize the value of the objective function
Answer- : a )
19. While plotting constraints on a graph paper, terminal points on both axes are connected bya
straight line because
a) The resources are limited in supply
b) The objective function is a linear function
c) The constraints are linear equations or in equalities
d) all of the above
Answer- : c )
20. Constraints 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)
Answer- : a )
21. 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- : c )
22. The graphical method of LP problem uses
a) Objective function equation

b) Constraint equation
c) Linear equations
d) All the above
Answer- : d
)
23. While solving LP problem graphically, the area bounded by the constraints is called
a) Feasible region
b) Infeasible region
c) Unbounded solution
Answer- : a
)
24. 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- : d
)
25. Which of the following may not be in a linear programming formulation?
a) <=.
b) >.
c) =.
d) All the above

Answer- : b
)
26. 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 )
27. A linear programming model does not contain which of the following components?
a) Data
b) Decisions
c) Constraints
d) A spread sheet
Answer- : d )
28. Straight lines shown in a linear programming graph indicates
a) Objective function
b) Constraints
c) Points
d) All the above
Answer- : b )
29. In linear programming problem if all constraints are less than or equal to, then the
feasible region is
a) Above lines
b) Below the lines
c) Unbounded

Answer- : b )
30 is a series of related activities which result in some product or services.
Network
transportation model
a) assignment
b) none of these
Answer- : a )
31. Any activity which does not consume either any resource or time is called
………..activity.
a) Predecessor
b) Successor
c) Dummy
d) End
Answer- : c )
32. 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 )
33. Activities that cannot be started until one or more of the other activities are completed, but
immediately succeed them are called ……activities
a) Predecessor
b) Successor
c) Dummy
d) End
Answer- : b )
34. An event which represents the beginning of more than one activity is known as
………..event.
a) Merge
b) Net
c) Burst
Answer- : c )
35. 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
Answer- : d )
36. 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- : a )
37. Constraint in LP problem are called active if they

Answer- : a )
38. While solving an LP problem, infeasibility may be removed by
Answer- : c )
39 ......... is that sequence of activities which determines the total

project time.
a) Net work
b) Critical path
c) Critical activities
Answer- : b )
40. Activities lying on the critical path are called………….
a) Net work
b) Critical path
Answer- : c )
41 models in which the input and output variables follow a probability distribution.
a) Iconic
b) mathematical
c) analogue
d) Deterministic model
Answer- : d )
42 Example of probabilistic model
a) Game theory
b) Charts
c) Graphs
d) All the above
Answer- : a )
43. 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 )
44 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- : b )
Decision Science
Multiple Choice Questions
1. The application of OR techniques involves ………… approach

a) Individual
b) Team
c) Critical
Answer- : (b)

Answer-:(c)

d) List payoffs
Answer-:(b)

d) All of the above
Answer -: (d)


b) Maximin
c) Maximax
d) Minimax
Answer-:(c)
Answer-:(a)

a) Bayes'.
b) Laplace.
c) minimax.
d) Hurwicz.
Answer-: (b)

Answer-:(a)

b) corner point.
Answer-: (d)

a) the origin.
Answer-:(b)
Maximize 12X + 10Y
Subject to:
4X + 3Y ch7 <= 480
2X + 3Y ch7 <= 360
all variables >= 0
a) (40,48)
b) (120,0)
c) (180,120)
d) (30,36)
Answer-: (b)
Answer-: (b)
15. Which of the following does not represent a factor a manager might consider when
a) labor capacity

Answer-: (c)
17. In labor planning formulation, how would you write the constraint that there are only 10 full-
time tellers (labeled as T) available?
a) T + 10 > 0
b) T > 10
c) T ≤10
Answer-:(c)
d) all of the above
Answer-: (a)


Answer-: (a)
a) Max 5xy
b) Min 4x + 3y + (2/3)z
c) Max 5x2+ 6y2
d) Min (x1 + x2)/x3
Answer-: (b)

Answer-: (c)
23. A solution that satisfies all the constraints of a linear programming problem except the non-
a) optimal.
b) feasible.
c) infeasible.
d) semi-feasible.
Answer-: (c)
Answer-: (b)
25. Slack
Answer-: (b)

b) is degenerate.
Answer-: (d)
Answer-: (d)
28. Which of the following special cases does not require reformulation of the problem in order
to obtain a solution?
b) infeasibility
c) unboundedness
Answer-: (a)
29. Whenever all the constraints in a linear program are expressed as equalities, the linear
a) standard form.
b) bounded form.
c) feasible form.
Answer-: (a)
30. In applying Vogel's approximation method to a profit maximization problem, row and column
Answer-: (d)
a) middle cell.
Answer-:(d)
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:
a) Unbalanced.
b) Degenerate.
c) Infeasible.
d) Optimal.
Answer-: (c)
d) must have a number (equal to the number of rows plus the number of columns minus
one) of boxes which contain nonzero quantities.
Answer-: (b)
34. The table
b) Infeasible.
c) degenerate.
d) all of the above
Answer-: (c)
a) MODI method
d) Hungarian method
Answer-: (d)
a) utility curve.
c) Laplace curve.
d) benefit curve.
Answer-:(a)

Answer-: (a)

a) infeasible
b) degenerate
c) unbounded
d) Optimal
Answer-:(d)
was obtained by Vogel's approximation. The difference between the objective function for this
solution and that for the optimal is
a) 40
b) 60
c) 80
d) 100
Answer-: (c)
c) MODI method
Answer-:(b)
41. Infeasibility means that the number of solutions to the linear programming models that
a) at least 1.
b) 0.
d) at least 2.
Answer-: (b)
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
a) m + n − 2
b) m + n − 1
c) m + n
d) m + n + 1
Answer-: (b)
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
Answer-: (a)
b) the number of origins must equal the number of destinations in the transportation
problem
Answer-: (c)

d) MODI method.
Answer-: (a)
46. A solution to a transportation problem that has less than m + n − 1 cells with positive
Answer-:(d)
47. Using the transportation simplex method, the optimal solution to the transportation problem
has been found when
Answer-: (d)
48. Identifying the outgoing arc in Phase II of the transportation simplex method is performed
using the
b) MODI method.
Answer-: (c)
49. To use the transportation simplex method, a transportation problem that is unbalanced
requires the use of
50. The problem which deals with the distribution of goods from several sources to several
destinations is the
Answer-: (b)

a) the capacities
b) the flows
c) the nodes
d) the arcs
Answer-: (c)
52. The optimal solution is found in an assignment matrix when the minimum number of straight
lines needed to cover all the zeros equals
Answer-: (b)

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-: (d)

Answer-:(b)
55. Which of the following is not true regarding the linear programming formulation of a
Answer-: (c)

Answer-: (d)
Answer-: (b)
Answer-: (a)

Answer-: (a)

Answer-: (d)

Answer-: (b)
Answer-: (c)

Answer-: (c)
64. A physical model that does not have the same physical appearance as the object being
modeled is
a) an analog model.
b) an iconic model.
Answer-: (a)

Answer-: (b)
Answer-: (c)

a) mathematical.
b) iconic.
c) analog.
d) constrained.
Answer-: (a)

a) xij.
b) xji.
c) cij.
d) cji.
Answer- a)
b) infeasibility
c) unboundedness
Answer-: (a)

b) the right-hand-side values for which the values of the decision variables will not
change.
Answer-: (c)
71. The amount that the objective function coefficient of a decision variable would have to
a) dual price.
c) reduced cost.
d) upper limit.
Answer-: (c)

b) the decrease in value of the objective function that will result if one unit of the variable
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.
Answer- : (c )
73. In the simplex method, a tableau is optimal only if all the c j – zj values are
b) zero.
Answer- : (a )

Answer- : (a )

Answer- : (a )

a) the axes
b) the flow
c) the nodes
d) the arrows
Answer- : (c )

a) xij.
b) xji.
c) cij.
d) cji.
Answer- : (a )
78. Slack
b) is the amount by which the left side of a < constraint is smaller than the right side.
c) is the amount by which the left side of a > constraint is larger than the right side.
Answer-: (b)
problem
Answer- : (c )
Answer- : (d )

Answer- : (a )

a) Controllable
b) Uncontrollable
c) Parameters
Answer- : (a )
83. A model is
b) An approximation
d) All of the above
Answer- :(d )

a) An iconic model
c) A verbal model
Answer- : (a )
d) All of the above
Answer- : (c )

b) Scientific
c) Intuitive
d) All of the above
Answer- : (a )

Answer- : (d )

d) All of the above
Answer- : (d )

a) Military
b) Business
d) All of the above
Answer- : (d )
90. Operations Research techniques helps to find ………..solution

a) Feasible
b) Non feasible
c) Optimal
d) Non optimal
Answer- : (c )

a) Quantified
b) Qualified
c) Feasible
d) Optimal
Answer- : (a )
92. ………. Theory is an important operations research technique to analyze the queuing
behaviour.
a) Waiting line
b) Net work
c) Decision
d) Simulation
Answer- : (a )
93. ………… model involves all forms of diagrams

a) iconic
b) mathematical
c) analogue
d) schematic
Answer- : (a )
94. . …. Is known as symbolic model

a) Iconic
b) Mathematical
c) Analogue
Answer- : (b )
a) Iconic
b) mathematical
c) analogue
Answer- : (c )

a) Limitations
b) Requirements
d) all of the above
Answer- : (d )

d) all of the above
Answer- : (d )

d) all of the above
Answer- : (d )
99. ……….. is an important Operations research technique to be used for determining

Answer- : (d )
a) Money
b) Man power
c) Machine
d) all of the above
Answer- : (d )
101. Given the following table that presents the solution for a queuing problem with a
a) 0.893
b) 0.714
c) 1.607
d) 0.375
Answer-: (c)
constant service rate, on the average, how many minutes does a customer spend in the
service facility?
a) 0.893 minutes
b) 0.321 minutes
c) 0.714 minutes
d) 1.607 minutes
Answer-: (b)
a) 0.217
b) 0.643
c) 0.321
Answer-: (d)
a) service cost
b) facility cost
c) calling cost
d) waiting cost
Answer-: (d)
e) 0.217
f) 0.643
g) 0.286
h) 0.714
Answer-: (c)
Answer-: (b)
Answer-: (b)
m)queue discipline.
n) channel.
o) steady state.
Answer-: (a)
109. What queue discipline is assumed by the waiting line models presented in the textbook?
Answer-: (a)
Answer-: (b)
b) the weekly visit is the state and the restaurant is the trial.
d) the weekly visit is the transition and the restaurant is the trend.
Answer-: (a)

b) the probability a system in a particular state now will be in a specific state next period.
Answer-: (b)
113. Performance measures dealing with the number of units in line and the time spent
waiting are called
y) queuing facts.
z) performance queues.
aa) system measures.
bb) operating characteristic.
Answer-: (d)

a) p12
b) p23
c) p14
d) p43
Answer-: (c)
115. The probability that a system is in a particular state after a large number of periods is
Answer-: (a)

Answer-: (a)
a) steady state.
b) final state.
c) origin state.
d) absorbing state.

Answer-: (d)

d) all of the above
Answer-: (d)

c) (a) and (d)
d) We can predict any future state from the previous state and the matrix of transition
probabilities.
Answer-:(c)
Answer-: (d)

Answer-: (d)
This is called
b) stable mobility.
Answer-: (d)
Answer-: (b)
125. In Markov analysis, the likelihood that any system will change from one period to the
next is revealed by the
a) identity matrix.
Answer-: (d)
a) Transient state.
Answer-:(c)
127. At any period n, the state probabilities for the next period n+1 is given by the following
formula:
a) n(n+1)=n(n)Pn
b) n(n+1)=n(0)P
c) n(n+1)=(n+1)P
d) n(n+1)=n(n)P

b) our study will have only limited value because the Markov analysis tells us "what" will
d) only constant changes in the matrix of transition probabilities can be handled in the
simple model.
Answer-: (b)
Assume that each state represents a firm (Company 1, Company 2, and Company 3,
respectively) and the transition probabilities represent changes from one month to the next.
a) 0.10
b) 0.20
c) 0.42
d) 0.47
Answer-: (d)
130. Markov analysis assumes that the states are both __________ and __________.
Answer-: (d)
131. A simulation model uses the mathematical expressions and logical relationships of the
gg) real system.
hh) computer model.
Answer-: (a)
132. The ________ determine(s) the equilibrium of a Markov process.

b) state vector
Answer-: (c)

Answer-: (c)

a) risk analysis.
Answer-: (c)

Answer-: (b)
136. 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-: (d)

maintaining records, recording data and summarizing results--led to the development of
a) Excel and Lotus.
Answer-: (c)

Answer-:( b)
Simulation
1. Simulation
2. 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

4. 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.
5. 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.
d) events.

b) if one number is, say, 10 units above the mean, the next number will be 10 units below
the mean.



Answer-: c) summing all the previous probabilities up to the current value of the variable.
10. Which of the following statements is INCORRECT regarding the advantages of simulation?

b) Run the simulation for many days many times, i.e., using multiple sets of random
numbers.
Answer-: b) run the simulation for many days many times, i.e., using multiple sets of random
numbers.

13. In assigning random numbers in a Monte Carlo simulation, it is important to ________.

14. To simulate is to try to __________ the features, appearance, and characteristics of a real
system.
a) Develop
b) Analyze
c) Multiply
d) Duplicate


a) Divisibility
b) Proportionality
c) Additively
d) all of the above
Answer- : d )
a) Equality
b) Inequality
c) Uncertain
d) all of the above
Answer- : b )

Answer- : a )
19. While plotting constraints on a graph paper, terminal points on both axes are connected by a
d) all of the above
Answer- : c )

Answer- : a )

d) Both (a) and (b)
Answer- : c )

c) Linear equations
d) All the above
Answer- : d )
a) Feasible region
Answer- : a )

Answer- : d )

a) <=.
b) >.
c) =.
d) All the above
Answer- : b )

Answer- : c )
a) Data
b) Decisions
c) Constraints
d) A spread sheet
Answer- : d )

b) Constraints
c) Points
d) All the above
Answer- : b )
feasible region is
a) Above lines
b) Below the lines
c) Unbounded
Answer- : b )
30. ……. 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 )
a) Predecessor
b) Successor
c) Dummy
d) End
Answer- : c )

a) Equality
b) Non equality
Answer- : c )
a) Predecessor
b) Successor
c) Dummy
d) End
Answer- : b )
………..event.
a) Merge
b) Net
c) Burst
Answer- : c )
Answer- : d )
……….activity.
a) Predecessor
b) Successor
c) Dummy
d) End
Answer- : a )

Answer- : a )

Answer- : c )
39. ….……..is that sequence of activities which determines the total project time.
a) Net work
b) Critical path
Answer- : b )

a) Net work
b) Critical path
Answer- : c )
41. ………..models in which the input and output variables follow a probability distribution.
a) Iconic
b) mathematical
c) analogue
Answer- : d )
42. ………. Example of probabilistic model

a) Game theory
b) Charts
c) Graphs
d) All the above
Answer- : a )

d) all of the above
Answer- : b )
44. . ………..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
d) Queuing theory
Answer- : b )
MULTIPLE CHOICE QUESTIONS
DECISION SCIENCE
1. Decision Science approach is

b. Scientific
c. Intuitive
d. All of the above
2. 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
a. Controllable
b. Uncontrollable
c. Parameters
4. A model is
a. An essence of reality
b. An approximation
c. An idealization
d. All of the above
5. Managerial decisions are based on
b. The use of qualitative factors
d. All of the above
6. 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. All of the above
8. A physical model is example of
a. An iconic model
c. A verbal model
d. All of the above
10. The quantitative approach to decision analysis is a
a. Logical approach
d. All of the above
11. The qualitative approach to decision analysis relies on
a. Experience
b. Judgement
c. Intuition
d. All of the above
12. The mathematical model of an LP problem is important because
a. It helps in converting the verbal description & numerical data into mathematical expression
d. All of the above
d. All of the above
15. The distinguishing feature of an LP model is
d. All of the above
16. Constraints in an LP model represents
a. Limitations
b. Requirements
d. All of the above
17. Non-negativity condition is an important component of LP model because
18. Before formulating a formal LP model, it is better to
d. All of the above
19. Maximization of objective function in an LP model means
c. Neither of above
d. Both a & b
20. Which of the following is not a characteristic of the LP model
a. Money
b. Manpower
c. Machine
d. All of the above
22. Which of the following is not a characteristic of the LP
23. Non-negativity condition in an LP model implies
24. Which of the following is an assumption of an LP model
a. Divisibility
b. Proportionality
c. Additivity
d. All of the above
25. Which of the following is a limitation associated with an LP model
d. All of the above
c. Linear equations
d. All of the above
27. A feasible solution to an LP problem
28. Which of the following statements is true with respect to the optimal solution of an LP problem
29. An iso-profit line represents
30. If an iso-profit line yielding the optimal solution coincides with a constaint line, then
31. While plotting constraints on a graph paper, terminal points on both the axes are connected by
a straight line because
d. All of the above
32. A constraint in an LP model becomes redundant because
c. Both a & b
35. The solution space (region) of an LP problem is unbounded due to
c. Neither a nor b
d. Both a & b
36. While solving a LP model graphically, the area bounded by the constraints is called
a. Feasible region
37. Alternative solutions exist of an LP model when
d. All of the above
38. While solving a LP problem, infeasibility may be removed by
d. Removing a variable
39. If a non-redundant constraint is removed from an LP problem then
40. If one of the constraint of an equation in an LP problem has an unbounded solution, then
41. The initial solution of a transportation problem can be obtained by applying any known method.
However, the only condition is that
a. The solution be optimal
d. All of the above
42. The dummy source or destination in a transportation problem is added to
43. The occurrence of degeneracy while solving a transportation problem means that
44. An alternative optimal solution to a minimization transportation problem exists whenever
opportunity cost corresponding to unused route of transportation is:
45. One disadvantage of using North-West Corner rule to find initial solution to the transportation
problem is that
d. All of the above
46. The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is
feasible if number of positive allocations are
a. m+n
b. m*n
c. m+n-1
d. m+n+1
47. If an opportunity cost value is used for an unused cell to test optimality, it should be
a. Equal to zero
d. Any value
48. During an iteration while moving from one solution to the next, degeneracy may occur when
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
49. The large negative opportunity cost value in an unused cell in a transportation table is chosen to
improve the current solution because
50. The smallest quantity is chosen at the corners of the closed path with negative sign to be
assigned at unused cell because
d. All of the above
51. When total supply is equal to total demand in a transportation problem, the problem is said to
be
a. Balanced
b. Unbalanced
c. Degenerate
52. Which of the following methods is used to verify the optimality of the current solution of the
transportation problem
a. Least cost method
d. All of the above
53. The degeneracy in the transportation problem indicates that
d. a & b but not c
54. An assignment problem is considered as a particular case of a transportation problem because
b. All xij = 0 or 1
d. All of the above
55. An optimal assignment requires that the maximum number of lines that can be drawn through
squares with zero opportunity cost be equal to the number of
a. Rows or columns
b. Rows & columns
56. While solving an assignment problem, an activity is assigned to a resource through a square with
zero opportunity cost because the objective is to
a. Minimize total cost of assignment
d. All of the above
57. The method used for solving an assignment problem is called
b. MODI method
c. Hungarian method
58. The purpose of a dummy row or column in an assignment problem is to
59. Maximization assignment problem is transformed into a minimization problem by
a. Adding each entry in a column from the maximization value in that column
b. Subtracting each entry in a column from the maximum value in that column
60. If there were n workers & n jobs there would be
a. n! solutions
b. (n-1)! solutions
c. (n!)n solutions
d. n solutions
61. An assignment problem can be solved by
a. Simplex method
c. Both a & b
62. For a salesman who has to visit n cities which of the following are the ways of his tour plan
a. n!
b. (n+1)!
c. (n-1)!
d. n
63. The assignment problem
d. All of the above
64. An assignment problem is a special case of transportation problem, where
d. All of the above
65. Every basic feasible solution of a general assignment problem, having a square pay-off matrix of
order, n should have assignments equal to
a. 2n+1
b. 2n-1
c. m+n-1
d. m+n
66. To proceed with the MODI algorithm for solving an assignment problem, the number of dummy
allocations need to be added are
a. n
b. 2n
c. n-1
d. 2n-1
67. The Hungarian method for solving an assignment problem can also be used to solve
c. A LP problem
d. Both a & b
68. An optimal solution of an assignment problem can be obtained only if
69. Customer behavior in which the customer moves from one queue to another in a multiple
channel situation is
a. Balking
b. Reneging
c. Jockeying
d. Altering
70. Which of the following characteristics apply to queuing system
b. Arrival process
c. Both a & b
d. Neither a nor b
71. Which of the following is not a key operating characteristics apply to queuing system
a. Utilization factor
72. Priority queue discipline may be classified as
d. All of the above
73. The calling population is assumed to be infinite when
d. All of the above
74. Which of the cost estimates & performance measures are not used for economic analysis of a
queuing system
75. A calling population is considered to be infinite when
d. All of the above
76. The cost of providing service in a queuing system decreases with
77. Service mechanism in a queuing system is characterized by
d. All of the above
78. Probabilities of occurrence of any state are
d. All of the above
79. In a matrix of transition probability, the probability values should add up to one in each
a. Row
b. Column
c. Diagonal
d. All of the above
80. In a matrix of transition probability, the element aij where i=j is a
a. Gain
b. Loss
c. Retention
81. In Markov analysis, state probabilities must
a. Sum to one
b. Be less than one
82. State transition probabilities in the Markov chain should
a. Sum to 1
b. Be less than 1
83. If a matrix of transition probability is of the order n*n, then the number of equilibrium
equations would be
a. n
b. n-1
c. n+1
84. In the long run, the state probabilities become 0 & 1
a. In no case
b. In same cases
c. In all cases
d. Cannot say
85. While calculating equilibrium probabilities for a Markov process, it is assumed that
86. The first-order Markov chain is generally used when
d. All of the above
87. A problem is classified as Markov chain provided
c. Long-run probabilities of being in a particular state will be constant over time
d. All of the above
88. The transition matrix elements remain positive from one point to the next. This property is
known as:
c. Regular property
d. All of the above
89. Markov analysis is useful for:
c. All of the above
90. Which of the following is not one of the assumptions of Markov analysis:
d. All of the above
91. An advantage of simulation as opposed to optimization is that
c. It is applicable in cases where there is an element of randomness in a system
d. All of the above
92. The purpose of using simulation technique is to
b. Understand properties & operating characteristics of complex real-life problems
d. All of the above
93. Which of the following is not the special purpose simulation language
a. BASIC
b. GPSS
c. GASP
d. SIMSCRIPT
94. As simulation is not an analytical model, therefore the result of simulation must be viewed as
a. Unrealistic
b. Exact
c. Approximation
d. Simplified
95. While assigning random numbers in Monte Carlo simulation, it is
a. Not necessary to assign the exact range of random number interval as the probability
d. All of the above
96. Analytical results are taken into consideration before a simulation study so as to
c. Identify suitable values of decision variables for the specific choices of system parameters
d. All of the above
97. Biased random sampling is made from among alternatives which have
98. Large complicated simulation models are appreciated because
d. All of the above
99. Simulation should not be applied in all cases because it
a. Requires considerable talent for model building & extensive computer programming efforts
d. All of the above
100. Simulation is defined as
b. An approach for reproducing the processes by which events by chance & changes are created
in a computer
c. A procedure for testing & experimenting on models to answer what if ___, then so & so ___
types of questions
d. All of the above
101. The general purpose system simulation language
102. Special simulation languages are useful because they
d. All of the above
103. Few causes of simulation analysis failure are
d. All of the above
104. To make simulation more popular, we need to avoid
b. Prolonged delays
d. All of the above
105. The important step required for simulation approach in solving a problem is to
a. Test & validate the model
b. Design the experiment
c. Conduct the experiment
d. All of the above
DECISION SCIENCE - ANSWER KEY
1 a 26 d 51 c 76 d 101 b
2 c 27 a 52 a 77 a 102 d
3 a 28 d 53 c 78 d 103 d
4 d 29 a 54 d 79 a 104 d
5 d 30 d 55 d 80 c 105 d
6 d 31 c 56 a 81 a
7 c 32 d 57 c 82 a
8 c 33 a 58 a 83 a
9 a 34 a 59 c 84 c
10 c 35 c 60 a 85 b
11 d 36 a 61 c 86 a
12 a 37 b 62 c 87 d
13 d 38 c 63 d 88 c
14 d 39 a 64 d 89 c
15 a 40 b 65 b 90 c
16 d 41 b 66 c 91 d
17 b 42 a 67 b 92 d
18 d 43 b 68 d 93 a
19 a 44 b 69 c 94 c
20 b 45 b 70 c 95 b
21 d 46 c 71 d 96 c
22 d 47 b 72 c 97 b
23 d 48 c 73 a 98 c
24 d 49 a 74 d 99 d
25 d 50 c 75 b 100 d
BCA
IV Sem
OPERATIONS RESEARCH

1. Operations Research (OR) , which is a very powerful tool for ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Research
b) Decision – Making
c) Operations
2. Who coined the term Operations Research?
a) J.F. McCloskey
b) F.N. Trefethen
c) P.F. Adams
d) Both A and B
3. The term Operations Research was coined in the year ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) 1950
b) 1940
c) 1978
d) 1960
4. This innovative science of Operations Research was discovered during ‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Civil War
b) World War I
c) World War II
d) Industrial Revolution
5. Operations Research was known as an ability to win a war without really going in to a ‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Battle field
b) Fighting
c) War
d) Both A and B
6. Who defined Operations Research as scientific method of providing executive departments with
a quantitative basis for decisions regarding the operations under their control?
a) Morse and Kimball (1946)
b) P.M.S. Blackett (1948)
c) E.L. Arnoff and M.J. Netzorg
7. Who defined Operations Research as scientific approach to problem solving for executive
management ?
a) E.L. Arnoff
b) P.M.S. Blackett
c) H.M. Wagner
8. Who defined Operations Research as an aid for the executive in marketing his decisions by
providing him with the quantitative information based on the scientific method of analysis ?
a) C. Kitte
b) H.M. Wagner
c) E.L. Arnoff
9. Operations Research has the characteristics the it is done by a team of ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Scientists
b) Mathematicians
c) Academics
d) All of the above
10. There is a great scope for ‐‐‐‐‐‐‐‐‐‐‐‐ working as a team to solve problems of defence by using the
Operations Research approach
a) Economists
b) Administrators
c) Statisticians and Technicians
d) All of the above
11. Operations Research emphasizes on the overall approach to the system. This charecteristics of
Operations Research is often referred as
a) System Orientation
b) System Approach
c) Interdisciplinary Team Approach
12. Operations Research cannot give perfect ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ to problems
a) Answers
b) Solutions
c) Both A and B
d) Decisions
13. Operations Research simply helps in improving the ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ of the solution but does not result
in a perfect solution.
a) Quality
b) Clarity
c) Look
14. Operations Research involves ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ attack of complex problems to arrive at the
optimum solution
a) Scientific
b) Systematic
c) Both A and B
d) Statistical

15. Operations Research uses models built by quantitative measurement of the variables concerning
a given problem and also derives a solution from the model using ‐‐‐‐‐‐‐‐‐‐‐‐‐ of the diversified
solution techniques
a) Two or more
b) One or more
c) Three or more
d) Only One
16. A solution may be extracted from a model either by
a) Conducting experiments on it
b) Mathematical analysis
c) Both A and B
d) Diversified Techniques
17. Operations Research uses models to help the management to determine its ‐‐‐‐‐‐‐‐‐‐‐
scientifically
a) Policies
b) Actions
c) Both A and B
18. Operations Research is a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Science
b) Art
c) Mathematics
d) Both A and B
19. What have been constructed for Operations Research problems and methods for solving the
models that are available in many cases?
a) Scientific Models
b) Algorithms
c) Mathematical Models
20. Which technique is used in finding a solution for optimizing a given objective, such as profit
maximization or cost minimization under certain constraints?
a) Quailing Theory
b) Waiting Line
c) Both A and B
d) Linear Programming
21. What aims at optimizing inventory levels?
a) Inventory Control
b) Inventory Capacity
c) Inventory Planning

22. What can be defined as a useful idle resource which has economic value eg; raw materials, spare
parts, finished items, etc?
a) Inventory Control
b) Inventory
c) Inventory Planning
23. Which theory concerns making sound decisions under conditions of certainity, risk and
uncertainty
a) Game Theory
b) Network Analysis
c) Decision Theory
24. Key concept under which technique are network of events and activities , resource allocation,
time and cost considerations, network paths and critical paths ?
a) Game Theory
b) Network Analysis
c) Decision Theory
25. Which technique is used to imitate an operation prior to actual performance ?
a) Simulation
b) Integrated Production Models
c) Inventory Control
d) Game Theory
26. What is concerned with the prediction of replacement costs and determination of the most
economic replacement policy ?
a) Search Theory
b) Theory of replacement
c) Probabilistic Programming
27. What refers to Linear Programming that includes an evaluation of relative risks and
uncertainties in various alternatives of choice for management decisions ?
a) Probabilistic Programming
b) Stochastic Programming
c) Both A and B
d) Linear Programming
28. What enables us to determine the earliest and the latest times for each of the events and
activities and thereby helps in the identification of the critical path?
a) Programme Evaluation
b) Review Technique (PERT)
c) Both A and B
d) Deployment of resources

29. Linear Programming technique is used to allocate scarce resources in an optimum manner in
problems of ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ ?
a) Schedule
b) Product Mix
c) Both A and B
d) Servicing Cost
30. Operations Research techniques helps the directing authority in optimum allocation of various
limited resources, such as ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Men and Machine
b) Money
c) Material and Time
d) All of the above
31. Operations Research study generally involves how many phases ?
a) Three
b) Four
c) Five
d) Two
32. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models involves the allocation of resources to activities in such a manner that some
measure of effectiveness is optimized.
a) Sequencing
b) Allocation Models
c) Queuing Theory
d) Decision Theory
33. Allocation problems can be solved by
a) Linear Programming Technique
b) Non – Linear Programming Technique
c) Both A and B
34. In ‐‐‐‐‐‐‐‐‐‐‐ models, everything is defined and the results are certain,
a) Deterministic Models
b) Probabilistic Models
c) Both A and B
35. In ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models there is risk and uncertainty
b) Probabilistic Models
c) Both A and B

36. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models are obtained by enlarging or reducing the size of the item
a) Iconic Models
b) Analogue Models
c) Symbolic Models
37. Operations Research attempts to find the best and ‐‐‐‐‐‐‐‐‐‐‐‐‐ solution to a problem
a) Optimum
b) Perfect
c) Degenerate
38. The word ‐‐‐‐‐‐‐‐‐‐‐‐‐ may be defined as some action that we apply to some problems or
hypothesis.
a) Research
b) Operation
c) Both A and B
39. The operations Research technique, specially used to determine the optimum strategy is
a) Decision Theory
b) Simulation
c) Game Theory
40. The operations Research technique which helps in minimizing total waiting and service costs is
a) Queuing Theory
b) Decision Theory
c) Both A and B
41. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ are the representation of reality
a) Models
b) Phases
c) Both A and B
42. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ are called mathematical models
a) Iconic Models
b) Analogue Models
c) Symbolic Models
43. It is not easy to make any modification or improvement in
a) Iconic Models
b) Analogue Models
c) Symbolic Models

44. In ‐‐‐‐‐‐‐‐‐‐ models one set of properties is used to represent another set of properties
a) Iconic Models
b) Analogue Models
c) Symbolic Models
45. Allocation Models are ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Iconic models
b) Analogue Models
c) Symbolic Models
46. Probabilistic models are also known as
b) Stochastic Models
c) Dynamic Models
d) Static Models
47. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models assumes that the values of the variables do not change with time during a
particular period
a) Static Models
b) Dynamic Models
c) Both A and B
48. A ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models considers time as one of the important variable
a) Static Models
b) Dynamic Models
c) Both A and B
49. Replacement Model is a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ model
a) Static Models
b) Dynamic Models
c) Both A and B
50. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ may be defined as a method of determining an optimum programme inter
dependent activities in view of available resources
a) Goal Programming
b) Linear Programming
c) Decision Making

51. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ are expressed is n the form of inequities or equations
a) Constraints
b) Objective Functions
c) Both A and B
52. The objective functions and constraints are linear relationship between ‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Variables
b) Constraints
c) Functions
d) All of the above
53. Assignment problem helps to find a maximum weight identical in nature in a weighted ‐‐‐‐‐‐‐‐‐‐‐‐
a) Tripartite graph
b) Bipartite graph
c) Partite graph
54. All the parameters in the linear programming model are assumed to be ‐‐‐‐‐‐‐‐‐‐‐‐
a) Variables
b) Constraints
c) Functions
55. The solution need not be in ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ numbers
a) Prime Number
b) Whole Number
c) Complex Number
56. Graphic method can be applied to solve a LPP when there are only ‐‐‐‐‐‐‐‐‐‐‐‐‐ variable
a) One
b) More than One
c) Two
d) Three
57. If the feasible region of a LPP is empty, the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Infeasible
b) Unbounded
c) Alternative
58. The variables whose coefficient vectors are unit vectors are called ‐‐‐‐‐‐‐‐‐‐‐‐
a) Unit Variables
b) Basic Variables
c) Non basic Variables

59. Any column or raw of a simplex table is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Vector
b) Key column
c) Key Raw
60. If there are ‘m’ original variables and ‘n’ introduced variables, then there will be ‐‐‐‐‐‐‐‐‐‐‐‐‐
columns in the simplex table
a) M + n
b) M – n
c) 3 +m + n
d) M + n – 1
61. A minimization problem can be converted into a maximization problem by changing the sign of
coefficients in the ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Constraints
b) Objective Functions
c) Both A and B
62. If in a LPP , the solution of a variable can be made infinity large without violating the constraints,
the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Infeasible
b) Unbounded
c) Alternative
63. In maximization cases , ‐‐‐‐‐‐‐‐‐‐‐‐‐ are assigned to the artificial variables as their coefficients in
the objective function
a) +m
b) –m
c) 0
64. In simplex method , we add ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ variables in the case of ‘=’
a) Slack Variable
b) Surplus Variable
c) Artificial Variable
65. In simplex method, if there is tie between a decision variable and a slack (or surplus) variable, ‐‐‐
‐‐‐‐‐‐‐‐‐‐‐‐‐‐ should be selected
a) Slack variable
b) Surplus variable
c) Decision variable
66. A BFS of a LPP is said to be ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ if at least one of the basic variable is zero
a) Degenerate
b) Non‐degenerate
c) Infeasible
d) Unbounded
67. In LPP, degeneracy occurs in ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ stages
a) One
b) Two
c) Three
d) Four
68. Every LPP is associated with another LPP is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Primal
b) Dual
c) Non‐linear programming
69. As for maximization in assignment problem, the objective is to maximize the ‐‐‐‐‐‐‐‐‐‐‐
a) Profit
b) optimization
c) cost
70. If there are more than one optimum solution for the decision variable the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Infeasible
b) Unbounded
c) Alternative
71. Dual of the dual is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Primal
b) Dual
c) Alternative
72. Operations Research approach is
a) Multi‐disciplinary
b) Scientific
c) Initiative
d) All of the above
73. For analyzing the problem , decision – makers should normally study
a) Its qualitative aspects
b) Its quantitative aspects
c) Both A and B
d) Neither A and B
a) Controllable
b) Uncontrollable
c) Parameters
75. The issue of decision models
a) Is possible when the variable’s value is
b) Reduces the scope of judgment and intuition known with certainty in decision making
c) Requires the knowledge of computer software use
76. ‐‐‐‐‐‐‐‐‐‐‐‐‐ is one of the fundamental combinatorial optimization problems.
a) Assignment problem
b) Transportation problem
c) Optimization Problem
a) Mathematically provides the best decision
b) Provides decision within its limited context
d) All of the above
a) Logical approach
b) Rational approach
c) Scientific approach
d) All of the above
79. Operations Research approach is typically based on the use of
a) Physical model
b) Mathematical model
c) Iconic model
d) Descriptive model
80. In a manufacturing process, who takes the decisions as to what quantities and which process or
processes are to be used so that the cost is minimum and profit is maximum?
a) Supervisor
b) Manufacturer
c) Producer
d) Production manager
81. Linear programming has been successfully applied in ‐‐‐‐‐‐‐‐‐‐‐
a) Agricultural
b) Industrial applications
c) Both A and B
d) Manufacturing

82. The term linearity implies ‐‐‐‐‐‐‐‐‐‐‐ among the relevant variables:
a) Straight line
b) Proportional relationships
c) Linear lines
d) Both A and B
83. Process refers to the combination of ‐‐‐‐‐‐‐‐‐‐‐‐ inputs to produce a particular output.
a) one or more
b) two or more
c) one
84. What has always been very important in the business and industrial world, particularly with
regard to problems concerning productions of commodities?
a) Linear Programming
b) Production
c) Decision – making
85. What are the main questions before a production manager?
a) Which commodity/ commodities to produce
b) In what quantities
c) By which process or processes
d) All of the above
86. Who pointed out that the businessman always studies his production function and his input
prices and substitutes one input for another till his costs become the minimum possible?
a) Alan Marshall
b) Alfred Marsh
c) Alfred Marshall
87. Who invented a method of formal calculations often termed as ?
a) A.V. Kantorovich
b) L.V. Kantorovich
c) T.S. Kantorovich
d) Alfred Marshall
88. Who developed Linear Programming for the purpose of scheduling the complicated
procurement activities of the United States Air Force?
a) George B. Dantzig
b) James B. Dantzig
c) George B. Dante
d) George V. Dantzig

89. This method of formal calculations often termed as Linear Programming was developed later in
which year?
a) 1947
b) 1988
c) 1957
d) 1944
90. What is being considered as one of the most versatile management tools?
a) Electronic Computers
b) Linear Programming
c) Computer Programming
91. LP is a major innovation since ‐‐‐‐‐‐‐‐‐‐‐‐ in the field of business decision – making, particularly
under conditions of certainty.
a) Industrial Revolution
b) World War I
c) World War II
d) French Revolution
92. The world ‘Linear’ means that the relationships are represented by ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Diagonal lines
b) Curved lines
c) Straight lines
d) Slanting lines
93. The world ‘ programming’ means taking decisions ‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Systematically
b) Rapidly
c) Slowly
d) Instantly
94. Who originally called it ‘ Programming of interdependent activities in a linear structure’ but later
shortened it to ‘ Linear Programming’ ?
a) Dantzig
b) Kantorovich
c) Marshall
95. LP can be applied in farm management problems is relates to the allocation of resources such as
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ , in such a way that is maximizes net revenue
a) Acreage
b) Labour
c) Water supply or working capital
d) All of the above

96. LP model is based on the assumptions of ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Proportionality
b) Additivity
c) Certainty
d) All of the above
97. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ assumption means the prior knowledge of all the coefficients in the objective
function, the coefficients of the constraints and the resource values.
a) Proportionality
b) Certainty
c) Finite choices
d) Continuity
98. Simple linear programming problem with ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ variables can be easily solved by the
graphical method.
a) One decision
b) Four decisions
c) Three decisions
d) Two decisions
99. Any solution to a LPP which satisfies the non‐ negativity restrictions of the LPP is called its ‐‐‐‐‐‐‐‐
a) Unbounded solution
b) Optimal solution
c) Feasible solution
d) Both A and B
100. Any feasible solution which optimizes (minimizes or maximizes) the objective function of the
LPP is called its ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Optimal solution
b) Non‐basic variables
c) Solution
d) Basic feasible solution
101. A non – degenerate basic feasible solution is the basic feasible solution which has exactly m
positive Xi (i=1,2,…,m), i.e., none of the basic variable is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Infinity
b) One
c) Zero
d) X
102. What is also defined as the non‐negative variables which are added in the LHS of the constraint
to convert the inequality ‘< ‘ into an equation?
a) Slack variables
b) Simplex algorithm
c) Key element

103. Which method is an iterative procedure for solving LPP in a finite number of steps ?
a) Simplex algorithm
b) Slack variable
c) M method
d) Simplex method
104. In simplex algorithm , which method is used to deal with the situation where an infeasible
starting basic solution is given?
a) Slack variable
b) Simplex method
c) M‐ method
105. How many methods are there to solve LPP?
a) Three
b) Two
c) Four
106. ‐‐‐‐‐‐‐‐‐‐‐‐ is another method to solve a given LPP involving some artificial variable ?
a) Big M method
b) Method of penalties
c) Two‐phase simplex method
107. Which variables are fictitious and cannot have any physical meaning ?
a) Optimal variable
b) Decision variable
c) Artificial variable
108. An objective function which states the determinants of the quantity to be either maximized or
minimized is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Feasible function
b) Optimal function
c) Criterion function
109. An assumption that implies that finite numbers of choices are available to a decision – maker
and the decision variables do not assume negative values is known as ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Certainty
b) Continuity
c) Finite choices

110. A set of values X1, X2,…Xn which satisfies the constraints of the LPP is called ‐‐‐‐‐‐‐‐‐‐‐‐
a) Solution
b) Variable
c) Linearity
111. A basic solution which also satisfies the condition in which all basic variables are non ‐negative
is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Basic feasible solution
b) Feasible solution
c) Optimal solution
112. All the constraints are expressed as equations and the right hand side of each constraint and all
variables are non‐negative is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Canonical variable
b) Canonical form
c) Canonical solution
d) Both A and B
113. An objective function is maximized when it is a ‐‐‐‐‐‐‐‐‐‐‐ function
a) Passive
b) Profit
c) Cost
114. LPP is exactly used in solving what kind of resource allocation problems?
a) Production planning and scheduling
b) Transportation
c) Sales and advertising
d) All of the above
115. Currently, LPP is used in solving a wide range of practical ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Business problems
b) Agricultural problems
c) Manufacturing problems
116. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ refers to the combination of one or more inputs to produce a particular output.
a) Solution
b) variable
c) Process
117. An optimum solution is considered the ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ among feasible solutions.
a) Worst
b) Best
c) Ineffective
118. Please state which statement is true.
(i) All linear programming problems may not have unique solutions
(ii) The artificial variable technique is not a device that does not get the starting basic feasible
solution.
a) Both (i) and( ii)
b) (ii) only
c) (i) only
d) Both are incorrect
119. Please state which statement is incorrect.
(i) Linear programming was first formulated by an English economist L.V. Kantorovich
(ii) LP is generally used in solving maximization or minimization problems subject to certain
assumptions.
a) (ii) only
b) (i) only
c) Both (i) and( ii)
d) Both are correct
120. ‐‐‐‐‐‐‐‐‐‐‐‐ which is a subclass of a linear programming problem (LPP)
a) Programming problem
b) Transportation problem
c) Computer problem
121. The solution of any transportation problem is obtained in how many stages?
a) Five
b) Four
c) Three
d) Two
122. An optimal solution is the ‐‐‐‐‐‐‐‐‐‐‐ stage of a solution obtained by improving the initial solution
a) Third
b) First
c) Second
d) Final
123. MODI method is used to obtain ‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Optimal solutions
b) Optimality test
c) Both A and B
d) Optimization
124. For solving an assignment problem, which method is used?
a) Hungarian
b) American
c) German
125. To make an unbalanced assignment problem balanced, what are added with all entries as
zeroes?
a) Dummy rows
b) Dummy columns
c) Both A and B
d) Dummy entries
126. Any set of non‐negative allocations (Xij>0) which satisfies the raw and column sum (rim
requirement )is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Linear programming
b) Basic feasible solution
c) Feasible solution
127. A feasible solution is called a basic feasible solution if the number of non‐negative allocations is
equal to ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) m‐n+1
b) m‐n‐1
c) m+n‐1
128. Any feasible solution to a transportation problem containing m origins and n destinations is
said to be ‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Independent
b) Degenerate
c) Non‐degenerate
d) Both A and B
129. A path formed by allowing horizontal and vertical lines and the entire corner cells of which are
occupied is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Occupied path
b) Open path
c) Closed path
130. Transportation algorithm can be used for minimizing the transportation cost of ‐‐‐‐‐‐‐‐‐‐‐‐ from
O origins and D destinations
a) Goods
b) Products
c) Items
131. If demand is lesser than supply then dummy demand node is added to make it a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Simple problem
b) Balanced problem
c) Transportation problem
132. Basic cells indicate positive values and non‐ basic cells have ‐‐‐‐‐‐‐‐‐‐‐ value for flow
a) Negative
b) Positive
c) One
d) zero
133. According to transportation problem number of basic cells will be exactly ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) m+n‐0
b) n+m‐1
c) m+n‐1
134. Before starting to solve the problem, it should be balanced. If not then make it balanced by ‐‐‐‐‐
‐‐‐‐‐‐ column incase demand is less than supply or by adding ‐‐‐‐‐‐‐‐‐‐‐‐ raw incase supply is less
than the demand
a) O,D
b) m,n
c) Horizontal, Vertical
d) Unshipped supply, Shortage
135. In which phase is optimization done and how does that phase also checks for optimality
conditions?
a) Phase II
b) Phase I
c) Phase II
136. Optimality conditions are expressed as ‐‐‐‐‐‐‐‐‐‐‐‐‐ incase all non‐basic cells?
a) Negligent costs
b) Advanced costs
c) Reduced costs
137. A ‐‐‐‐‐‐‐‐‐ has rows / column having non‐ basic cells for holding compensating (+ )or (‐) sign.
a) Cycle
b) Dead – end
c) Back track
138. After determining every basic cell with in this cycle, adjustment is obtained as minimum value
in basic cells . this is known as ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Adjustment amount
b) aa
c) Both A and B
d) Alternatives

139. Optimal solution is a feasible solution (not necessarily basic ) which minimizes the ‐‐‐‐‐‐‐‐‐‐
a) Time taken
b) Partial cost
c) Total cost
140. State which of the two statements is correct
(i) the cells in the transportation table can be classified in to occupied cells and unoccupied
cells
(ii) optimal solution is a feasible solution (not necessarily basic ) which maximizes the total cost
a) both (i) and (ii) are correct
b) Two only
c) One only
d) Both (i) and (ii) are incorrect
141. The allocated cells in the transportation table are called ‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Occupied cells
b) Empty cells
c) Both A and B
d) Unoccupied cells
142. VAM stands for ‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Vogeal’s Approximation Method
b) Vogel’s Approximate Method
c) Vangel’s Approximation Method
d) Vogel’s Approximation Method
143. Once the initial basic feasible solution has been computed , what is the next step in the
problem
a) VAM
b) Modified distribution method
c) Optimality test
144. One can find the initial basic feasible solution by using ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ ?
a) VAM
b) MODI
c) Optimality test
145. What do we apply in order to determine the optimum solution ?
a) LPP
b) VAM
c) MODI Method
146. In a TP , if the number of non‐negative independent allocation is ‐‐‐‐‐‐‐‐‐‐‐‐ than m+n‐1.
a) Equivalent
b) Greater
c) Less
147. A given TP is said to be unbalanced, if the total supply is not equal to the total ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Optimization
b) Demand
c) Cost
148. If the total supply is less than the total demand, a dummy source (row) is included in the cost
matrix with ‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Dummy Demand
b) Dummy Supply
c) Zero Cost
d) Both A and B
149. To find the optimal solution, we apply ‐‐‐‐‐‐‐‐‐‐
a) LPP
b) VAM
c) MODI Method
d) Rim
150. For maximization in TP , the objective is to maximize the total ‐‐‐‐‐‐‐‐‐‐
a) Solution
b) Profit Matrix
c) Profit

ANSWERS

1. b 2. d 3. b 4. c 5. d 6. a 7. c 8. a 9. a 10. d 11. d 12. c
13. a 14. c 15. b 16. c 17. c 18. d 19. c 20. d 21. c 22. b 23. c 24.b
25. a 26. b 27. c 28. c 29. c 30. d 31. a 32. b 33. c 34. a 35. b 36. a
37. a 38. b 39. b 40. a 41. a 42. c 43. c 44. a 45. c 46. b 47. a 48. b
49. b 50. b 51. a 52. a 53.b 54. b 55. b 56. c 57. a 58. b 59. a
60. 61. b 62. b 63. a 64. c 65. c 66. a 67. b 68. b 69. a 70. c 71.a
72. c 73. a 74. d 75. d 76. a 77. d 78. c 79. b 80. d 81. c 82. d 83.a
84. c 85. d 86. c 87. d 88. a 89. a 90. b 91. c 92. c 93. a 94. a 95.d
96. d 97. b 98. d 99. c 100. a 101. c 102. a 103. d 104. c 105. b 106. c 107.c
108. c 109. c 110. a 111. a 112. b 113. b 114. d 115. a 116. c 117. b 118. c 119.b
120. b 121. d 122.c 123. c 124. a 125. c 126. c 127. c 128. c 129. c 130. a 131.b
132. d 133. c 134. d 135. c 136. c 137. a 138. c 139. c 140. c 141. c 142. d 143.c
144. a 145. c 146. c 147. b 148. c 149. c 150. c

Operations Research
1. Operations Research approach is ______________.
multi-disciplinary
scientific
intuitive
collect essential data
Correct answer: (A)
multi-disciplinary
2. A feasible solution to a linear programming problem ______________.
must satisfy all the constraints of the problem simultaneously
need not satisfy all of the constraints, only some of them
must be a corner point of the feasible region.
must optimize the value of the objective function
Correct answer: (A)
must satisfy all the constraints of the problem simultaneously
3. If any value in XB column of final simplex table is negative, then the solution is ______________.
infeasible
infeasible
bounded
no solution
Correct answer: (B)
infeasible
4. For any primal problem and its dual______________.
optimal value of objective function is same

dual will have an optimal solution iff primal does too
primal will have an optimal solution iff dual does too
both primal and dual cannot be infeasible
Correct answer: (C)
primal will have an optimal solution iff dual does too
5. The difference between total float and head event slack is ______________
free float
independent float
interference float
linear float
Correct answer: (A)
free float
6. An optimal assignment requires that the maximum number of lines which can be drawn through squares with zero
opportunity cost should be equal to the number of ______________.
rows or columns
rows and columns.
rows+columns- 1
rows-columns.
Correct answer: (A)
rows or columns
7. To proceed with the Modified Distribution method algorithm for solving an transportation problem, the number of
dummy allocations need to be added are______________.
n-1
2n-1
n-2
Correct answer: (B)
n-1
8. Select the correct statement
EOQ is that quantity at which price paid by the buyer is minimum
If annual demand doubles with all other parameters remaining constant, the Economic Order Quantity is doubled
Total ordering cost equals holding cost
Stock out cost is never permitted
Correct answer: (C)
Total ordering cost equals holding cost
9. Service mechanism in a queuing system is characterized by ______________.
customers behavior
servers behavior
customers in the system
server in the system
Correct answer: (B)
servers behavior
10. The objective of network analysis is to______________.
minimize total project duration
minimize toal project cost
minimize production delays, interruption and conflicts
maximize total project duration
Correct answer: (A)
minimize total project duration
11. In program evaluation review technique network each activity time assume a beta distribution
because______________.
it is a unimodal distribution that provides information regarding the uncertainty of time estimates of activities
it has got finite non-negative error
it need not be symmetrical about model value
the project is progressing well
Correct answer: (A)
it is a unimodal distribution that provides information regarding the uncertainty of time estimates of activities
12. If there is no non-negative replacement ratio in solving a Linear Programming Problem then the solution is
______________.
feasible
bounded
unbounded
infinite
Correct answer: (C)
unbounded
13. The calling population is considered to be infinite when ______________.
all customers arrive at once
capacity of the system is infinite
service rate is faster than arrival rate
arrivals are independent of each other
Correct answer: (B)
14. In marking assignments, which of the following should be preferred?
Only row having single zero
Only column having single zero
Only row/column having single zero

Column having more than one zero
Correct answer: (C)
Only row/column having single zero
15. A petrol pump have one pump; Vehicles arrive at the petrol pump according to poison input process at average of 12
per hour. The service time follows exponential distribution with a mean of 4 minutes. The pumps are expected to be idle
for ______________.
3/5
4/5
5/3
6/5
Correct answer: (B)
4/5
16. If the order quantity (size of order) is increased, ______________
holding costs decrease and ordering costs increase
holding costs increase and ordering costs decrease
the total costs increase and then decrease
storage cost as well as stock-out cost increase
Correct answer: (B)
holding costs increase and ordering costs decrease
17. ______________ is a mathematical technique used to solve the problem of allocating limited resource among the
competing activities
Linear Programming problem
Assignment Problem
Replacement Problem
Non linear Programming Problem
Correct answer: (A)

Linear Programming problem
18. A mixed strategy game can be solved by ______________.
Simplex method
Hungarian method
Graphical method
Degeneracy
Correct answer: (C)
Graphical method
19. The activity cost corresponding to the crash time is called the ______________.
critical time
normal time
cost slope
crash cost
Correct answer: (D)
crash cost
20. A set of feasible solution to a Linear Programming Problem is ______________
convex
polygon
triangle
bold
Correct answer: (A)
Convex
21. In an Linear Programming Problem functions to be maximized or minimized are called ______________.
constraints
objective function
basic solution
feasible solution
Correct answer: (B)
objective function
22. If the primal problem has n constraints and m variables then the number of constraints in the dual problem is
______________.
mn
m+n
m-n
m/n
Correct answer: (A)
mn
23. The non basic variables are called ______________.
shadow cost
opportunity cost
slack variable
surplus variable
Correct answer: (A)
shadow cost
24. Key element is also known as ______________.
slack
surplus
artificial
pivot
Correct answer: (D)
pivot
25. The solution to a transportation problem with m-sources and n-destinations is feasible if the numbers of allocations are
______________.
m+n
mn
m-n
m+n-1
Correct answer: (D)
m+n-1
26. The allocation cells in the transportation table will be called ______________ cell
occupied
unoccupied
no
finite
Correct answer: (A)
occupied
27. To resolve degeneracy at the initial solution, a very small quantity is allocated in ______________ cell
occupied
unoccupied
no
finite
Correct answer: (B)
unoccupied
28. The assignment algorithm was developed by ______________ method.

HUNGARIAN
VOGELS
MODI
TRAVELING SALES MAN
Correct answer: (A)
HUNGARIAN
29. An assignment problem is a particular case of ______________.
transportation Problem
assignment Problem
travelling salesman problem
replacement Problem
Correct answer: (A)
transportation Problem
30. The coefficient of slack\surplus variables in the objective function are always assumed to be ______________.
-M
Correct answer: (A)
31. Using ______________ method, we can never have an unbounded solution
Simplex
Dual simplex
Big M
Modi
Correct answer: (B)
Dual simplex
32. The customers of high priority are given service over the low priority customers is ______________.
Pre emptive
FIFO
LIFO
SIRO
Correct answer: (A)
Pre emptive
33. A queuing system is said to be a ______________ when its operating characteristic are independent upon time
pure birth model
pure death model
transient state
steady state
Correct answer: (D)
steady state
34. An activity which does not consume neither any resource nor time is known as ______________.
predecessor activity
successor activity
dummy activity
activity
Correct answer: (C)
dummy activity
35. The difference between total and free float is ______________.

total
free
independent
interference
Correct answer: (D)
interference
36. The number of time estimates involved in Program Evaluation Review Technique problem is ______________.
Correct answer: (C)
37. The assignment problem is always a ______________matrix.
circle
square
rectangle
triangle
Correct answer: (B)
square
38. The slack variables indicate ______________.
excess resource available.
shortage of resource
nil resource
idle resource
Correct answer: (D)
idle resource
39. If the net evaluation corresponding to any non -basic variable is zero, it is an indication of the existence of an
______________.
initial basic feasible solution
optimum basic feasible solution
optimum solution.
alternate optimum solution.
Correct answer: (D)
alternate optimum solution.
40. Mathematical model of linear programming problem is important because ______________.
it helps in converting the verbal description and numerical data into mathematical expression
decision makers prefer to work with formal models
it captures the relevant relationship among decision factors
it enables the use of algebraic technique
Correct answer: (A)
it helps in converting the verbal description and numerical data into mathematical expression
41. While solving a linear programming problem infeasibility may be removed by ______________.
adding another constraint
adding another variable
removing a constraint
removing a variable
Correct answer: (C)
removing a constraint
42. The right hand side constant of a constraint in a primal problem appears in the corresponding dual as______________.
a coefficient in the objective function
a right hand side constant of a function
an input output coefficient a left hand side constraint
coefficient variable
Correct answer: (A)
a coefficient in the objective function
43. During iteration while moving from one solution to the next, degeneracy may occur when______________
the closed path indicates a diagonal move
two or more occupied cells are on the closed path but neither of them represents a corner of the path.
two or more occupied cells on the closed path with minus sign are tied for lowest circled value.
the closed path indicates a rectangle move.
Correct answer: (C)
two or more occupied cells on the closed path with minus sign are tied for lowest circled value.
44. Maximization assignment problem is transformed into a minimization problem by______________.
adding each entry in a column from the maximum value in that column
subtracting each entry in a column from the maximum value in that column
subtracting each entry in the table from the maximum value in that table
adding each entry in the table from the maximum value in that table
Correct answer: (C)
45. Priority queue discipline may be classified as______________.
pre-emptive or non-pre-emptive
limited
unlimited
finite
Correct answer: (C)
unlimited
46. Replace an item when______________.
average cost upto date is equal to the current maintenance cost
average cost upto date is greater than the current maintenance cost
average cost upto date is less than the current maintenance cost.
next year running cost in more than average cost of nth year
Correct answer: (A)
average cost upto date is equal to the current maintenance cost
47. In time cost trade off function analysis______________.
cost decreases linearly as time increases
cost increases linearly as time decreases
cost at normal time is zero
cost increases linearly as time increases
Correct answer: (A)
cost decreases linearly as time increases
48. The transportation problem deals with the transportation of ______________.
a single product from a source to several destinations
a single product from several sources to several destinations
a single product from several sources to a destination
a multi -product from several sources to several destinations
Correct answer: (A)
a single product from a source to several destinations
49. The minimum number of lines covering all zeros in a reduced cost matrix of order n can be ______________.
at the most n
at the least n
n-1
n+1
Correct answer: (A)
at the most n
50. For a 2.5% increase in order quantity (under fundamental EOQ problem) the total relevant cost would ______________
increase by 2.5%.
decrease by 2.5%.
increase by 0.25%.
decrease by 0.25%.
Correct answer: (A)
increase by 2.5%.
51. In the basic EOQ model, if the lead time increases from 2 to 4 days, the EOQ will ______________
double increase
remain constant
but not double
decrease by a factor of two
Correct answer: (B)
remain constant
52. When the sum of gains of one player is equal to the sum of losses to another player in a game, this situation is known
as ______________.
two-person game
two-person zero-sum game
zero-sum game
non-zero-sum game
Correct answer: (C)
zero-sum game
53. In the network, one activity may connect any ______________ nodes
Correct answer: (B)
54. Graphical method is also known as ______________.
Simplex Method
Dual Simplex Method
Big-M Method
Search-Approach Method
Correct answer: (D)
Search-Approach Method
55. If the given Linear Programming Problem is in its standard form then primal-dual pair is ______________.
symmetric
un symmetric
square
triangle
Correct answer: (B)
un symmetric
56. The method used to solve Linear Programming Problem without use of the artificial variable is called ______________.
Simplex Method
Big-M Method
Dual Simplex Method
Graphical Mehtod
Correct answer: (C)
Dual Simplex Method
57. When the total demand is equal to supply then the transportation problem is said to be ______________
balanced
unbalanced
maximization
minimization
Correct answer: (A)
balanced
58. For finding an optimum solution in transportation problem ______________ method is used.
Simplex
Big-M
Modi
Hungarian
Correct answer: (C)
Modi
59. Linear Programming Problem is a technique of finding the ______________.
optimal value
approximate value
initial value
infeasible value
Correct answer: (A)
optimal value
60. Any solution to a Linear Programming Problem which also satisfies the non- negative notifications of the problem has
______________.
solution
basic solution
basic feasible solution
feasible solution
Correct answer: (D)
feasible solution
61. Customers arrive at a box office window, being manned ny single individual, according to Poisson input process with
mean rate of 20 per hour, while the mean service time is 2 minutes. Which of the following is not true for this system?
E(n) = 2 customers
E(m) = 4/3 customers
E(v) = 6 minutes
E(w) = 16 minutes
Correct answer: (A)
E(n) = 2 customers
62. A game is said to be strictly determinable if______________.
maximin value equal to minimax value
maximin value is less than or equal to minimax value
maximin value is greater than or equal to minimax value
maximin value is not equal to minimax value
Correct answer: (A)
maximin value equal to minimax value

63. The irreducible minimum duration of the project is called ______________.
critical time
normal time
cost slope
crash duration
Correct answer: (D)
crash duration
64. The cost of a slack variable is ______________.
-1
Correct answer: (A)
65. Linear Programming Problem that can be solved by graphical method has ______________.
linear constraints
quadratic constraints
non linear constraints
bi-quadratic constraints
Correct answer: (A)
linear constraints
66. If one or more variable vanish then a basic solution to the system is called ______________.
non feasible region
feasible region
degenerate solution
basic solution
Correct answer: (C)
degenerate solution
67. ______________ method is an alternative method of solving a Linear Programming Problem involving artificial
variables
Simplex Method
Big-M Method
Dual Simplex Method
Graphical Mehtod
Correct answer: (B)
Big-M Method
68. The server utilization factor is also known as ______________
erlang distribution
poisson distribution
exponential distribution
traffic intensity
Correct answer: (D)
traffic intensity
69. In a transportation table, an ordered set of______________ or more cells is said to form a loop
Correct answer: (C)

4
70. A Linear Programming Problem have ______________ optimal solution
more than 1
more than 2
Correct answer: (C)
more than 1
71. An n-tuple of real numbers which satisfies the constraints of Linear Programming Problem is called ______________
solution
basic solution
feasible solution
Correct answer: (A)
solution
72. Chose the correct statement: A degenerate solution is one that______________.
gives an optimum solution to the Linear Programming Problem
gives zero value to one or more of the basic variables
yields more than one way to achieve the objective
makes use of all available resources
Correct answer: (B)
73. At any iteration of the usual simplex method, if there is at least one basic variable in the basis at zero level and all the
index numbers are non-negative, the current solution is ______________.
basic solution
non basic solution
degenerate
non degenerate
Correct answer: (C)
degenerate
74. The model in which only arrivals are counted and no departure takes place are called ______________.
pure birth model
pure death model
birth death model
death birth model
Correct answer: (A)
pure birth model
75. ______________ of a queuing system is the state where the probability of the number of customers in the system
depends upon time
pure birth model
pure death model
transient state
steady state
Correct answer: (D)
steady state
76. The initial event which has all outgoing arrows with no incoming arrow is numbered ______________.
-1
2
Correct answer: (A)
77. In a network diagram an event is denoted by the symbol ______________.
arrow
straight line
curve
circle
Correct answer: (D)
circle
78. An ______________ represent the start or completion of some activity and as such it consumes no time
activity
event
slack
path
Correct answer: (B)
event
79. ______________ is used for non-repetitive jobs
Queue
Replacement
CPM
PERT
Correct answer: (C)
CPM
80. The assignment problem will have alternate solutions when the total opportunity cost matrix has ______________
atleast one zero in each row and column
when all rows have two zeros
when there is a tie between zero opportunity cost cells
if two diagonal elements are zeros.
Correct answer: (C)
when there is a tie between zero opportunity cost cells
81. The region common to all the constraints including the non-negativity restrictions is called the ______________.
solution space
unique solution
optimum solution
infeasible solution
Correct answer: (A)
solution space
82. A activity in a network diagram is said to be ______________ if the delay in its start will further delay the project
completion time.
forward pass
backward pass
critical.
non-critical.
Correct answer: (C)
critical
83. Operation research approach is typically based on the use of ______________.
physical model.
mathematical model.
iconic model.
descriptive model.
Correct answer: (B)
mathematical model.
84. An Iso-profit line represents ______________.
a boundary of the feasible region
an infinite number of solution all of which yield the same cost
an infinite number of solutions all of which yield the same profit
an infinite number of optimal solutions
Correct answer: (C)
an infinite number of solutions all of which yield the same profit
85. If an artificial variable is present in the basic variable column of optimal simplex table, then the problem has
______________ solution.
alternative
no solution
bounded
infeasible
Correct answer: (D)
infeasible
86. The dummy source or destination in a transportation problem is added to ______________.
satisfy rim conditions
prevent solution from becoming degenerate
ensure that total cost does not exceed a limit
the solution not be degenerate
Correct answer: (A)
satisfy rim conditions

87. Which of the following methods is used to verify the optimality of the current solution of the transportation
problem______________.
Least cost method
Vogel's Approximation method
Row minima method
Modified Distribution method
Correct answer: (D)
Modified Distribution method
88. For a salesman who has to visit n cities, following are the ways of his tour plan ______________.
n!
(n+a)!
(n-a)!
Correct answer: (C)
(n-a)!
89. Economic order quantity results in ______________
equalisation of carrying cost and procurement cost
favourable procurement price
reduced chances of stock outs
minimization of set up cost
Correct answer: (A)
equalisation of carrying cost and procurement cost
90. The problem of replacement is felt when job performing units fail ______________.
suddenly and gradually

gradually
suddenly
neither gradually nor suddenly
Correct answer: (A)
suddenly and gradually
91. Float analysis is useful for ______________.
total float
free float
independent float
variance of each float
Correct answer: (B)
free float
92. The difference between free float and tail event slack is ______________
total float
independent float
interference float
slack
Correct answer: (B)
independent float
93. The assignment problem is a special case of transportation problem in which ______________.
number of origins are less than the number of destinations
number of origins are greater than the number of destinations
number of origins are greater than or equal to the number of destinations
number of origins equals the number of destinations
Correct answer: (D)

number of origins equals the number of destinations
94. The average arrival rate in a single server queuing system is 10 customers per hour and average service rate is 15
customers per hour. The average time that a customer must wait before it is taken up for service shall be
______________minutes.
10
12
Correct answer: (B)
95. The time between the placement of an order and its delivery is called as ______________
buffer time
lead time
Economic Order Quantity
capital time
Correct answer: (B)
lead time
96. In Program Evaluation Review Technique the maximum time that is required to perform the activity under extremely
bad conditions is known as ______________.
normal time
optimistic time
most likely time
pessimistic time
Correct answer: (D)
pessimistic time
97. All of the following may be used to find the EOQ except ______________.
optimal number of days supply to order
number of orders which minimize ordering costs optimal
number of rupees per order optimal
number of orders per year
Correct answer: (D)
number of orders per year
98. A feasible solution of an Linear Programming Problem that optimizes the objective function is called ______________
optimum solution
feasible solution
solution
Correct answer: (B)
optimum solution
99. Charnes method of penalty is called ______________
Simplex Method
Dual Simplex Method
Big-M Method
Graphical Method
Correct answer: (C)
Big-M Method
100. If the given Linear Programming Problem is in its canonical form then primal-dual pair is ______________.
symmetric
un symmetric
square
non square
Correct answer: (B)
un symmetric
101. All the basis for a transportation problem is ______________.
square
rectangle
diagonal
triangle
Correct answer: (D)
triangle
102. In the transportation table, empty cells will be called ______________.
occupied
unoccupied
no
finite
Correct answer: (B)
unoccupied
103. ______________ is a completely degenerate form of a transportation problem
Transportation Problem
Assignment Problem
Travelling salesman problem
Replacement Problem
Correct answer: (B)
Assignment Problem
104. The linear function to be maximized or minimized is called ______________ function.

injective
surjective
bijective
optimal
Correct answer: (D)
optimal
105. The coefficient of an artificial variable in the objective function of penalty method are always assumed to be
______________.
-M
Correct answer: (D)
-M
106. The process that performs the services to the customer is known as ______________.
queue
service channel
customers
server
Correct answer: (B)
service channel
107. A queuing system is said to be a ______________ when its operating characteristic are dependent upon time
pure birth model
pure death model
transient state
steady state
Correct answer: (C)
transient state
108. Slack is also known as ______________.
float
event
activity
path
Correct answer: (A)
float
109. What type of distribution does a time follow in program evaluation review technique model?
Poisson
Exponential
Normal
Chi Square
Correct answer: (C)
Normal
110. A activity in a network diagram is said to be ______________ if the delay in its start will further delay the project
completion time.
critical
critical path
crash
non critical
Correct answer: (A)
Critical
111. The total opportunity cost matrix is obtained by doing ______________.
row operation on row opportunity cost matrix
column operation on row opportunity cost matrix
column operation on column opportunity cost matrix
none of the above.
Correct answer: (B)
column operation on row opportunity cost matrix
112. The simplex method is also called the ______________.
dual simplex method.
Modi method
simplex technique
Big-M method
Correct answer: (C)
simplex technique
113. A degenerate solution is one that ______________.
gives an optimum solution to the Linear Programming Problem
yields more than one way to achieve the objective
makes use of all the available resources
Correct answer: (B)
114. Graphical method of linear programming is useful when the number of decision variable are ______________.
2
3
Correct answer: (B)
115. In the optimal simplex table, Zj-Cj=0 value indicates ______________.
alternative solution
bounded solution
infeasible solution
unbounded solution
Correct answer: (A)
116. If primal linear programming problem has a finite solution, then dual linear programming problem should
______________.
have optimal solution
satisfy the Rim condition
have degenerate solution
have non-degenerate solution
Correct answer: (B)
satisfy the Rim condition
117. While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity
cost because the objective is to______________.
minimize total cost of assignment.
reduce the cost of assignment to zero
reduce the cost of that particular assignment to zero
reduce total cost of assignment
Correct answer: (A)

minimize total cost of assignment.
118. If the procurement cost used in the formula to compute EOQ is half of the actual procurement cost, the EOQ so
obtained will be ______________
half of EOQ
one third of EOQ
one fourth of EOQ
0.707 time EOQ
Correct answer: (D)
0.707 time EOQ
119. The calling population is assumed to be infinite when ______________.
service rate is faster than arrival rate
all customers arrive at once
Correct answer: (B)
120. If an activity has zero slack, it implies that______________.
the project is progressing well
it is a dummy activity
it lies on the critical path
it lies a non critical path
Correct answer: (C)
it lies on the critical path
121. The transportation problem is balanced, if ______________.

total demand and total supply are equal and the number of sources equals the number of destinations.
none of the routes is prohibited
total demand equals total supply irrespective of the number of sources and destinations
number of sources matches with number of destinations
Correct answer: (C)
total demand equals total supply irrespective of the number of sources and destinations
122. In an assignment problem involving 5 workers and 5 jobs, total number of assignments possible are ______________.
10
15
20
Correct answer: (A)
123. All of the following are assumptions of the EOQ model except ______________
the usage rate is reasonably constant
replenishment is not instantaneous
only one product is involved
there are no quantity discount price
Correct answer: (B)
replenishment is not instantaneous
124. Average number of trains spent in the yard is denoted by ______________.
E(n)
E(m)
E(v)
E(w)
Correct answer: (C)
E(v)
125. Graphical method of linear programming is useful when the number of decision variable are ______________
Correct answer: (A)
126. The cost of a surplus variable is ______________.
-1
Correct answer: (A)
127. The dual of the dual is ______________.
dual-primal
primal-dual
dual
primal
Correct answer: (D)
primal
128. Solution of a Linear Programming Problem when permitted to be infinitely large is called ______________.
unbounded
bounded
optimum solution
no solution
Correct answer: (C)
optimum solution
129. When the total demand is not equal to supply then it is said to be ______________.
balanced
unbalanced
maximization
minimization
Correct answer: (B)
unbalanced
130. All equality constraints can be replaced equivalently by ______________ inequalities
Correct answer: (B)
131. If the primal has an unbound objective function value then the dual has ______________.
solution
basic solution
no feasible solution
Correct answer: (D)
no feasible solution
132. If there is no non-negative replacement ratio in a solution which is sought to be improved, then the solution is
______________.
bounded
unbounded
no solution
Correct answer: (B)
unbounded
133. An activity is represented by a/an ______________.
arrow
straight line
curve
arc
Correct answer: (A)
arrow
134. A project consists of a number of tasks which are called ______________.
activities
floats
events
paths
Correct answer: (A)
activities
135. The similarity between assignment problem and transportation problem is ______________.
both are rectangular matrices
both are square matrices
both can be solved y graphical method
both have objective function and non-negativity constraints
Correct answer: (D)
both have objective function and non-negativity constraints
136. The penalty for not taking correct decision is known as ______________.
fine
loss
cost
opportunity cost
Correct answer: (D)
opportunity cost
137. In a given system of m simultaneous linear equations in n unknowns (m<n) there will be ______________.
n basic variables
m basic variables
(n-m) basic variables
(n+m) basic variables
Correct answer: (B)
m basic variables
138. If all aij values in the entering variable column of the simplex table are negative, then ______________.
solution is unbounded
solution is degenerate
there exist no solution
there are multiple solutions

Correct answer: (A)
solution is unbounded
139. An unoccupied cell in the transportation method is analogous to a______________.
Zj-Cj value in the simplex table.
variable in the B-column in the simplex table.
variable not in the B-column in the simplex table.
value in the XB column in the simplex table.
Correct answer: (B)
variable in the B-column in the simplex table.
140. Every basic feasible solution of a general assignment problem having a square pay-off matrix of order n should have
assignments equal to______________.
2n-1
n+1
n-2
Correct answer: (A)
2n-1
141. Which of the following is correct?
Re-order quantity in a fixed order-interval system equals EOQ
Review period of the item is always kept higher than its lead time
Re-order level of an item is always more than its minimum stock
Buffer stock is the total stock kept to meet the demand during lead time
Correct answer: (C)
Re-order level of an item is always more than its minimum stock

142. The group replacement policy is suitable for identical low cost items which are likely to ______________.
fail suddenly
fail completely and suddenly
fail over a period of time
be progressive and retrogressive
Correct answer: (C)
fail over a period of time
143. Identify the correct statement
an assignment problem may require the introduction of both dummy row and dummy column
an assignment problem with m rows and n columns will involves a total of m x n possible assignments
an unbalanced assignment is one where the number of rows is more than, or less than the number of columns
balancing any unbalanced assignment problem involves adding one dummy row or column
Correct answer: (C)
an unbalanced assignment is one where the number of rows is more than, or less than the number of columns
144. A game is said to be fair if ______________.
lower and upper values are zero
only lower value to be zero
only upper value to be zero
lower and upper values are not equal to zero
Correct answer: (A)
lower and upper values are zero
145. Which of the following is not a part of holding (or carrying) costs?
Rent for storage space
Extra expenses for an overnight express mail.
Spoilage costs
Electricity and heat for the buildings
Correct answer: (B)
Extra expenses for an overnight express mail.
146. The area bounded by all the given constraints is called ______________.
feasible region
basic solution
non feasible region
optimum basic feasible solution
Correct answer: (A)
feasible region
147. When D=18000, holding cost=Rs.1.20, set-up cost=Rs.400 ,EOQ = ______________
3465
3750
3500
4000
Correct answer: (A)
3465
148. Given arrival rate = 15/hr, service rate = 20/hr, the value of traffic intensity is ______________.
3/4
4/3
3/5
4/5
Correct answer: (A)
3/4
149. An activity is critical if its ______________ float is zero
total
free
independent
interference
Correct answer: (A)
total
150. ______________ is employed in construction and business problems
Queue
Replacement
CPM
PERT
Correct answer: (D)
PERT
151. __________ occurs when the number of occupied squares is less than the number of rows plus
Degeneracy
Infeasibility
Unboundedness
Unbalance
Redundancy
Correct answer: (A)
Degeneracy
152. __________ or __________ are used to "balance" an assignment or transportation problem.
Destinations; sources
Units supplied; units demanded

Dummy rows; dummy columns
Large cost coefficients; small cost coefficients
Artificial cells; degenerate cells
Correct answer: (C)
Dummy rows; dummy columns
153. A solution can be extracted from a model either by
Conducting experiments on it
Mathematical analysis
Both A and B
Diversified Techniques
Correct answer: (C)
Both A and B
154. An alternative optimal solution to a minimization transportation problem exists whenever opportunity cost
corresponding to unused route of transportation is:
Positive & greater than zero
Positive with at least one equal to zero
Negative with at least one equal to zero
None of the above
Correct answer: (B)
Positive with at least one equal to zero
155. Which of these statements about the stepping-stone method is best?
A dummy source and destination must be added if the number of rows plus columns minus 1 is not equal to the number
of filled squares.
Only squares containing assigned shipments can be used to trace a path back to an empty square.
An improvement index that is a net positive means that the initial solution can be improved.
Only empty squares can be used to trace a path back to a square containing an assigned shipment
Correct answer: (B)
156. An assignment problem can be viewed as a special case of transportation problem in which the capacity from each
source is __________ and the demand at each destination is __________.
1; 1
Infinity; infinity
0; 0
1000; 1000
-1; -1
Correct answer: (A)
1; 1
157. Both transportation and assignment problems are members of a category of LP problems called __________.
shipping problems
logistics problems
generalized flow problems
routing problems
network flow problems
Correct answer: (E)
network flow problems
158. Consider the given vectors: a(2,0), b(0,2), c(1,1), and d(0,3). Which of the following vectors are linearly independent?
a, b, and c are independent
a, b, and d are independent
a and c are independent
b and d are independent
Correct answer: (C)
a and c are independent

159. Consider the linear equation
2 x1 + 3 x2 - 4 x3 + 5 x4 = 10
How many basic and non-basic variables are defined by this equation?
One variable is basic, three variables are non-basic
Two variables are basic, two variables are non-basic
Three variables are basic, one variable is non-basic
All four variables are basic
Correct answer: (A)
One variable is basic, three variables are non-basic
160. During an iteration while moving from one solution to the next, degeneracy may occur when
The closed path indicates a diagonal move
Two or more occupied cells are on the closed path but neither of them represents a corner of the path.
Two or more occupied cells on the closed path with minus sign are tied for lowest circled value
Either of the above
Correct answer: (C)
Two or more occupied cells on the closed path with minus sign are tied for lowest circled value
161. Feasible solution satisfies __________
Only constraints
only non-negative restriction
[a] and [b] both
[a],[b] and Optimum solution
Correct answer: (C)
[a] and [b] both
162. Graphical optimal value for Z can be obtained from

Corner points of feasible region
Both a and c
corner points of the solution region
none of the above
Correct answer: (A)
Corner points of feasible region
163. Hungarian Method is used to solve
A transportation problem
A travelling salesman problem
A LP problem
Both a & b
Correct answer: (B)
A travelling salesman problem
164. Identify the type of the feasible region given by the set of inequalities
x - y <= 1
x - y >= 2
where both x and y are positive.
A triangle
A rectangle
An unbounded region
An empty region
Correct answer: (D)
An empty region
Equal to zero
Most negative number

Most positive number
Any value
Correct answer: (B)
Most negative number
166. In a transportation problem, we must make the number of __________ and __________ equal.
destinations; sources
units supplied; units demanded
columns; rows
positive cost coefficients; negative cost coefficients
warehouses; suppliers
Correct answer: (B)
units supplied; units demanded
167. 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:
Unbalanced.
Infeasible.
Optimal.
impossible.
Degenerate.
Correct answer: (E)
Degenerate
168. In assignment problem of maximization, the objective is to maximise
Profit
optimization
cost
None of the above

Correct answer: (A)
Profit
169. In case of an unbalanced problem, shipping cost coefficients of __________ are assigned to each created dummy
factory or warehouse.
very high positive costs
very high negative costs
10
zero
one
Correct answer: (D)
zero
170. In Degenerate solution value of objective function __________.
increases infinitely
basic variables are nonzero
decreases infinitely
One or more basic variables are zero
Correct answer: (D)
One or more basic variables are zero
171. In game theory, the outcome or consequence of a strategy is referred to as the
payoff.
penalty.
reward.
end-game strategy.
Correct answer: (A)
payoff.
172. In graphical method the restriction on number of constraint is __________.
not more than 3
none of the above
Correct answer: (D)
none of the above
173. In graphical representation the bounded region is known as __________ region.
Solution
basic solution
feasible solution
optimal
Correct answer: (C)
feasible solution
174. In LPP the condition to be satisfied is
Constraints have to be linear
Objective function has to be linear
none of the above
both a and b
Correct answer: (D)
both a and b
175. In operations research, the __________ are prepared for situations.
mathematical models
physical models diagrammatic

diagrammatic models
all of above
Correct answer: (A)
mathematical models
177. One disadvantage of using North-West Corner rule to find initial solution to the transportation problem is that
It is complicated to use
It does not take into account cost of transportation
It leads to a degenerate initial solution
All of the above
Correct answer: (B)
It does not take into account cost of transportation
178. Operations management can be defined as the application of __________ to a problem within a system to yield the
optimal solution.
Suitable manpower
mathematical techniques, models, and tools
Financial operations
all of above
Correct answer: (B)
mathematical techniques, models, and tools
179. Operations research is based upon collected information, knowledge and advanced study of various factors impacting
a particular operation. This leads to more informed __________.
Management processes
Decision making
Procedures
all of above
Correct answer: (B)

Decision making
180. Operations research is the application of __________ methods to arrive at the optimal Solutions to the problems.
economical
scientific
a and b both
artistic
Correct answer: (B)
Scientific
181. Operations research was known as an ability to win a war without really going in to __________
Battle field
Fighting
The opponent
Both A and B
Correct answer: (D)
Both A and B
182. Optimal solution of an assignment problem can be obtained only if
Each row & column has only one zero element
Each row & column has at least one zero element
The data is arrangement in a square matrix
None of the above
Correct answer: (A)
Each row & column has only one zero element
183. OR can evaluate only the effects of __________.
Personnel factors.
Financial factors
Numeric and quantifiable factors.
all of above
Correct answer: (C)
Numeric and quantifiable factors.
184. OR has a characteristics that it is done by a team of
Scientists
Mathematicians
Academics
All of the above
Correct answer: (D)
All of the above
185. OR techniques help the directing authority in optimum allocation of various limited resources like __________
Men and Machine
Money
Material and Time
All of the above
Correct answer: (D)
All of the above
186. OR uses models to help the management to determine its __________
Policies
Actions
Both A and B
None of the above
Correct answer: (C)

Both A and B
Dummy allocation(s) needs to be added
The problem has no feasible solution
The multiple optimal solution exist
a & b but not c
Correct answer: (C)
The multiple optimal solution exist
Satisfy rim conditions
Prevent solution from becoming degenerate
Ensure that total cost does not exceed a limit
None of the above
Correct answer: (A)
Satisfy rim conditions
189. The equation Ri + Kj = Cij is used to calculate __________.
an improvement index for the stepping-stone method
the opportunity costs for using a particular route
the MODI cost values (Ri, Kj)
the degeneracy index
optimality test
Correct answer: (C)
the MODI cost values (Ri, Kj)
190. The initial solution of a transportation problem can be obtained by applying any known method. However, the only
condition is that
The solution be optimal
The rim conditions are satisfied
The solution not be degenerate
All of the above
Correct answer: (B)
The rim conditions are satisfied
191. The large negative opportunity cost value in an unused cell in a transportation table is chosen to improve the current
solution because
It represents per unit cost reduction
It represents per unit cost improvement
It ensure no rim requirement violation
None of the above
Correct answer: (A)
It represents per unit cost reduction
192. The method of finding an initial solution based upon opportunity costs is called __________.
the northwest corner rule
Vogel's approximation
Johanson's theorem
Flood's technique
Hungarian method
Correct answer: (B)
Vogel's approximation
193. The net cost of shipping one unit on a route not used in the current transportation problem solution is called the
__________.
change index
new index
MODI index
idle index
Improvement index
Correct answer: (E)
Improvement index
194. The objective function and constraints are functions of two types of variables, __________ variables and __________
variables.
Positive and negative
Controllable and uncontrollable
Strong and weak
None of the above
Correct answer: (B)
Controllable and uncontrollable
195. The objective function for a minimization problem is given by
z = 2 x1 - 5 x2 + 3 x3
The hyperplane for the objective function cuts a bounded feasible region in the space
(x1,x2,x3). Find the direction vector d, where a finite optimal solution can be reached.
d(2,-5,3)
d(-2,5,-3)
d(2,5,3)
d(-2,-5,-3)
Correct answer: (B)
d(-2,5,-3)
Total supply equals total demand
The solution so obtained is not feasible

The few allocations become negative
None of the above
Correct answer: (B)
The solution so obtained is not feasible
197. The only restriction we place on the initial solution of a transportation problem is that: we must have nonzero
quantities in a majority of the boxes.
all constraints must be satisfied.
demand must equal supply.
we must have a number (equal to the number of rows plus the number of columns minus one) of boxes which contain
nonzero quantities.
None of the above
Correct answer: (A)
all constraints must be satisfied.
198. The Operations research technique which helps in minimizing total waiting and service costs is
Queuing Theory
Decision Theory
Both A and B
None of the above
Correct answer: (A)
Queuing Theory
199. The procedure used to solve assignment problems wherein one reduces the original assignment costs to a table of
opportunity costs is called __________.
stepping-stone method
matrix reduction
MODI method
northwest reduction
simplex reduction
Correct answer: (B)
matrix reduction
200. The purpose of a dummy source or dummy destination in a transportation problem is to
prevent the solution from becoming degenerate.
obtain a balance between total supply and total demand.
make certain that the total cost does not exceed some specified figure.
provide a means of representing a dummy problem.
Correct answer: (B)
obtain a balance between total supply and total demand
201. The purpose of the stepping-stone method is to
develop the initial solution to the transportation problem.
assist one in moving from an initial feasible solution to the optimal solution.
determine whether a given solution is feasible or not.
identify the relevant costs in a transportation problem.
Correct answer: (B)
assist one in moving from an initial feasible solution to the optimal solution.
202. The smallest quantity is chosen at the corners of the closed path with negative sign to be assigned at unused cell
because
It improve the total cost
It does not disturb rim conditions
It ensure feasible solution
All of the above
Correct answer: (C)
It ensure feasible solution

203. The solution to a transportation problem with â€˜mâ€™ rows (supplies) & â€˜nâ€™ columns (destination) is feasible if
number of positive allocations are
m+n
m*n
m+n-1
m+n+1
Correct answer: (C)
m+n-1
204. The transportation method assumes that
there are no economies of scale if large quantities are shipped from one source to one destination.
the number of occupied squares in any solution must be equal to the number of rows in the table plus the number of
columns in the table plus 1.
there is only one optimal solution for each problem.
the number of dummy sources equals the number of dummy destinations.
Correct answer: (A)
there are no economies of scale if large quantities are shipped from one source to one destination.
205. What enables us to determine the earliest and latest times for each of the events and activities and thereby helps in
the identification of the critical path?
Programme Evaluation
Review Technique (PERT)
Both A and B
Deployment of resources
Correct answer: (C)
Both A and B
206. What have been constructed from OR problems an methods for solving the models that are available in many cases?
Scientific Models
Algorithms
Mathematical Models
None of the above
Correct answer: (C)
Mathematical Models
207. What is the difference between minimal cost network flows and transportation problems?
The minimal cost network flows are special cases of transportation problems
The transportation problems are special cases of the minimal cost network flows
There is no difference
The transportation problems are formulated in terms of tableaus, while the minimal cost network flows are formulated
in terms of graphs
Correct answer: (B)
The transportation problems are special cases of the minimal cost network flows
208. What is the objective function in linear programming problems?
A constraint for available resource
An objective for research and development of a company
A linear function in an optimization problem
A set of non-negativity conditions
Correct answer: (C)
A linear function in an optimization problem
209. When total supply is equal to total demand in a transportation problem, the problem is said to be
Balanced
Unbalanced
Degenerate
None of the above

Correct answer: (A)
Balanced
210. Which of the following is a method for improving an initial solution in a transportation problem?
northwest-corner
intuitive lowest-cost
southeast-corner rule
stepping-stone
Correct answer: (D)
stepping-stone
211. Which of the following is NOT needed to use the transportation model?
the cost of shipping one unit from each origin to each destination
the destination points and the demand per period at each
the origin points and the capacity or supply per period at each
degeneracy
Correct answer: (D)
degeneracy
212. Which of the following is not the phase of OR methodology?
Formulating a problem
Constructing a model
Establishing controls
Controlling the environment
Correct answer: (D)
Controlling the environment
MODI method
northwest corner method
stepping-stone method
Hungarian method
none of the above
Correct answer: (D)
Hungarian method
214. Which of the following methods is used to verify the optimality of the current solution of the transportation problem
Least cost method
Vogel's approximation method
Modified distribution method
All of the above
Correct answer: (C)
Modified distribution method
A dummy source and destination must be added if the number of rows plus columns minus 1 is not equal to the number
of filled squares.
An improvement index that is a net positive means that the initial solution can be improved.
Only empty squares can be used to trace a path back to a square containing an assigned shipment
Correct answer: (B)
216. Which statement characterizes standard form of a linear programming problem?
Constraints are given by inequalities of any type
Constraints are given by a set of linear equations
Constraints are given only by inequalities of >= type

Constraints are given only by inequalities of <= type
Correct answer: (A)
Constraints are given by inequalities of any type
217. Which technique is used in finding a solution for optimizing a given objective, such as profit maximization or cost
reduction under certain constraints?
Quailing Theory
Waiting Line
Both A and B
Linear Programming
Correct answer: (D)
Linear Programming
218. Who defined OR as scientific method of providing execuitive departments with a quantitative basis for decisions
regarding the operations under their control?
Morse and Kimball (1946)
P.M.S. Blackett (1948)
E.L. Arnoff and M.J. Netzorg
None of the above
Correct answer: (A)
Morse and Kimball (1946)
219. With the transportation technique, the initial solution can be generated in any fashion one chooses. The only
restriction is that
the edge constraints for supply and demand are satisfied.
the solution is not degenerate.
the solution must be optimal.
one must use the northwest-corner method.
Correct answer: (A)

the edge constraints for supply and demand are satisfied
OPERATIONS RESEARCH
1. Operations research is the application of methods to arrive at the optimal

Solutions to the problems.
A. economical
B. scientific
C. a and b both
D. artistic
2. In operations research, the ------------------------------ are prepared for situations.

A. mathematical models
B. physical models diagrammatic
C. diagrammatic models
3. Operations management can be defined as the application of -----------------------------------

-------to a problem within a system to yield the optimal solution.
A. Suitable manpower
B. mathematical techniques, models, and tools
C. Financial operations
4. Operations research is based upon collected information, knowledge and advanced study
of various factors impacting a particular operation. This leads to more informed -----------
--------------------------.
A. Management processes
B. Decision making
C. Procedures
5. OR can evaluate only the effects of ------------------------------------------------ --.

A. Personnel factors.
B. Financial factors
C. Numeric and quantifiable factors.
True-False
6. By constructing models, the problems in libraries increase and cannot be solved.
A. True
B. False
7. Operations Research started just before World War II in Britain with the establishment of
teams of scientists to study the strategic and tactical problems involved in military
operations.
A. True
B. False
8. OR can be applied only to those aspects of libraries where mathematical models can be
prepared.
A. True
B. False
9. The main limitation of operations research is that it often ignores the human element in
the production process.
A. True
B. False
10. Which of the following is not the phase of OR methodology?

A. Formulating a problem
B. Constructing a model
C. Establishing controls
D. Controlling the environment
11. The objective function and constraints are functions of two types of variables,
variables and variables.
A. Positive and negative
B. Controllable and uncontrollable
C. Strong and weak
D. None of the above
12. Operations research was known as an ability to win a war without really going in to
A. Battle field
B. Fighting
C. The opponent
D. Both A and B
13. Who defined OR as scientific method of providing execuitive departments with a

quantitative basis for decisions regarding the operations under their control?
A. Morse and Kimball (1946)
B. P.M.S. Blackett (1948)
C. E.L. Arnoff and M.J. Netzorg
14. OR has a characteristics that it is done by a team of

A. Scientists
B. Mathematicians
C. Academics
D. All of the above
15. Hungarian Method is used to solve
A. A transportation problem
B. A travelling salesman problem
C. A LP problem
D. Both a & b
16. A solution can be extracted from a model either by

A. Conducting experiments on it
B. Mathematical analysis
C. Both A and B
D. Diversified Techniques
17. OR uses models to help the management to determine its

A. Policies
B. Actions
C. Both A and B
18. What have been constructed from OR problems an methods for solving the models that
are available in many cases?
A. Scientific Models
B. Algorithms
C. Mathematical Models
19. Which technique is used in finding a solution for optimizing a given objective, such as
profit maximization or cost reduction under certain constraints?
A. Quailing Theory
B. Waiting Line
C. Both A and B
D. Linear Programming
20. What enables us to determine the earliest and latest times for each of the events and
activities and thereby helps in the identification of the critical path?
A. Programme Evaluation
B. Review Technique (PERT)
C. Both A and B
D. Deployment of resources
21. OR techniques help the directing authority in optimum allocation of various limited
resources like
A. Men and Machine
B. Money
C. Material and Time
D. All of the above
22. The Operations research technique which helps in minimizing total waiting and service
costs is
A. Queuing Theory
B. Decision Theory
C. Both A and B
UNIT II
LINEAR PROGRAMMING PROBLEMS
23. What is the objective function in linear programming problems?

A. A constraint for available resource
B. An objective for research and development of a company
C. A linear function in an optimization problem
D. A set of non-negativity conditions
24. Which statement characterizes standard form of a linear programming problem?

A. Constraints are given by inequalities of any type
B. Constraints are given by a set of linear equations
C. Constraints are given only by inequalities of >= type
D. Constraints are given only by inequalities of <= type
25. Feasible solution satisfies

A. Only constraints
B. only non-negative restriction
C. [a] and [b] both
D. [a],[b] and Optimum solution
26. In Degenerate solution value of objective function .

A. increases infinitely
B. basic variables are nonzero
C. decreases infinitely
D. One or more basic variables are zero
27. Minimize Z =
A. –maximize(Z)
B. -maximize(-Z)
C. maximize(-Z)
D. none of the above
28. In graphical method the restriction on number of constraint is .
A. 2
B. not more than 3
C. 3
29. In graphical representation the bounded region is known as region.

A. Solution
B. basic solution
C. feasible solution
D. optimal
30. Graphical optimal value for Z can be obtained from

A. Corner points of feasible region
B. Both a and c
C. corner points of the solution region
31. In LPP the condition to be satisfied is

A. Constraints have to be linear
B. Objective function has to be linear
C. none of the above
D. both a and b
State True or False:

32. Objective function in Linear Programming problems has always finite value at the
optimal solution-TRUE
33. A finite optimal solution can be not unique- FALSE
34. Feasible regions are classified into bounded, unbounded, empty and multiple: TRUE
35. Corner points of a feasible region are located at the intersections of the region and
coordinate axes: TRUE
36. Identify the type of the feasible region given by the set of inequalities
x - y <= 1
x - y >= 2
where both x and y are positive.
A. A triangle
B. A rectangle
C. An unbounded region
D. An empty region
37. Consider the given vectors: a(2,0), b(0,2), c(1,1), and d(0,3). Which of the following
vectors are linearly independent?
A. a, b, and c are independent
B. a, b, and d are independent
C. a and c are independent
D. b and d are independent
38. Consider the linear equation

2 x1 + 3 x2 - 4 x3 + 5 x4 = 10
How many basic and non-basic variables are defined by this equation?
A. One variable is basic, three variables are non-basic
B. Two variables are basic, two variables are non-basic
C. Three variables are basic, one variable is non-basic
D. All four variables are basic
39. The objective function for a minimization problem is given by

z = 2 x1 - 5 x2 + 3 x3
The hyperplane for the objective function cuts a bounded feasible region in the space
(x1,x2,x3). Find the direction vector d, where a finite optimal solution can be reached.
A. d(2,-5,3)
B. d(-2,5,-3)
C. d(2,5,3)
D. d(-2,-5,-3)
40. The feasible region of a linear programming problem has four extreme points: A(0,0),
B(1,1), C(0,1), and D(1,0). Identify an optimal solution for minimization problem with
the objective function z = 2 x - 2 y
A. A unique solution at C
B. A unique solutions at D
C. An alternative solution at a line segment between A and B
D. An unbounded solution
41. Degeneracy occurs when

A. Basic variables are positive but some of non-basic variables have negative values
B. The basic matrix is singular, it has no inverse
C. Some of basic variables have zero values
D. Some of non-basic variables have zero values

(a) Constrained optimization technique
(b) Technique for economic allocation of limited resources.
(c) Mathematical techniques
(d) All of the above

(a) Limitation
(b) Requirements
(c) Balancing limitations and requirements
44. The distinguished feature of an LP model is

(a) Relationship among all variable is linear
(b) It has single objective function and constraints
(c) Value of decision variables is non-negative
45. Alternative solution exist of an LP model when

(a) One of the constraints is redundant
(b) Objective function equation is parallel to one of the
(c) Two constrains are parallel
46. In the optimal simplex table,

Cj -Zj value indicates
(a) Unbounded solution
(b) Cycling
(c) Alternative solution
(d) None of these
47. For a maximization problem, objective function coefficient for an artificial variable is
(a) + M
(b) -M
(c) Zero
(d) None of these
48. If an optimal solution is degenerate, then

(a) There are alternative optimal solution
(b) The solution is infeasible
(c) The solution is use to the decis ion maker
(d) None of these
49. If a primal LP problem has finite solution, then the dual LP problem should have
(a) Finite solution
(b) Infeasible solution
(c) Unbounded solution
(d) None of these

(a) Dummy allocation needs to be added
(b) The problem has no feasible solution
(c) The multiple optimal solution exists.
(d) (a) and (b) only
51. When the total supply is not equal to total demand in a transportation problem then it is
called
(a) Balanced
(b) Unbalanced
(e) Degenerate
(d) None of these
52. The solution to a transportation problem with m-rows and n-columns is feasible if number
of positive allocations are
(a) m + n
(b) m *n
(c) m+n-l
(d) m+n+l
GAME THEORY
53. A firm that considers the potential reactions of its competitors when it makes a decision
A. is referred to as a price leader.
B. is engaged in strategic behaviour.
C. is engaged in collusion.
D. is referred to as a barometric firm.
54. Which of the following is an example of strategic behaviour?

A. A firm builds excess capacity to discourage the entry of competitors.
B. A firm adopts the pricing behaviour of a dominant firm under the assumption that
other firms will do likewise.
C. Firms in an industry increase advertising expenditures to avoid losing market share.
D. All of the above are examples of strategic behaviour.
55. Which one of the following is a part of every game theory model?
A. Players
B. Payoffs
C. Probabilities
D. Strategies
56. In game theory, a choice that is optimal for a firm no matter what its competitors do is
referred to as
A. the dominant strategy.
B. the game-winning choice.
C. super optimal.
D. a gonzo selection.
57. Which of the following circumstances in an industry will result in a Nash equilibrium?
A. All firms have a dominant strategy and each firm chooses its dominant strategy.
B. All firms have a dominant strategy, but only some choose to follow it.
C. All firms have a dominant strategy, and none choose it.
D. None of the above is correct.
58. Which of the following describes a Nash equilibrium?

A. A firm chooses its dominant strategy, if one exists.
B. Every competing firm in an industry chooses a strategy that is optimal given the
choices of every other firm.
C. Market price results in neither a surplus nor a shortage.
D. All firms in an industry are earning zero economic profits.
59. A prisoners' dilemma is a game with all of the following characteristics except one.
Which one is present in a prisoners' dilemma?
A. Players cooperate in arriving at their strategies.
B. Both players have a dominant strategy.
C. Both players would be better off if neither chose their dominant strategy.
D. The payoff from a strategy depends on the choice made by the other player.
60. Which of the following legal restrictions, if enforced effectively, would be likely to solve
a prisoners' dilemma type of problem for the firms involved?
A. A law that prevents a cartel from enforcing rules against cheating.
B. A law that makes it illegal for oligopolists to engage in collusion.
C. A law that prohibits firms in an industry from advertising their services.
D. All of the above would be likely to solve a prisoners' dilemma for the firms.
61. Until recently, medical doctors and lawyers have been prohibited from engaging in
competitive advertising. If the prisoners' dilemma applies to this situation, then the
presence of this restriction would be likely to
A. increase profits earned by individuals in these professions.
B. reduce profits earned by individuals in these professions.
C. have no effect on the profits earned by individuals in these professions.
D. increase the profits of some and reduce the profits of other individuals in these
professions.
62. Which one of the following conditions is required for the success of a tit-for-tat strategy?
A. Demand and cost conditions must change frequently and unpredictably.
B. The number of oligopolists in the industry must be relatively small.
C. The game can be repeated only a small number of times.
D. Firms must be unable to detect the behavior of their competitors.
63. A firm may decide to increase its scale so that it has excess production capacity because,
by doing so, it is able to
A. minimize its average cost of production.
B. establish a credible deterrent to the entry of competing firms.
C. take advantage of a dominant strategy in a prisoners' dilemma.
D. attain a Nash equilibrium and avoid repeated games.
64. Game theory is concerned with

A. predicting the results of bets placed on games like roulette.
B. the choice of an optimal strategy in conflict situations.
C. utility maximization by firms in perfectly competitive markets.
D. the migration patterns of caribou in Alaska.
65. Which of the following is an example of a game theory strategy?

A. You scratch my back and I’ll scratch yours.
B. If the shoe fits, wear it.
C. Monkey see, monkey do.
D. None of the above.
66. In game theory, a situation in which one firm can gain only what another firm loses is
called a
A. nonzero-sum game.
B. prisoners’ dilemma.
C. zero-sum game.
D. cartel temptation.
67. Which of the following is a nonzero-sum game?

A. Prisoners’ dilemma
B. Chess
C. Competition among duopolists when market share is the payoff
D. All of the above.
68. A plan of action that considers the reactions of rivals is an example of

A. accounting liability.
B. strategic behaviour.
C. accommodating behaviour.
D. risk management.
69. In game theory, the outcome or consequence of a strategy is referred to as the

A. payoff.
B. penalty.
C. reward.
D. end-game strategy.
70. A strategy that is best regardless of what rival players do is called

A. first-mover advantage.
B. a Nash equilibrium strategy.
C. tit-for-tat.
D. a dominant strategy.
71. A game that involves interrelated decisions that are made over time is a
A. sequential game.
B. repeated game.
C. zero-sum game.
D. nonzero-sum game.
72. A game that involves multiple moves in a series of identical situations is called a
A. sequential game.
B. repeated game.
C. zero-sum game.
D. nonzero-sum game.
73. Sequential games can be solved using

A. tit-for-tat.
B. dominated strategies.
C. backward induction.
D. risk averaging.
74. A firm that is threatened by the potential entry of competitors into a market builds excess
production capacity. This is an example of
A. a prisoners’ dilemma.
B. collusion.
C. a credible threat.
D. tit-for-tat.
75. What is the fundamental purpose of game theory?

A. To analyse decision-making
B. To analyse strategic interactions
C. To predict decision outcomes
D. To predict firm behaviour
UNIT III
ASSIGNMENT PROBLEM
76. An assignment problem is considered as a particular case of a transportation problem

because
A. The number of rows equals columns
B. All xij= 0 or 1
C. All rim conditions are 1
D. All of the above
77. An optimal assignment requires that the maximum number of lines that can be drawn
through squares with zero opportunity cost be equal to the number of
A. Rows or columns
B. Rows & columns
C. Rows + columns –1 d.
78. While solving an assignment problem, an activity is assigned to a resource through a

square with zero opportunity cost because the objective is to
A. Minimize total cost of assignment
B. Reduce the cost of assignment to zero
C. Reduce the cost of that particular assignment to zero
D. All of the above

A. Reduced matrix method
B. MODI method
C. Hungarian method

A. Obtain balance between total activities &total resources
B. Prevent a solution from becoming degenerate
C. Provide a means of representing a dummy problem

A. Adding each entry in a column from the maximization value in that column
B. Subtracting each entry in a column from the maximum value in that column
C. Subtracting each entry in the table from the maximum value in that table
D. Any one of the above

A. n! solutions
B. (n-1)! solutions
C. (n!)nsolutions
D. n solutions

A. Simplex method
B. Transportation method
C. Both a & b
84. For a salesman who has to visit n cities which of the following are the ways of his tour
plan
A. n!
B. (n+1)!
C. (n-1)!
D. n

A. Requires that only one activity be assigned to each resource
B. Is a special case of transportation problem
C. Can be used to maximize resources
D. All of the above

A. Number of rows equals number of columns
B. All rim conditions are 1
C. Values of each decision variable is either 0 or 1
D. All of the above
87. Every basic feasible solution of a general assignment problem, having a square pay-off
matrix of order, n should have assignments equal t
A. 2n+1
B. 2n-1
C. m+n-1
D. m+n
88. To proceed with the MODI algorithm for solving an assignment problem, the number of
dummy allocations need to be added are
A. n
B. 2n
C. n-1
D. 2n-1
A. A transportation problem
B. A travelling salesman problem
C. A LP problem
D. Both a & b

A. Each row & column has only one zero element
B. Each row & column has at least one zero element
C. The data is arrangement in a square matrix
A. northwest corner rule
B. Vogel's approximation method
C. MODI method
D. stepping-stone method
92. In applying Vogel's approximation method to a profit maximization problem, row and
column penalties are determined by:
A. finding the largest unit cost in each row or column.
B. finding the smallest unit cost in each row or column.
C. finding the sum of the unit costs in each row or column.
D. finding the difference between the two lowest unit costs in each row and column.
E. finding the difference between the two highest unit costs in each row and column.
middle cell.
A. Lower right corner of the table.
B. Upper right corner of the table.
C. Highest costly cell of the table.
D. Upper left-hand corner of the table.
.
94. The table represents a solution that is:
A. an initial solution.
B. Infeasible.
C. degenerate.
D. all of the above
E. none of the above
A. MODI method
B. northwest corner method
C. stepping-stone method
D. Hungarian method

A. The solution is infeasible.
B. The solution is degenerate.
C. The solution is unbounded.
D. Nothing is wrong.
E. The solution is inefficient in that it is possible to use fewer routes.

A. infeasible.
B. degenerate.
C. unbounded.
D. Optimal.
98. The solution shown was obtained by Vogel's approximation. The difference between the
objective function for this solution and that for the optimal is
A. 40
B. 60
C. 80
D. 100
99. Optimal solution of an assignment problem can be obtained only if

A. Each row & column has only one zero element
B. Each row & column has at least one zero element
100. In assignment problem of maximization, the objective is to maximise

A. Profit
B. optimization
C. cost
UNIT IV
TRANSPORTATION PROBLEMS
101. What is the difference between minimal cost network flows and transportation
problems?
A. The minimal cost network flows are special cases of transportation problems
B. The transportation problems are special cases of the minimal cost network flows
C. There is no difference
D. The transportation problems are formulated in terms of tableaus, while the minimal
cost network flows are formulated in terms of graphs
102. With the transportation technique, the initial solution can be generated in any fashion
one chooses. The only restriction is that
A. the edge constraints for supply and demand are satisfied.
B. the solution is not degenerate.
C. the solution must be optimal.
D. one must use the northwest-corner method.
103. The purpose of the stepping-stone method is to

A. develop the initial solution to the transportation problem.
B. assist one in moving from an initial feasible solution to the optimal solution.
C. determine whether a given solution is feasible or not.
D. identify the relevant costs in a transportation problem.
104. The purpose of a dummy source or dummy destination in a transportation problem is

to
A. prevent the solution from becoming degenerate.
B. obtain a balance between total supply and total demand.
C. make certain that the total cost does not exceed some specified figure.
D. provide a means of representing a dummy problem.
105. Which of the following is NOT needed to use the transportation model?
A. the cost of shipping one unit from each origin to each destination
B. the destination points and the demand per period at each
C. the origin points and the capacity or supply per period at each
D. degeneracy
106. Which of the following is a method for improving an initial solution in a

A. northwest-corner
B. intuitive lowest-cost
C. southeast-corner rule
D. stepping-stone
107. The transportation method assumes that

A. there are no economies of scale if large quantities are shipped from one source to
one destination.
B. the number of occupied squares in any solution must be equal to the number of rows
in the table plus the number of columns in the table plus 1.
C. there is only one optimal solution for each problem.
D. the number of dummy sources equals the number of dummy destinations.
108. An initial transportation solution appears in the table.

Factory
C D
Capacity
A 10 0 10
B 15 25 40
Warehouse
25 25 50
Demand
Can this solution be improved if it costs $5 per unit to ship from A to C; $7 per unit to ship
from A to D; $8 to ship from B to C; and $9 to ship from B to D?
A. Yes, this solution can be improved by $50.

B. Yes, this solution can be improved by $100.
C. No, this solution is optimal.
D. Yes, the initial solution can be improved by $10.
109. What is the cost of the transportation solution shown in the table?
W X Y Supply
$3 $5 $9
A 70
20 50 0
$5 $4 $7
B 30
0 30 0
$10 $8 $3
C 120
40 0 80
Demand 60 80 80 220
A. $1350
B. $1070
C. $1150
D. $1230
110. Which statement regarding this transportation table is best?

W X Y Supply
$3 $5 $9
A 70
20 50 0
$5 $4 $7
B 30
0 30 0
$10 $8 $3
C 120
40 0 80
Demand 60 80 80 220
A. The solution is degenerate.
B. This solution can be improved by shipping from C to X.
C. This solution would be improved by shipping from B to W.
D. This solution was developed using the northwest corner rule.
A. A dummy source and destination must be added if the number of rows plus columns
minus 1 is not equal to the number of filled squares.
B. Only squares containing assigned shipments can be used to trace a path back to
an empty square.
C. An improvement index that is a net positive means that the initial solution can be
improved.
D. Only empty squares can be used to trace a path back to a square containing an
assigned shipment
112. In a transportation problem, we must make the number of and

equal.
A. destinations; sources
B. units supplied; units demanded
C. columns; rows
D. positive cost coefficients; negative cost coefficients
E. warehouses; suppliers
113. or are used to "balance" an assignment or transportation

problem.
A. Destinations; sources
B. Units supplied; units demanded
C. Dummy rows; dummy columns
D. Large cost coefficients; small cost coefficients
E. Artificial cells; degenerate cells
114. The net cost of shipping one unit on a route not used in the current transportation
problem solution is called the .
A. change index
B. new index
C. MODI index
D. idle index
E. Improvement index
115. The procedure used to solve assignment problems wherein one reduces the original
assignment costs to a table of opportunity costs is called .
A. stepping-stone method
B. matrix reduction
C. MODI method
D. northwest reduction
E. simplex reduction
116. The method of finding an initial solution based upon opportunity costs is called
.
A. the northwest corner rule
B. Vogel's approximation
C. Johanson's theorem
D. Flood's technique
E. Hungarian method
117. An assignment problem can be viewed as a special case of transportation problem in

which the capacity from each source is and the demand at each destination is
.
A. 1; 1
B. Infinity; infinity
C. 0; 0
D. 1000; 1000
E. -1; -1
118. occurs when the number of occupied squares is less than the number of rows
plus
A. Degeneracy
B. Infeasibility
C. Unboundedness
D. Unbalance
E. Redundancy
119. Both transportation and assignment problems are members of a category of LP

problems called .
A. shipping problems
B. logistics problems
C. generalized flow problems
D. routing problems
E. network flow problems
120. The equation Ri + Kj = Cij is used to calculate .

A. an improvement index for the stepping-stone method
B. the opportunity costs for using a particular route
C. the MODI cost values (Ri, Kj)
D. the degeneracy index
E. optimality test
121. In case of an unbalanced problem, shipping cost coefficients of are assigned

to each created dummy factory or warehouse.
A. very high positive costs
B. very high negative costs
C. 10
D. zero
E. one
122. The initial solution of a transportation problem can be obtained by applying any
known method. However, the only condition is that
A. The solution be optimal
B. The rim conditions are satisfied
C. The solution not be degenerate
D. All of the above

A. Satisfy rim conditions
B. Prevent solution from becoming degenerate
C. Ensure that total cost does not exceed a limit
A. Total supply equals total demand
B. The solution so obtained is not feasible
C. The few allocations become negative
125. An alternative optimal solution to a minimization transportation problem exists

whenever opportunity cost corresponding to unused route of transportation is:
A. Positive & greater than zero
B. Positive with at least one equal to zero
C. Negative with at least one equal to zero
126. One disadvantage of using North-West Corner rule to find initial solution to the
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
127. The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns
(destination) is feasible if number of positive allocations are
A. m+n
B. m*n
C. m+n-1
D. m+n+1
A. Equal to zero
B. Most negative number
C. Most positive number
D. Any value
129. 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
130. The large negative opportunity cost value in an unused cell in a transportation table is
chosen to improve the current solution because
A. It represents per unit cost reduction
B. It represents per unit cost improvement
C. It ensure no rim requirement violation
131. The smallest quantity is chosen at the corners of the closed path with negative sign to
be assigned at unused cell because
A. It improve the total cost
B. It does not disturb rim conditions
C. It ensure feasible solution
D. All of the above
132. When total supply is equal to total demand in a transportation problem, the problem is
said to be
A. Balanced
B. Unbalanced
C. Degenerate
133. Which of the following methods is used to verify the optimality of the current solution
of the transportation problem
A. Least cost method
B. Vogel’s approximation method
C. Modified distribution method
D. All of the above

A. Dummy allocation(s) needs to be added
B. The problem has no feasible solution
C. The multiple optimal solution exist
D. a & b but not c
135. 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:
A. Unbalanced.
B. Infeasible.
C. Optimal.
D. impossible.
E. Degenerate.
136. The only restriction we place on the initial solution of a transportation problem is that:
we must have nonzero quantities in a majority of the boxes.
A. all constraints must be satisfied.
B. demand must equal supply.
C. we must have a number (equal to the number of rows plus the number of columns
minus one) of boxes which contain nonzero quantities.
A. the solution be optimal
B. the rim condition are satisfied
C. the solution not be degenerate
D. all of the above

A. satisfy rim condition
B. prevent solution from becoming degenerate
C. ensure that total cost does not exceed a limit
D. all of the above
A. total supply equals total demand
B. the solution so obtained is not feasible
C. the few allocations become negative

whenever opportunity cost corresponding to unused routes of transportation is:
A. positive and greater than zero
B. positive with at least one equal to zero
C. negative with at least one equal to zero
D. all of the above
141. One disadvantage of using North-West Corner Rule to find initial solution to
the transportation problem is that
A. it is complicated to use
B. it does not take into account cost of transportation
C. it leads to degenerate initial solution
D. all of the above
' I '
Operations Research Simplified :Q: M CQ : Basics of Linear Programming Model

--
1) Term 'Linear' in LPP represents that
A) Parameters value remains constant during the planning

period
B) Relationship among all variables is linear
C) Value of decision variables is non-negative
D) It has single objective function & constraints

' I ,

--
2) The mathematical model of an LP problem is important

because
~ ) It helps in converting the verbal description & numerical data

into mathematical expression
0
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

\ I ,

--
3) Linear programming is a
A) Constrained optimization technique
B) Technique for economic allocation of limited resources
C) Mathematical technique
D) All of these options

0
•Q
' I '.
-= -
-
\ I ,

--
4) The first step in formulating a linear programming

problem is
A) Plot a graph
B) Perform the sensitivity analysis
C) ldenti«fy and define the decision variables
D) Find out the redundant constraints

-•Q' .
I '-
=-
-
' I '

--
5} Constraints in LPP mean _ __
) Li ro itations are expressed in mathematical equalities ( or

inequalities)
B) Assumption
C) Goal is to be achieved
D) A function to be optimized
-' O'=
I , -
'
-
' I ,

--
6) Non-negativity restriction in LPP indicates that
A) All decision variables must take on values equal to or greater

0
than zero
B) A positive coefficient of variables in objective function
C) A positive coefficient of variables in any constraint
D) Non-negative value of resources

•Q'
SUBS RIBED • - -
I ' -
-
='
' I ,
v! 10 ~ J U 40 50 OU"l1
Operations Research Simplified :Q: M CQ ... -

, ,,
~~-~-
,,-+ .., = 100
·c a -. -
,-+,·= AA
o -· -·.....- . .. g Model
--
. • -
7) A feasible solution to an LP problem
A) Must satisfy all of the problem's constraints simultaneously

0
B) Need not satisfy all of the constraints, only some of them
C) Must be a corner point of the feasible region
D) Must optimize the value of the objective function
-•Q' .
I '•
-
-=
' I '

--
8) Which of the following is assumption of an LP model
A) Divis ibi Iity
B) Proportionality
C) Additivity
D) All of t J;lese
-•Q' .
I ' -
-
='
' I '

--
9) The linear function of the variables which is to be

maximize or minimize is called
A) Constraints
B) Obj~ctive function
C) Decision variable
D) Non-negativity constraint
•Q
' I
- -= - '•
-
\ I ,

--
10) Which of the following is NOT a characteristic of the LPP
A) Resources must be limited
B) Only one objective function

C) Parameters value remains constant during the planning
period
D) The problem must be of minimization type
0
•Q
' I
- - '•
-
='
' I '
Operations Research Simplified :Q:

--
MCQ: LPP (Graphical Method)
1) In graphical method the restriction on number of decision

variables is •
)Two
B) Three
C) Not more then three
D) None pf these
' I '

--
2) In graphical method the restriction on number of constraint

•
IS _ _ _ _ _ •
A)Two
B) Three 0
C) Not more then three
D) None of these
' I '

-- MCQ: LPP (Graphical Method)
3} The region which satisfies all the constrains of the L.P.P. is called
as
--
) Feasible region 0
B) Infeasible region
C) Convex region
D) Concave region
\ I ,

--
4) Graphical optimal value for Z can be obtained from
orner points of the feasible region

0
B) Corner points of the infeasible region

C) Mid point of the feasible region
D) Mid point of the infeasible region
-•Q' .
I ' -
=-
' I '

5) The feasible solution of a L.P.P. belongs to
A) First and second quadrant
B) First and third quadrant
C) Second quadrant
D) Only in the first 6:l Uadrant
-•Q' .
I '•
=-
\ I ,

6) Alternative solution exist in a linear programming problem

when - - - -
A) one of the constraint is redundant
B) objective function is pa ioa llel to one of the constraints
C) two constraints are parallel
D) objective function is perpandicular to one of the constraints

'O
\
-=
I ' -
'
-
' I '

--
7) If the value of the objective function z can be increased or

decreased indefinitely, such solution is called ______
A) Bounded solution
B) Optimum solution
) Unbound ed solution
D) Feasible Solution
-•Q
'I
.' -
- -
Operations Research Simplified :t):
--
8) In following LPP solution optimum value of Z is at point

Maximize z • 4x • y subject to:- x • y ::50
y 3X + y ::gO
X?: o. y?: 0
go
A) (O,O)
Corner Point Corresponding value
80 3x • y • go
ofZ
70
60 C<o. 50) (O, O) 0
B) {30,0J
(30. O) 120
40
30
8(20. 30) (20. 30) uo C) {20,30)
(50, O) <o. 50> 50
20
x•
10 / D) (0,50)
40 0 70
107
Y' •Q
' I '•
A (30. o) x + y • 50 -= -
-
\ I ,

9) For the maximize function Z = X + V and constraints given by X +

V ~ 8 and 3X + SY S 15
A) There are two feasible regions
B) There are infinite feasible regions
) There is no feasible region

D) There is a bounded feasible region
-•Q' .
I ' -
=-
\ I ,

--
10) For the optimizing function Z = X + V and constraints given by

2X 1 + X2 S 30; X1 + X2 S 20 and X1 S 25
Which one is redundant constraint.
A) 2X 1 + X2 ~ 30
B) X1 + X2 ~ 20
) X1 ~ 25 0
D) None of these - .
•Q
' I '•
=-
\ I ,

--
MCQ : LPP Simplex and Big-M
1) Linear programming problem involving more than two variables

can be solved by
7\) Simplex method

B) Graphical method
C) Matrix minima method
D) Hungarian method
SUBS RIBEO A
\ I ,

--
2) The variable is added for the less than or equal to

(S) type of constraint
B) Surplus
C) Artificial
D) Basic
' I ,

--
3) The variable is used for the greater than or equal

to (~) type of constraint
A) Only Slack
B) Surplus0 and Artificial
C) Only Artificial
D) Basic
•Q
' I '•
- -= -
-
\ I ,

--
4) The coefficient of slack variable in the objective function is
A)-M
B) +M
D)l
\ I ,

--
5) Slack variables are assigned zero coefficient because
A) No contribution in the objective function

0
B) High contribution in the objective function

C) Basic contribution in the objective function
D) Minimum contribution in the objective function

' I ,

-- MCQ : LPP Simplex and Big-M
6) The role of artificial variables in the simplex method is
A) To aid in finding an initial solution
B) To find optimal dual prices in the final simplex table
C) To start with Big M method
D) All of t t, ese
SUBSCRIBED '•' -•o'=

I ' -
'
-
\ I ,

--
7) The coefficient of artificial variable in the objective function of

maximization problem is
A)-M
B) +M
C)O
D)l
-•Q' .
I '•
=-
' I ,

--
8) For a minimization problem, the objective function coefficient

for an artificial variable is
A)-M
0
B) +M
C)O
D}1
•Q
'
- -= -
I '-
-
\ I ,

--
9) For maximization LPP, the simplex method is terminated when

all values
B) cj + zj : ; o
C) Cj- Zj ~ 0
o) cj + zj ~ o
-•o\ .
I ' -
=-
\ I ,

--
10) In the simplex method the outgoing/leaving variable

is one with value of replacement ratio.
A) smal lest non-negative

B) smallest negative
C) largest
D) zero
-•Q' .
I '•
=--
-
MCQ : Assignment Problem
-
1) An assignment problem is considered as a particular case of a

0
A) Transportation problem
B) Sequencing problem
C) Queuing problem
D) Game theory
\ I ,

-- MCQ : Assignment Problem
2) The method used for solving an assignment problem is called
A) Simplex method
B) Least cost method

C) Hungarian method
D) Steppi ng stone method

' I '

--
4) While solving an assignment problem, an activity is

assigned to a resource with zero opportunity cost because
objective is to _ __
) rcn inimize total cost of assignment
B) reduce total cost of assignment to zero
C) reduce cost of that assignment to zero
D) maximize total cost of assignment •Q

' I
SUBSCRIBED ta.' -= ' -
'
-
' I '

--
5) In an assignment problem_ __
) Only one activity be assigned to each resource

0
B) Any number of activities can be assigned to each resource

C) It depends upon how many resources are available
D) First activity is assigned to first resource
-•Q' .
I ' -
-=-
--
6) An assignment problem can be viewed as a special case of

transportation problem in which the capacity from each source is
and the demand at each destination is .
---
0
A)one;one
B) unlimited; one
C) one; unlimited
D) unlimited; unlimited •Q
' I
- -= - '•
-
\ I ,

--
7) In marking assignments, which of the following should be

preferred?
A) Only row having single zero
B) Only column having single zero
)
C) Only row/column having single zero
D) Column having more than one zero

-•Q' . I ' -
-
:
' I '

-- MCQ : Assignment Problem
8) The assi~nment problem is always a _ _ _ _ _ _matrix.

A) circle
B) square
C) rectangle
D) triangle
-•Q' .
I ,•
=-
Operations Research Simplified :():
--
9) Maximization assignment problem is transformed into a

minimization problem by .
A) adding each entry in a column from the maximum value in that column
B subtracting each entry in a column from the maximum value in that column
adding each entry in the table from the r'n aximum value in that table
SUBSCRIBED 1
' -•Q' .
I ' -
=-
\ I ,

--
10) The assignment problem will have alternate solutions when
A) at least one zero in each row and column
B) when all rows have two zeros
) w hen there is a tie between zero opportunity cost cells

D) if two diagonal elements are zeros.
SUBSCRIBED 1
' -•Q' .
I , -
-=-
-
MCQ : Transportation Model
-
3} The transportation problem deals with the transportation of_
A) single product from a source to several destinations
B) several products from a source to a destination

C) single product from several sources to a destination
) several products from several sources

0
to several destinations
\ I ,

--
MCQ : Transportation Model
4) In northwest corner method first allocation is made at
A) Lower right corner of the table.
B) Upper right corner of the table.

C) Highest costly cell of the table.
D) Upper left-hand corner of the table. 0
-•Q' .
I '•
=-
-
MCQ: Queuing Model
-
1) In queuing system, _____ refers to those waiting in a

• • •
queue or rece1v1ng service
0
A) Service provider
B) Client
Customer
D) Patron
-
MCQ: Queuing Model
-
2) A queue is formed when the demand for a service
Exceed-S the capacity to provide that service

B) Is less than the capacity to provide that service
C) Is equal to the capacity to provide that service
D) There is no relation of service capacity and queue

-
MCQ: Queuing Model
-
3) Commonly assumed probability distribution of arrival pattern

•
IS
-------
) Poisson distribution °
B) Binomial distribution
C) Normal distribution
D) Beta distribution
-•Q
'
I
. , -
=-
- MCQ: Queuing Model
-
4) Commonly assumed probability distribution of service

pattern
A) Poisson distribution
B) Exponential distribution
C) Normal distribution
D) Beta distrj bution

-•o'=
I ' -
'
-
\ I ,

--
MCQ: Queuing Model
5) A customer's behavior of jumping from one queue to another

is called
------
A) Jockying
B) Reneging
0
C) Collusion
D) Balking
•Q
'
-=
I , -
'
-
-
MCQ: Queuing Model
-
6) The _ _ _ _ indicates the order in which members of

the queue are selected for service.
7\) Queue discipline
B) Arrival pattern
C) Service Pattern
D) Cu~ omer behaviour
-•Q' .
I ' -
:
-
\ I ,

--
MCQ: Queuing Model
7) Traffic intensity in Queuing Theory is also called _ __
A) Service factor
B) Arriva I factor
/ 0
';,,IC) Utilization factor

~
D) Consumption factor
-•Q
'
.
I '•
=-
\ I ,

-- MCQ: Queuing Model
8) A calling population is considered to be infinite when

A) The capacity of the system is infinite
B) Arrivals are dependent upon each other
C) All customers arrival at once
Arrivals are independent of each other

0
-•Q' .
I ' -
=-
\ I ,

-- MCQ: Queuing Model
9) In waiting line theory, number of customers waiting in the

queue is referred to as
A) Queuing system
B) Traffic intensity
) Queue length
D) System length
0
-•Q' .
I '•
=-
-
MCQ: Queuing Model
-
10) An M/D/5 system is a system with a
A) generic M channel system, exponential arrivals, and constant service time.
B) five channel system, Poisson arrivals, and normally distributed service time
C) five ct\p nnel system, Poisson arrivals and constant service time.
D) D channel system with Exponential arrivals and Poisson service times.
-•Q' .
I ' -
-
='
-
MCQ : Operations Research
-
1) Operations research is the application of _ _ _ __

methods to arrive at the optimal solutions to the problems.
A) Economical
B) Sci~ntific
C) Artistic
D) Rational
-
-
2) In operations research, the _ _ _ _ _ _ are prepared for

situations.
Mathematical models
B) Physical models
C) Iconic models
D) Diagrammatic models
0
- MCQ : Operations Research
-
4) Operation research approach is
A) Mu !ti-disciplinary
B) Artificia I
C) Intuitive
D) Limited to some fields

0
-•Q' .
I ' -
=-
\ I ,

--
5) Operation research analysts do not _ _ __
A) Predict future operation
B) Build models
C) Collect the relevant data
D) Recommend decision and accept

0
SUBSCRIBED
1
• ' -•o
' .I , -
=-
--
6) Which technique is used in finding a solution for optimizing a

given objective, such as profit maximization or cost reduction under
certain constraints?
A) Quailing Theory o
B) Network Analysis
C) Linear Programming
D) Sequencing Model •Q
-= -' I '•
-
-- MCQ : Operations Research
7) Operations Research is a very powerful tool for _ _ __

A) Operations
B) Research
C) Decision making
D) Simulation
0
SUBSCRIBED '*' •Q
-' I ' -
'
-
:
--
9) A model is _ _ __
A) An essence of reality
B) An approximation
C) An idealization
) Al I of the these
0
-•Q' .
I '•
-=-
Model Question paper
Operation Research Technique ANS
CLASS-BE MAX MARKS-60
TIME-90 MIN
Each question carry one marks
UNIT-I A
1. Operations Research approach is ______________.
A. multi-disciplinary
B. intuitive
C. collect essential data
2. Operations Research has the characteristics that it is done by a team D

of -----------------
A. Scientists
B. Mathematicians
C. Academics
D. All of the above
3. Operations Research was known as an ability to win a war without really going in to D
a -------------
A. Battle field
B. Fighting
C. War
D. Both A and B
4 . Operations Research is a ----------------- D
A. Science
B. Art
C. Mathematics
D. Both A and B
5. Which of the following is not the phase of OR methodology? D

A. Formulating a problem
B. Constructing a model
C. Establishing controls
D. Controlling the environment
6. Operations Research uses models to help the management to determine its C

_____________ scientifically
A. Policies
B. Actions
C. Both A and B
7. In a Linear Programming Problem functions to be maximized or minimized are B

called ______________.
A. constraints
B. objective function
C. basic solution
D. feasible solution
8. Mathematical model of linear programming problem is important because A

______________.
A. it helps in converting the verbal description and numerical data into

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
9. Graphical method of linear programming is useful when the number of decision B

variable are ______________.
A. 1
B. 2
C. 3
D. 4
10. This innovative science of Operations Research was discovered during ------------- C
A. Civil War
B. World War I
C. World War II
D. Industrial Revolution
11. The feasible solution of a L.P.P. belongs to D

A. First and second quadrant
B. First and third quadrant
C. Second quadrant
D. Only in the first quadrant
12. Operation research approach is typically based on the use of _______. B
A. physical model.
B. mathematical model.
C. iconic model.
D. descriptive model.
UNIT-II A
13.In maximization cases , ---------- - are assigned to the artificial variables as their
coefficients in the objective function
A. + M
B. -M
C. Zero
D. None of these
14. Key element is also known as ______________. D
A. slack
B. surplus
C. artificial
D. pivot
15. ______________ is a mathematical technique used to solve the problem of A
allocating limited resource among the competing activities.
A. Linear Programming problem
B. Assignment Problem
C. Replacement Problem
D. Non-linear Programming Problem
16. If the given Linear Programming Problem is in its standard form then primal- B
dual pair is ______________.
A. symmetric
B. un symmetric
C. square
D. triangle
17. Feasible solution satisfies __________ C
A. Only constraints
B. only non-negative restriction
C. A and B both
D. Optimum solution
18. In simplex method, we add ---------------- variables in the case of ‘=’ C
A. Slack Variable
B. Surplus Variable
C. Artificial Variable
19.The dual of the dual is ______________. D
A. dual-primal
B. primal-dual
C. dual
D. primal
20. The first step in formulating a linear programming problem is D
A) Identify any upper or lower bound on the decision variables
B) State the constraints as linear combinations of the decision variables
C) Understand the problem
D) Identify the decision variables
21. Linear Programming Problem is a technique of finding the ______________. A
A. optimal value
B. approximate value
C. initial value
D. infeasible value
22. . The cost of a slack variable is _________. A
A. 0
B. 1
C. 2
D. -1
23. The cost of a surplus variable is _________. A
A. 0
B. 1
C. 2
D. -1
24 Which of the terms is not used in a linear programming problem C

A. Slack variables
B. Objective function
C. Concave region
D. Feasible solution
UNIT-III D
25 Optimal solution of an assignment problem can be obtained only if
A. Each column has only one zero element
B. Each row has at least one zero element
26. The assignment algorithm was developed by ______________ method. A
A. HUNGARIAN
B. VOGELS
C. MODI
D. TRAVELING SALES MAN
27. The solution to a transportation problem with m-sources and n-destinations is D

feasible if the numbers of allocations are ______________.
A. m+n
B. mn
C. m-n
D. m+n-1
28. The assignment problem is always a ______________matrix. B
A. circle
B. square
C. rectangle
D. triangle
29. Maximization assignment problem is transformed into a minimization problem C

by______________.
A. adding each entry in a column from the maximum value in that column
B. subtracting each entry in a column from the maximum value in that column
C. subtracting each entry in the table from the maximum value in that table
D. adding each entry in the table from the maximum value in that table
30 If a transportation problem has four origins and five destinations, the LP B

formulation of the problem will have
A.5 constraints
B.9 constraints
C.18 constraints
D.20 constraints
31. When the total demand is equal to supply then the transportation problem is said A
to be ______________.
A. balanced
B. unbalanced
C. maximization
D. minimization
32. For finding an optimum solution in transportation problem ______________ C

method is used.
A. Simplex
B. Big-M
C. MODI method
D. Hungarian
33. The assignment problem is a special case of transportation problem in which D

______________.
A. number of origins are less than the number of destinations
B. number of origins are greater than the number of destinations
C. number of origins are greater than or equal to the number of destinations
D. number of origins equals the number of destinations
34. In the transportation table, empty cells will be called ______________. B
A. occupied
B. unoccupied
C. no
D. finite
35. The similarity between assignment problem and transportation problem is D

______________.
A. both are rectangular matrices
B. both are square matrices
C. both can be solved y graphical method
D. both have objective function and non-negativity constraints
36.In assignment problem of maximization, the objective is to maximise— A
A. Profit
B. optimization
C. cost
UNIT-IV D
37 A mixed strategy game can be solved by ______________.
A. Matrix method
B. Graphical method
C. Algebraic method
D. All of the above
38.When the sum of gains of one player is equal to the sum of losses to another C
player in a game, this situation is known as ______________.
A. two-person game
B. prisoners’ dilemma.
C. zero-sum game
D. non-zero-sum game
39. A type of decision- making environment is ---- D
A. certainty
B. risk
C. uncertainty
D. all of the above
40. Which of the following describes a Nash equilibrium? B

A. A firm chooses its dominant strategy, if one exists.
B. Every competing firm in an industry chooses a strategy that is optimal given the
choices of every other firm.
C. Market price results in neither a surplus nor a shortage.
D. All firms in an industry are earning zero economic profits.
41. A game is said to be fair if ______________. A
A. lower and upper values are zero
B. only lower value to be zero
C. only upper value to be zero
D. lower and upper values are not equal to zero
42.In game theory, the outcome or consequence of a strategy is referred to as the— A
A. payoff.
B. penalty.
C. reward.
D. end-game strategy.
43.What happens when minimax and maximin values of the game are same? C
A. No solution exists
B. Solution is mixed
C. Saddle point exists
44.For analyzing the problem , decision – makers should normally study – A
A. Its qualitative aspects
B. Its quantitative aspects
C. Both A and B
D. Neither A and B
45. _____________is used to reduce the game. D
A. Transportation Problem
B. Assignment Problem
C. Dual simplex method
D. Graphical Method
46 In a mixed strategy game A
A. No saddle points exists
B. each player always selects same strategy
C. Each player always selects same strategy without considering other player’s choice
D. all of the above
47. Which of the following is a zero-sum game? B
A. Prisoners' dilemma
B. Chess
C. A cartel member's decision regarding whether or not to cheat
D. All of the above.
48. Which theory concerns making sound decisions under conditions of certainty, risk C
and uncertainty?
A. Game Theory
B. Network Analysis
C. Decision Theory
UNIT-V A
49. The problem of replacement is felt when job performing units fail
______________.
A. suddenly and gradually
B. gradually
C. suddenly
D. neither gradually nor suddenly
50. The group replacement policy is suitable for identical low cost items which are C
likely to ______________.
A. fail suddenly
B. fail completely and suddenly
C. fail over a period of time
D. be progressive and retrogressive
51. The average annual cost will be minimized by replacing a machine when_____. A
A. average cost to date is equal to the current maintenance cost
B. average cost to date is greater than the current maintenance cost
C. average cost to date is less than the current maintenance cost.
D. next year running cost in more than average cost of nth year
52. In 2 jobs by m machine sequencing, a line at 45° represents: D
A. Job 1 is idle.
B. Job 2 is idle.
C. Both jobs are idle.
D. No job is idle.
53. In sequencing, an optimal path is one that minimizes A
A. Elapsed time
B. Idle time,
C. Processing time
D. Ready time.
54. The objective of sequencing problem is ______. C
A. To find the order in which jobs are to be made
B. To find the time required for completing all the jobs on hand.
C. To find the sequence in which jobs on hand are to be processed to

minimize the total time required for processing the jobs.
D. To maximize the effectiveness.
55. If there are ‘n’ jobs and ‘m’ machines, there will be _____ sequences of doing the B
jobs.
A. n × m
B. (n!) m
C. n m
D. none of above.
56. In solving 2 machine and ‘n’ jobs, the following assumption is wrong: D
A. No passing is allowed
B. Processing times are known,
C. Handling time is negligible,
D. The time of processing depends on the order of machining.
57. The following is one of the assumptions made while sequencing ‘n’ jobs on 2 D
machines:
A. Two jobs must be loaded at a time on any machine.
B. Jobs are to be done alternatively on each machine.
C. The order of completing the jobs has high significance.
D. Each job once started on a machine is to be performed up to completion on that
machine.
58 In jobs A to E have process times as 5, 1, 9, 3,10 on first machine and2, 6, 7, 8,4 on D

second machine, then the optimal sequence is:
A. ECDAB
B. ABCDE
C. BCDEA
D.BDCEA.
59. In jobs A to D have process times as 5, 6, 8, 4 on first machine and 4, 7, 9, 10 on D

second machine, then the optimal sequence is:
A. CDAB
B. ABCD
C. BCDA
D. DBCA.
60. What is concerned with the prediction of replacement costs and determination of B
the most economic replacement policy?
A. Search Theory
B. Theory of replacement
C. Probabilistic Programming
D None of the above
Decision Science

a) Individual
b) Team
c) Critical
Answer- : (b)

Answer-:(c)

d) List payoffs
Answer-:(b)

d) All of the above
Answer -: (d)


b) Maximin
c) Maximax
d) Minimax
Answer-:(c)
Answer-:(a)

a) Bayes'.
b) Laplace.
c) minimax.
d) Hurwicz.
Answer-: (b)

Answer-:(a)

b) corner point.
Answer-: (d)

a) the origin.
Answer-:(b)
Maximize 12X + 10Y
Subject to:
4X + 3Y ch7 <= 480
2X + 3Y ch7 <= 360
all variables >= 0
a) (40,48)
b) (120,0)
c) (180,120)
d) (30,36)
Answer-: (b)
Answer-: (b)
a) labor capacity

Answer-: (c)
a) T + 10 > 0
b) T > 10
c) T ≤10
Answer-:(c)
d) all of the above
Answer-: (a)


Answer-: (a)
a) Max 5xy
b) Min 4x + 3y + (2/3)z
c) Max 5x2+ 6y2
d) Min (x1 + x2)/x3
Answer-: (b)

Answer-: (c)
a) optimal.
b) feasible.
c) infeasible.
d) semi-feasible.
Answer-: (c)
Answer-: (b)
25. Slack
Answer-: (b)

b) is degenerate.
Answer-: (d)
Answer-: (d)
b) infeasibility
c) unboundedness
Answer-: (a)
a) standard form.
b) bounded form.
c) feasible form.
Answer-: (a)
Answer-: (d)
a) middle cell.
Answer-:(d)
a) Unbalanced.
b) Degenerate.
c) Infeasible.
d) Optimal.
Answer-: (c)
Answer-: (b)
34. The table
b) Infeasible.
c) degenerate.
d) all of the above
Answer-: (c)
a) MODI method
d) Hungarian method
Answer-: (d)
a) utility curve.
c) Laplace curve.
d) benefit curve.
Answer-:(a)

Answer-: (a)

a) infeasible
b) degenerate
c) unbounded
d) Optimal
Answer-:(d)
a) 40
b) 60
c) 80
d) 100
Answer-: (c)
c) MODI method
Answer-:(b)
a) at least 1.
b) 0.
d) at least 2.
Answer-: (b)
than
a) m + n − 2
b) m + n − 1
c) m + n
d) m + n + 1
Answer-: (b)
Answer-: (a)
problem
Answer-: (c)

d) MODI method.
Answer-: (a)
Answer-:(d)
has been found when
Answer-: (d)
using the
b) MODI method.
Answer-: (c)
requires the use of
destinations is the
Answer-: (b)

a) the capacities
b) the flows
c) the nodes
d) the arcs
Answer-: (c)
Answer-: (b)

Answer-: (d)

Answer-:(b)
Answer-: (c)

Answer-: (d)
Answer-: (b)
Answer-: (a)

Answer-: (a)

Answer-: (d)

Answer-: (b)
Answer-: (c)

Answer-: (c)
modeled is
a) an analog model.
b) an iconic model.
Answer-: (a)

Answer-: (b)
Answer-: (c)

a) mathematical.
b) iconic.
c) analog.
d) constrained.
Answer-: (a)

a) xij.
b) xji.
c) cij.
d) cji.
Answer- a)
b) infeasibility
c) unboundedness
Answer-: (a)

change.
Answer-: (c)
a) dual price.
c) reduced cost.
d) upper limit.
Answer-: (c)

Answer- : (c )
73. In the simplex method, a tableau is optimal only if all the c j – zj values are
b) zero.
Answer- : (a )

Answer- : (a )

Answer- : (a )

a) the axes
b) the flow
c) the nodes
d) the arrows
Answer- : (c )

a) xij.
b) xji.
c) cij.
d) cji.
Answer- : (a )
78. Slack
Answer-: (b)
problem
Answer- : (c )
Answer- : (d )

Answer- : (a )

a) Controllable
b) Uncontrollable
c) Parameters
Answer- : (a )
83. A model is
b) An approximation
d) All of the above
Answer- :(d )

a) An iconic model
c) A verbal model
Answer- : (a )
d) All of the above
Answer- : (c )

b) Scientific
c) Intuitive
d) All of the above
Answer- : (a )

Answer- : (d )

d) All of the above
Answer- : (d )

a) Military
b) Business
d) All of the above
Answer- : (d )

a) Feasible
b) Non feasible
c) Optimal
d) Non optimal
Answer- : (c )

a) Quantified
b) Qualified
c) Feasible
d) Optimal
Answer- : (a )
behaviour.
a) Waiting line
b) Net work
c) Decision
d) Simulation
Answer- : (a )

a) iconic
b) mathematical
c) analogue
d) schematic
Answer- : (a )

a) Iconic
b) Mathematical
c) Analogue
Answer- : (b )
a) Iconic
b) mathematical
c) analogue
Answer- : (c )

a) Limitations
b) Requirements
d) all of the above
Answer- : (d )

d) all of the above
Answer- : (d )

d) all of the above
Answer- : (d )

Answer- : (d )
a) Money
b) Man power
c) Machine
d) all of the above
Answer- : (d )
a) 0.893
b) 0.714
c) 1.607
d) 0.375
Answer-: (c)
service facility?
a) 0.893 minutes
b) 0.321 minutes
c) 0.714 minutes
d) 1.607 minutes
Answer-: (b)
a) 0.217
b) 0.643
c) 0.321
Answer-: (d)
a) service cost
b) facility cost
c) calling cost
d) waiting cost
Answer-: (d)
e) 0.217
f) 0.643
g) 0.286
h) 0.714
Answer-: (c)
Answer-: (b)
Answer-: (b)
n) channel.
o) steady state.
Answer-: (a)
Answer-: (a)
Answer-: (b)
Answer-: (a)

Answer-: (b)
waiting are called
y) queuing facts.
Answer-: (d)

a) p12
b) p23
c) p14
d) p43
Answer-: (c)
Answer-: (a)

Answer-: (a)
a) steady state.
b) final state.
c) origin state.
d) absorbing state.

Answer-: (d)

d) all of the above
Answer-: (d)

c) (a) and (d)
probabilities.
Answer-:(c)
Answer-: (d)

Answer-: (d)
This is called
b) stable mobility.
Answer-: (d)
Answer-: (b)
a) identity matrix.
Answer-: (d)
a) Transient state.
Answer-:(c)
formula:
a) n(n+1)=n(n)Pn
b) n(n+1)=n(0)P
c) n(n+1)=(n+1)P
d) n(n+1)=n(n)P

simple model.
Answer-: (b)
a) 0.10
b) 0.20
c) 0.42
d) 0.47
Answer-: (d)
Answer-: (d)
gg) real system.
hh) computer model.
Answer-: (a)

b) state vector
Answer-: (c)

Answer-: (c)

a) risk analysis.
Answer-: (c)

Answer-: (b)
a) 200(r)
b) r + 300
c) 300 + 500(r)
d) 300 + r(200)
Answer-: (d)

a) Excel and Lotus.
Answer-: (c)

Answer-:( b)
Simulation
1. Simulation
2. 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) implementation.
b) validation.
c) verification.
d) repetition.
5. 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.
d) events.

the mean.




b) Run the simulation for many days many times, i.e., using multiple sets of random numbers.
numbers.


system.
a) Develop
b) Analyze
c) Multiply
d) Duplicate


a) Divisibility
b) Proportionality
c) Additively
d) all of the above
Answer- : d )
a) Equality
b) Inequality
c) Uncertain
d) all of the above
Answer- : b )

Answer- : a )
d) all of the above
Answer- : c )

Answer- : a )

d) Both (a) and (b)
Answer- : c )

c) Linear equations
d) All the above
Answer- : d )
a) Feasible region
Answer- : a )

Answer- : d )

a) <=.
b) >.
c) =.
d) All the above
Answer- : b )

Answer- : c )
a) Data
b) Decisions
c) Constraints
d) A spread sheet
Answer- : d )

b) Constraints
c) Points
d) All the above
Answer- : b )
feasible region is
a) Above lines
b) Below the lines
c) Unbounded
Answer- : b )
a) Network
c) assignment
d) none of these
Answer- : a )
a) Predecessor
b) Successor
c) Dummy
d) End
Answer- : c )

a) Equality
b) Non equality
Answer- : c )
a) Predecessor
b) Successor
c) Dummy
d) End
Answer- : b )
………..event.
a) Merge
b) Net
c) Burst
Answer- : c )
Answer- : d )
……….activity.
a) Predecessor
b) Successor
c) Dummy
d) End
Answer- : a )

Answer- : a )

Answer- : c )
a) Net work
b) Critical path
Answer- : b )

a) Net work
b) Critical path
Answer- : c )
a) Iconic
b) mathematical
c) analogue
Answer- : d )

a) Game theory
b) Charts
c) Graphs
d) All the above
Answer- : a )

d) all of the above
Answer- : b )
a) Goal programming
b) Markov analysis
d) Queuing theory
Answer- : b )
Decision Science

a) Individual
b) Team
c) Critical
Answer- : (b)

Answer-:(c)

d) List payoffs
Answer-:(b)

d) All of the above
Answer -: (d)


b) Maximin
c) Maximax
d) Minimax
Answer-:(c)
Answer-:(a)

a) Bayes'.
b) Laplace.
c) minimax.
d) Hurwicz.
Answer-: (b)

Answer-:(a)

b) corner point.
Answer-: (d)

a) the origin.
Answer-:(b)
Maximize 12X + 10Y
Subject to:
4X + 3Y ch7 <= 480
2X + 3Y ch7 <= 360
all variables >= 0
a) (40,48)
b) (120,0)
c) (180,120)
d) (30,36)
Answer-: (b)
Answer-: (b)
a) labor capacity

Answer-: (c)
a) T + 10 > 0
b) T > 10
c) T ≤10
Answer-:(c)
d) all of the above
Answer-: (a)


Answer-: (a)
a) Max 5xy
b) Min 4x + 3y + (2/3)z
c) Max 5x2+ 6y2
d) Min (x1 + x2)/x3
Answer-: (b)

Answer-: (c)
a) optimal.
b) feasible.
c) infeasible.
d) semi-feasible.
Answer-: (c)
Answer-: (b)
25. Slack
Answer-: (b)

b) is degenerate.
Answer-: (d)
Answer-: (d)
b) infeasibility
c) unboundedness
Answer-: (a)
a) standard form.
b) bounded form.
c) feasible form.
Answer-: (a)
Answer-: (d)
a) middle cell.
Answer-:(d)
a) Unbalanced.
b) Degenerate.
c) Infeasible.
d) Optimal.
Answer-: (c)
Answer-: (b)
34. The table
b) Infeasible.
c) degenerate.
d) all of the above
Answer-: (c)
a) MODI method
d) Hungarian method
Answer-: (d)
a) utility curve.
c) Laplace curve.
d) benefit curve.
Answer-:(a)

Answer-: (a)

a) infeasible
b) degenerate
c) unbounded
d) Optimal
Answer-:(d)
a) 40
b) 60
c) 80
d) 100
Answer-: (c)
c) MODI method
Answer-:(b)
a) at least 1.
b) 0.
d) at least 2.
Answer-: (b)
than
a) m + n − 2
b) m + n − 1
c) m + n
d) m + n + 1
Answer-: (b)
Answer-: (a)
problem
Answer-: (c)

d) MODI method.
Answer-: (a)
Answer-:(d)
has been found when
Answer-: (d)
using the
b) MODI method.
Answer-: (c)
requires the use of
destinations is the
Answer-: (b)

a) the capacities
b) the flows
c) the nodes
d) the arcs
Answer-: (c)
Answer-: (b)

Answer-: (d)

Answer-:(b)
Answer-: (c)

Answer-: (d)
Answer-: (b)
Answer-: (a)

Answer-: (a)

Answer-: (d)

Answer-: (b)
Answer-: (c)

Answer-: (c)
modeled is
a) an analog model.
b) an iconic model.
Answer-: (a)

Answer-: (b)
Answer-: (c)

a) mathematical.
b) iconic.
c) analog.
d) constrained.
Answer-: (a)

a) xij.
b) xji.
c) cij.
d) cji.
Answer- a)
b) infeasibility
c) unboundedness
Answer-: (a)

change.
Answer-: (c)
a) dual price.
c) reduced cost.
d) upper limit.
Answer-: (c)

Answer- : (c )
b) zero.
Answer- : (a )

Answer- : (a )

Answer- : (a )

a) the axes
b) the flow
c) the nodes
d) the arrows
Answer- : (c )

a) xij.
b) xji.
c) cij.
d) cji.
Answer- : (a )
78. Slack
Answer-: (b)
problem
Answer- : (c )
Answer- : (d )

Answer- : (a )

a) Controllable
b) Uncontrollable
c) Parameters
Answer- : (a )
83. A model is
b) An approximation
d) All of the above
Answer- :(d )

a) An iconic model
c) A verbal model
Answer- : (a )
d) All of the above
Answer- : (c )

b) Scientific
c) Intuitive
d) All of the above
Answer- : (a )

Answer- : (d )

d) All of the above
Answer- : (d )

a) Military
b) Business
d) All of the above
Answer- : (d )

a) Feasible
b) Non feasible
c) Optimal
d) Non optimal
Answer- : (c )

a) Quantified
b) Qualified
c) Feasible
d) Optimal
Answer- : (a )
behaviour.
a) Waiting line
b) Net work
c) Decision
d) Simulation
Answer- : (a )

a) iconic
b) mathematical
c) analogue
d) schematic
Answer- : (a )

a) Iconic
b) Mathematical
c) Analogue
Answer- : (b )
a) Iconic
b) mathematical
c) analogue
Answer- : (c )

a) Limitations
b) Requirements
d) all of the above
Answer- : (d )

d) all of the above
Answer- : (d )

d) all of the above
Answer- : (d )

Answer- : (d )
a) Money
b) Man power
c) Machine
d) all of the above
Answer- : (d )
a) 0.893
b) 0.714
c) 1.607
d) 0.375
Answer-: (c)
service facility?
a) 0.893 minutes
b) 0.321 minutes
c) 0.714 minutes
d) 1.607 minutes
Answer-: (b)
a) 0.217
b) 0.643
c) 0.321
Answer-: (d)
a) service cost
b) facility cost
c) calling cost
d) waiting cost
Answer-: (d)
e) 0.217
f) 0.643
g) 0.286
h) 0.714
Answer-: (c)
Answer-: (b)
Answer-: (b)
m)queue discipline.
n) channel.
o) steady state.
Answer-: (a)
Answer-: (a)
Answer-: (b)
Answer-: (a)

Answer-: (b)
waiting are called
y) queuing facts.
Answer-: (d)

a) p12
b) p23
c) p14
d) p43
Answer-: (c)
Answer-: (a)

Answer-: (a)
a) steady state.
b) final state.
c) origin state.
d) absorbing state.

Answer-: (d)

d) all of the above
Answer-: (d)

c) (a) and (d)
probabilities.
Answer-:(c)
Answer-: (d)

Answer-: (d)
This is called
b) stable mobility.
Answer-: (d)
Answer-: (b)
a) identity matrix.
Answer-: (d)
a) Transient state.
Answer-:(c)
formula:
a) n(n+1)=n(n)Pn
b) n(n+1)=n(0)P
c) n(n+1)=(n+1)P
d) n(n+1)=n(n)P

simple model.
Answer-: (b)
a) 0.10
b) 0.20
c) 0.42
d) 0.47
Answer-: (d)
Answer-: (d)
gg) real system.
hh) computer model.
Answer-: (a)

b) state vector
Answer-: (c)

Answer-: (c)

a) risk analysis.
Answer-: (c)

Answer-: (b)
a) 200(r)
b) r + 300
c) 300 + 500(r)
d) 300 + r(200)
Answer-: (d)

a) Excel and Lotus.
Answer-: (c)

Answer-:( b)
Simulation
1. Simulation
2. 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) implementation.
b) validation.
c) verification.
d) repetition.
5. 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.
d) events.

the mean.




b) Run the simulation for many days many times, i.e., using multiple sets of random
numbers.
numbers.


system.
a) Develop
b) Analyze
c) Multiply
d) Duplicate


a) Divisibility
b) Proportionality
c) Additively
d) all of the above
Answer- : d )
a) Equality
b) Inequality
c) Uncertain
d) all of the above
Answer- : b )

Answer- : a )
d) all of the above
Answer- : c )

Answer- : a )

d) Both (a) and (b)
Answer- : c )

c) Linear equations
d) All the above
Answer- : d )
a) Feasible region
Answer- : a )

Answer- : d )

a) <=.
b) >.
c) =.
d) All the above
Answer- : b )

Answer- : c )
a) Data
b) Decisions
c) Constraints
d) A spread sheet
Answer- : d )

b) Constraints
c) Points
d) All the above
Answer- : b )
feasible region is
a) Above lines
b) Below the lines
c) Unbounded
Answer- : b )
a) Network
c) assignment
d) none of these
Answer- : a )
a) Predecessor
b) Successor
c) Dummy
d) End
Answer- : c )

a) Equality
b) Non equality
Answer- : c )
a) Predecessor
b) Successor
c) Dummy
d) End
Answer- : b )
………..event.
a) Merge
b) Net
c) Burst
Answer- : c )
Answer- : d )
……….activity.
a) Predecessor
b) Successor
c) Dummy
d) End
Answer- : a )

Answer- : a )

Answer- : c )
a) Net work
b) Critical path
Answer- : b )

a) Net work
b) Critical path
Answer- : c )
a) Iconic
b) mathematical
c) analogue
Answer- : d )

a) Game theory
b) Charts
c) Graphs
d) All the above
Answer- : a )

d) all of the above
Answer- : b )
a) Goal programming
b) Markov analysis
d) Queuing theory
Answer- : b )
Decision Science (204)
MCQ Question Bank
01. The objectives such as minimizing the total transportation cost are considered as
A Assignment Models
B Transportation Models
C Destination Models
D Origins Models
Answer b
02. Which of the following is true about assignment problem:

A An assignment problem can be solved by enumeration method
B An assignment problem can be solved by Floods technique
C An assignment problem can be solved by Hungarian method
D All of the above
Answer d
03. In transportation problem, the points of demand is classified as

A Transportation
B Sources
C Destinations
D Origins
Answer c
04. In transportation problem, the points of supply is classified as
A Transportation
B Sources
C Destinations
D Cost
Answer b
05. In Assignment Problem the variable of decision variable is
A Any positive value
B One or zero
C Two or one
D Any value
Answer b
06. An artificial source added to a transportation table when total demand is greater than total
supply is called -------------
A Filler source
B Dummy destination
C Dummy source
D Supply source
Answer c
07. What is said to be present when total demand equals total supply in a transportation
problem?
A An equilibrium problem
B A harmonized problem
C A balanced problem
D All of the above
Answer c
08. Which of the following statements is accurate with regard to assignment problems?
A A job can be assigned to more than one workman.
B Only one workman can be assigned to each job.
C A workman can be assigned to more than one job.
D both a and c
Answer b
09. The matrix of assignment problem is always a-----------

A Identity matrix
B Rectangular matrix.
C Transpose matrix.
D Square matrix.
Answer d
10. Which of the following accurately describes step of the NWCM , after making the initial
allocation of units in the northwest cell?
A Move down first, and then move right.
B Move right first, and then move down.
C Move right or down first, depending on whether the demand requirement
or the supply capacity, respectively, is exhausted first.
D Move diagonally first
Answer c
11. In a transportation problem, units are allocated from sources to destinations

A At a maximum cost
B At a minimum cost
C At a minimum profit
D At a minimum revenue
Answer b
12. In an assignment. problem, in Row Reduction step.

A Subtract all the element from highest value of matrix
B Subtract smallest value of each row from its corresponding row element
C Subtract each value of a row from its largest value of that corresponding
row.
D Subtract smallest value of each column from its corresponding column
element
Answer c
13. Which of the following is an assumption of assignment problems?
A The number of assignees and the number of jobs are the same
B The objective is to minimize the number of assignments not made.
C Each job is to be performed by exactly one assignee.
D a. and c. only.
Answer d
14. In North-West Corner Rule, if the demand in the column is satisfied one must move to
the ---------------
A Left cell in the next column,
B Down cell in the next row
Answer c
15. In transportation problem if total supply greater than total demand we add -------------. (if
supply points are along row wise)
A Dummy row with cost, O.
B Dummy column with cost 0.
C Dummy row with cost 1.
D Dummy column with cost 1.
Answer b
16. When the problem involves the allocation of n different facilities to n different tasks, it is
often termed as
A Transportation problem
B Assignment problem.
C Queue problem
D Facility planning
Answer b
17. In an assignment problem

A The number of rows and columns must be equal.
B The number of rows must equal or exceed the number of columns.
C The number of columns must equal or exceed the number of rows.
D The number of rows must exceed the number of columns.
Answer a
18. In North-West Corner Rule, if the supply in the row is satisfied one must move ------------
(supply points are along the row wise)
A Down in the next row,
B Next lowest cost cell
Answer a
19. The Transportation problem is said to be balanced if -------------

A Total supply is not equal to total demand.
B Total supply is greater than total demand
C Total supply is lesser than total demand,
D Total supply is equal to total demand.
Answer d
20. The two most common objectives for the assignment problem are the minimization of ----
-------------
A Total profit or inexperience
B Total costs or inexperience
C Total costs or total time
D Total sales or inexperience
Answer c
21. An assignment algorithm was developed by-----------

A Hungarian
B Vogel's
C Modi
D Erlang
Answer a
22. The Least cost method

A Is used to find an initial feasible solution
B Is used to find an optimal solution
C Is based on the concept of minimizing opportunity cost
D None of the given
Answer c
23. The North-West Corner Rule is used to find-------------

A An Initial feasible solution,
B An optimal solution.
C Non optimal solution.
D None of these
Answer a
24. The only restriction for the initial solution of a transportation problem is that
A Demand must equal supply.
B All constraints must be satisfied.
C Nonzero quantities in a majority of the cells.
D Number of rows equal to number of columns
Answer a
25. Which of the following is not a step in the Hungarian method of assignment?
A Find the opportunity-cost table
B Draw horizontal and vertical line to cover all zeros of opportunity- cost
table
C Enumerate all possible solutions
D Revise the opportunity-cost table
Answer c
26. Maximization case in transportation problem the objective is to---------------

A Maximize the total profit.
B Minimize the total loss .
C Neither maximize nor minimize,
D Optimal cost.
Answer a
27. In a transportation problem, when number of occupied cells is less than number of rows
plus number of columns we say that solution is
A Feasible solution
B Multiple solution
C Degenerate solution
D Unbalanced solution
Answer c
28. Simulation
A Does not guarantee optimality.
B Flexible and does not require the assumptions of theoretical models+
C Allows testing of the system without affecting the real system.
D All of the above
Answer d
A Real system.
B Computer model.
Answer a
30. All of the following are various ways of generating random numbers except
A Table of random numbers
B Use of computer
C Spin of roulette wheel
D Fibonacci series
Answer d

A Describes future behavior of the system.
B Optimizes the system.
C Leads to higher order decision making.
D All of the above.
Answer a
32. Markov analysis assumes that the states are both---- and-----
A Finite, recurrent
B Infinite, absorbing
C Generally inclusive, always independent
D Collectively exhaustive, mutually exclusive
Answer d
A Identity matrix.
B Transition elasticity.
C Matrix of state probabilities.
D Matrix of transition probabilities
Answer d
34. Which technique is used to imitate an operation prior to actual performance?
A Simulation
B Queuing Models
C Inventory Models
D Game Theory
Answer a
35. Values for the probabilistic inputs to a simulation are

A Selected by the decision maker.
B Controlled by the decision maker.
C Randomly generated based on historical information.
D Calculated by fixed mathematical formulas
Answer c

A Increasing ones understanding of a problem.
B Obtaining a relatively inexpensive solution to a problem.
C Obtaining an optimal solution to a problem,
D None of the above
Answer a
37. The following is not an assumption of Markov analysis..

A There is an infinite number of possible states
B The probability of changing states remains the same over time.
C We can predict any future state from the previous state and the matrix of
transition probabilities.
D All of the above
Answer a
38. A condition in which state probabilities do not change after a long number of period is
A Constant
B Redundant
C Stagnant
D Equilibrium
Answer d
39. The probability that an entity in the Markov process is in a particular state is indicated by
A Transition Matrix
B State Probability Vector
C Identity Matrix
D Equilibrium matrix
Answer a

A Construct a numerical model
B Validate the model.
C Set up possible courses of action for testing.
D Define the problem
Answer a
41. Which of the following statements is incorrect regarding the advantages of simulation-
A Simulation is relatively easy to explain and understand.
B Simulation guarantees an optimal solution.
C Simulation models are flexible.
D A simulation model provides 'a convenient experimental laboratory for the real
system
Answer b
42. Which of the following are advantages of simulation?

A Simulation allows "what-if 7' type of questions.
B Simulation can usually be performed by hand or using a smell calculator.
C Simulation does not interfere with the real-world system.
D a and c only
Answer d
A Using Baye's theorem,
B Analyzing presently known probabilities.
C Time series forecasting.
D The maximal flow technique
Answer b
44. In transition probability matrix

A The sum of each column is 1
B The sum of each column is 0
C The sum of each row is 1
D The sum of each row is 0
Answer c
45. Markov Analysis studies
A Market
B Brand Name
C Brand Switching Behavior
D None of the above
Answer c
46. The simulation model uses the mathematical expressions and logical relationships of the
A Real system.
B Computer model
Answer d
47. The fax machine in an office is very unreliable. If it was working yesterday, there is a
90% chance it will work today. if it was not working yesterday, there is a 5% chance it
will work today. The probability that it is not working today, if it was not working
yesterday, is
A 0.90
B 0.10
C 0.05
D 0.95
Answer d
48. In Markov analysis, we assume that the states are
A Mutually exclusive
B Collectively Exhaustive
C Finite
D All of the above
Answer d
49. Simulation is a
A Optimization method
B Descriptive Method
C Measuring Method
D All of the above
Answer b
50. A market research organization studied the car purchasing behavior in a certain region. It
was found that there are currently 50000 small car owner and 30,000 large car owners in
the region. What is current market share vector?
A U =[ 0.5 0.3 ]
B V [0.62 0.38)
C W = [0.6 0.4]
D Can't say
Answer a
51. For a situation with weekly purchase of either an Coke or Pepsi cold drink,
A The weekly purchase is the trial and the cold drink is the state.
B The weekly purchase is the state and the cold drink is the trial.
C The weekly purchase is the trend and the cold drink is the transition.
D The weekly purchase is the transition and the cold drink is the trend.
Answer a
52. In a matrix of transition probability, the diagonal element represents.

A Gain
B Loss
C Retention
D None of the above
Answer c
53. Which of the following is not true?

A The probabilities of switching from one state to another are called transition
probabilities.
B Markov chain analysis assumes that the given system has a finite number of
states.
C Switching of different brands of soap within a given set is likely to be a case of
non-absorbing chains.
D An absorbing state is one which if a customer reaches in, then be has to
immediately leave it and return to the initial state
Answer d
54. An LPP deals with problems involving only ------------------

A Single objective
B Multiple objectives.
C Two objective.
D None of these.
Answer a
55. In LPP, feasible solution -----------------

A Must satisfy all the constraints of the problem simultaneously
B Need not satisfy all of the constraints, only some of them
C Must optimize the value of the objective function.
D Must be a corner point of the feasible region.
Answer a
56. While solving LPP graphically to find optimum solution, which of the method is used
A Corner point method
B lso- Line method
C Simplex method
D Both a and b
Answer d
57. Which of the following is associated with any LPP

A Simulated solution
B Optimum solution
C Network flow
Answer b
58. Which of the following is not associated with any LPP

A Feasible solution
B Optimum solution
C Basic solution
Answer d
59. Which of the following is not true about feasible region

A It cannot be determined in a graphical solution of an LPP.
B It is independent of the objective function.
C It implies that there must be a convex region satisfying all the constraints.
D An extreme point of the convex feasible region gives the optimum
solution.
Answer a
60. The constraints in LPP model represent

A Availability
B Requirement
C Objective
D .Both a and b
Answer d
61. In mathematical programming, the goal represented by objective function includes

A Profit value
B Total cost and revenue
C Production capacity
D all of the above
Answer d
62. In LPP maximization problem, the optimal solution occurring at the corner point
yields the
A Mid value of objective function
B Highest value of objective function
C Lowest value of objective function
D Mean value of objective function
Answer b
63. Practically multiple optimal solutions

A are infeasible
B are unbounded
C are degenerate
D provide management with greater flexibility in selecting and using
resources
Answer d
64. Infeasibility means that the number of solutions to the linear programming problem that
A Zero.
B At least 1.
C All.
D At least 2.
Answer a
65. Graphical method of linear programming is useful when the number of decision variables
is
A 1
B 2
C 3
D More than 3
Answer b
66. In LPP, the area bounded by all the given constraints is

A Non feasible region
B Basic solution
C Feasible region
D Optimum basic feasible solution
Answer c

A Tell about how much or how many of something to produce, invest,
purchase, hire, etc,
B Represent the values of the constraints.
C Measure the objective function.
D Must exist for each constraint.
Answer a
68. Multiple solution exist in a LPP when
A One of the constraint is redundant
B Objective function is parallel to one of the constraints
C Two constraints are parallel
D All of the above
Answer b
69. The overall goal stated as to represent the function of decision variable in LPP is best
classified as
A Constraint function
B Objective function
C Functional modeling
D Programme function
Answer b
70. In a decision theory problem under complete uncertainty, which one of the following
approaches will not be possible?
B Maximin
C Minimax
D Hurwitz
Answer a
71. What will you obtain when you sum the profit for each combination of a state and action
times the probability of the occurrence of the state?
B Expected opportunity loss
C Expected value of perfect information
D None of the above
Answer a
72. Which of the following refers to the chance occurrences that can affect the outcome of an
individual's decision?
A Payoff
B State of nature
C Course of action
D Decision criteria
Answer b
73. A situation in which a decision maker knows all of the possible outcomes of a decision
and also knows the probability associated with each outcome is referred to as
A Certainty
B Risk
C Uncertainty
D Competition
Answer b
74. A matrix that, for each state of nature and strategy, shows the difference between a
strategy's payoff and the best strategy's payoff is called
A maximin matrix
B a minimax regret matrix
C payoff matrix
D maximax matrix
Answer b
75. Which theory concerns making sound decisions under conditions of certainty, risk and
uncertainty
A Game Theory
B Network Analysis
C Decision Theory
D None of the above
Answer c
76. A pessimistic decision making criterion is
A maximax
B equally likely
C maximin
D decision making under certainty
Answer c
77. In decision making under ------------, there are several possible outcomes for each
alternative, and the decision maker knows the probability of occurrence of each outcome.
A risk
B utility
C certainty
D probability
Answer a
78. Each player should follow the same strategy regardless of the other player's strategy in
which of the following games?
A Constant Strategy
B Mixed Strategy
C Pure Strategy
D Dominance strategy
Answer c
79. In a zero-sum game,

A what one player wins, the other loses.
B the sum of each player's winnings if the game is played many times must be
zero.
C the game is fair each person has an equal chance of winning.
D long-run profits must be zero.
Answer a
80. In a decision theory problem under complete uncertainty, which one of the following
approaches will not be possible?
B Maxmin
C Minimax
D Hurwicz
Answer a
81. For decision making under uncertainty, identify the decision rule that is appropriate for
the optimist.
A Laplace
B Maximax
C Minimax regret
D Maxmin
Answer b
82. The equally likely decision criteria is also known as

A Bayes
B Laplace
C Minimax
D Hurwicz
Answer b
83. The criteria of expected monetary value is used for making decisions under
A Certainty
B Uncertainty
C Risk
D all of the above
Answer c
84. The maximax criteria is

A Optimistic
B Neutral
C Pessimistic
D Can be any one of the above
Answer a
85. Which of the following might be viewed as ar-pessimistic decision criterion?

A Hurwicz criterion
B Maximin
C Maximax
D Minimax
Answer b
86. In a zero-sum game,

A what one player wins, the other loses.
B the sum of each player's winnings if the game is played many times must be zero.
C the game is fair each person has an equal chance of winning.
D long-run profits must be zero.
Answer a
87. Point of intersection of pure strategies is called :

A Payoff
B Zero sum game
C Saddle point
D Algebraic
Answer c
88. In a maximization problem when each element is subtracted from largest element.. the
resultant matrix indicates
A Pay-off matrix
B Game matrix
C Minimum matrix
D Opportunity loss matrix
Answer d
89. A mixed strategy 2 x 2 game is solved by method.

A Sub-game method
B Algebraic method
C Dominance rule
D Saddle point method
Answer b
90. In a pure strategy game, probability of selection of his optimal strategy by a player is
A 0
B 1
C 0.5
D None of the above
Answer b
91. Point of intersection of pure strategies called :

A Value of game
B Probability of optimum strategy
C Algebraic sum
D None of the above
Answer a
92. A mixed strategy is decision of player to select :

A Same strategy
B Constant Strategy
C Different strategy
D Only one strategy
Answer c

A Bay's
B Laplace
C Hurwicz
D Maximin
Answer b
94. A decision maker who looks at the worst result for every decision, and chooses the
decision with the least disappointing possibility is using :
A Minimax regret approach
B Conservative approach
C Optimistic approach
D Equally approach
Answer b
95. The decision alternatives

A Show what might occur in the problem
B Are not under the control of the decision maker
C List the actions the decision maker can select
D All of the above
Answer c
96. Rules for selecting the best alternatives are called :

A Objective
B Outcome
C Events
D Criteria
Answer d
97. The size of payoff matrix of a game can be reduced by using the principle of
A Game inversion
B Rotation reduction
C Dominance
D Game transpose
Answer d
98. Game theory models are classified by the

A Number of players
B Sum of all payoffs
C Number of strategies
D All of the above
Answer d
99. Which of the following criteria is not used for decision making under uncertainty
A Maximin
B Maximax
C Minimax
D Minimize expected loss
Answer d
100. Which of the following criteria is not used for decision making under risk
A Maximize expected return
B Maximize return
C Minimize expected loss
D Knowledge of likelihood occurrence of each state of nature
Answer b
101. The difference between the expected profit under condition of risk and the
expected profit with perfect information is called
A Expected value of perfect information
B Expected marginal loss
C Expected opportunity loss
D None of the above
Answer a
102. The optimization technique which helps in minimizing total waiting and service
costs is
A Queuing Theory
B Decision Theory
C Both A and B
D None of the above
Answer a
103. The passenger and the train in queuing system describers

C Both Servers
D Both Customers
Answer a
104. In Queuing Model which cost is difficult to find

A Service cost
B Facility cost
C Calling cost
D Waiting cost
Answer b
105. A single channel system must have

A One queue discipline
B One waiting line
C One customer allowed to stand
D One stage where service is received before exiting the system.
Answer b
106. The number of customers in the waiting line means

A Service order
B Queue length
C Waiting time in queue
D None of the above
Answer c
107. Which of the following items is not a part of the queuing system?
A Arrival rate
B Service facility
C Queue
D Activity flow
Answer c
108. The Server utilization factor is also known as

A Traffic intensity
B Poisson distribution
C Exponential distribution
D Server Idleness
Answer c
109. In queue Model, M/M/2, the number of servers is

A 1
B M
C 2
D None of these
Answer b
110. The most important factors to consider in analyzing a queuing system are
A The service and arrival rate
B The nature of the calling population
C The queue discipline
D All of the above
Answer c
111. The customers are selected for service at random. This is known as
A First-come, first served
B Random service discipline
C Last come first served
D None of the above
Answer b
112. The customer who arrives at a system, move from one queue to other in multiple
server system is
A Balking
B Cropping
C Reneging
D Jockeying
Answer b
113. In a departmental store customers arrive at a rate of 15 customers per hour. The
average number of customers that can be handled by cashier is 20 per hour. The time
between successive customer is
A 5 min
B 3 min
C 4 min
D 6 min
Answer c
114. The customer who arrives at a bank, see a long line, and leaves to return another
time is
A Cropping
B Jockeying
C Balking
D Reneging
Answer c
115. In a departmental store customers arrive at a rate of 24 customers per hour. The
average number of customers that can be handled by cashier is 30 per hour. What is
service rate in this problem?
A 30
B 3
C 24
D 10
Answer a
116. The machine and the repairmen in queuing system describes

C Both Servers
D Both Customers
Answer a
117. In the A/B/C designation for queuing systems, the A term represents information
about
A Service time
B Arrival rate
C Number of channels
D Queue size
Answer b
118. For unloading cargo, queue discipline is used

A First come first served
B Last come first served
C Random come first served
D None of the above
Answer b
119. -------- is a series of related activities which result in some product or services.
A Network
B transportation mode
C assignment
D none of these
Answer a
activity.
A Predecessor
B Successor
C Dummy
D End
Answer c
121. 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 a
122. Activities that cannot be started until one or more of the other activities are
completed, but immediately succeed them are called ----------- activities
A Predecessor
B Successor
C Dummy
D End
Answer b
123. 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
124. ----------- 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
125. Activities lying on the critical path are called---------

A Net work
B Critical path
C Critical activities
D None of the above
Answer c
126. It----------- at which an activity can start.

A EST
B EFT
C LST
D LFT
Answer a
127. With respect to PERT and CPM, slack

A marks the start or completion of a task.
B is the amount of time a task may be delayed without changing the overall project
completion time.
C is a task or subproject that must be completed.
D is the latest time an activity can be started without delaying the entire project.
Answer b
Marks 1
128. An activity has an optimistic time of 15 days, a most likely time of 18 days, and a
pessimistic time of 27 days. What is its expected time?
A 60 days
B 20 days
C 18 days
D 19 days
Answer d
129. An activity has an optimistic time of 11 days, a most likely time of 15 days, and a
pessimistic time of 23 days. What is its variance?
A 16.33
B 15.6
C 4
D 2
Answer c
130. Time an activity would take assuming very unfavorable conditions is represented
by the
A Optimistic time
B Most likely time
C Pessimistic time
D Expected time
Answer c
131. In an AON network representation, the -------- represents the activities.

A Arrow
B Node
C Time estimate
D Arcs
Answer b
132. The earliest start (ES) of an activity is the ----------- earliest finish (EF) of the
immediate------------
A smallest, successors
B largest, successors
C smallest, predecessors
D largest, predecessors
Answer d
133. The time of an activity in a network can be approximated by which distribution?

A Binomial
B Normal
C Chi-square
D Beta
Answer d
134. Which of these may require the use of a dummy activity?

A Gantt Chart
B Activity-on-arrow network.
C Activity-on-node network.
D Both b and C
Answer b
135. CPM is :
A Critical Project Management
B Critical Path Management
C Critical Path Method
D Crash Project Method
Answer c
136. Activities G, P, and R are the immediate predecessors for activity W. If the
earliest finish times for the three are 12, 15, and 10, then the earliest start time for W
A is 10.
B is 12.
C is 15.
D cannot be determined. –
Answer c
137. Activities K, M and S immediately follow activity H, and their latest start times
are 14, 18, and 11. The latest finish time for activity H
A is 11.
B is 14.
C is 18.
D can not be determined.
Answer a

A is any path that goes from the starting node to the completion node.
B is a combination of all paths.
C is the shortest path.
D is the longest path.
Answer d
139. Which of the following statements regarding PERT times is true?

A Optimistic time estimate is an estimate of the minimum time an activity
will require.
B Optimistic time estimate is an estimate of the maximum time an activity
will require.
C Most likely time estimate is an estimate of the maximum time an activity
will require.
D Pessimistic time estimate is an estimate of the minimum time an activity
will require.
Answer a
140. At the completion of the forward and backward passes, the slack for an activity is
given by the
A difference between early start and early finish.
B difference between early start and latest finish.
C difference between latest start and early finish
D difference between latest start and early start
Answer d
141. A project has three paths: A--B—C has a length of 25 days. A—D—C has a
length of 15 days. A—E--C has a length of 20 days. Which of the following statements is
correct?
A A—D—C is the critical path.
B A—B—C has the most slack.
C The expected duration of the project is 25 days.
D The expected duration of this project is 60 days.
Answer c
142. With respect to PERT and CPM, slack

A is a task or subproject that must be completed.
B is the latest time an activity can be started without delaying the entire
project.
C is the amount of time a task may be delayed without changing the overall
project completion time.
D marks the start or completion of a task
Answer c
143. A dummy activity is required when

A two or more activities have the same ending events.
B the network contains two or more activities that have identical starting and
ending events.
C two or more activities have different ending events.
D two or more activities have the same starting events.
Answer b
144. PERT analysis computes the variance of the total project completion time as
A the sum of the variances of all activities in the project.
B the sum of the variances of all activities on the critical path.
C the sum of the variances of all activities not on the critical path.
D the variance of the final activity of the project.
Answer b
145. The time of activity in a project can be estimated to have a most likely completion
time of 7 days, an optimistic time of 6 days, and a pessimistic time of 9 days. Which of
the following is true of the Expected time and the variance for this activity
A 0.25 days, 7.17 days
B 7.33 days, 0.25 days
C 7.17 days, 0.25 days
D 3.67 days, 0.25 days
Answer c
146. A project's critical path is composed of activities A, B, and C. Activity A has a
standard deviation of 2, activity B has a standard deviation of 1, and activity C has a
standard deviation of 2. What is the standard deviation of the critical path?
A 25
B 9
C 3
D 5
Answer c
147. Activities A and B are both 6 days long and the only immediate predecessors to
activity C. Activity A has ES=8 and LS=8 and activity B has ES=7 and LS=10. What is
the ES of activity C?
A 14
B 15
C 16
D 13
Answer a
148. Dummy activities

A Are found in both AOA and AON networks
B Have a duration equal to the shortest non-dummy activity in the network.
C Cannot be on the critical path.
D Are used when two activities have identical starting and ending events.
Answer d
149. 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
150. ----- is the duration by which an activity can be delayed without delaying the
project.
A Total float
B latest time
C Earliest event time
D None of these
Answer a
151. ---- is the earliest starting time plus activity time.

A EST
B EFT
C LST
D LFT
Answer b
152. Generally PERT technique deals with the project of

A repetitive nature
B non- repetitive nature
C deterministic nature
D none of the above
Answer d
153. The activity which can be delayed without affecting the execution of the
immediate succeding activity determined by
A total float
B free float
C independent float
D none of the above
Answer b
154. A dummy activity is used in the network diagram when

A two parallel activities have the same tail and head events
B the chain of activities may have common event yet be independent by
themselves
C both a and b
D none of the above
Answer c
155. In sequencing objective is

A Maximize total elapsed time
B Minimize total elapsed time
C Maximize cost
D Minimize sales
Answer b
156. If P(A) = 0.6, P(B) = 0.4, P(A and B) = 0.0 , what can be said about events A and
B?
A Independent
B Mutually exclusive
C Posterior probability
D All of the above
Answer b
157. The probability of event A occurring is 0.3, while the probability that event B
occurs is 0.8. The probability that event A and event B occur simultaneously is 0.2. If it is
known that event A occurred, what is the probability that event B occurred also?
A 0.67
B 0.25
C 0.16
D 0.90
Answer a
158. A production process is known to produce a particular item in such a way that 3%
of these are defective. If three items are randomly selected as they come off the
production line, what is the probability that all three are defective (assuming that they are
all independent)?
A 0.027
B 0.09
C 0.00027
D 0.000027
Answer b
159. A company is considering producing some new products. Based on past records,
management believes that there is a 60% chance that the first product will be successful,
and a 40% chance that the second product will be successful. As these products are
completely different, it may be assumed that the success of one is totally independent of
the success of the other. If two products are introduced to the market, what is the
probability that both are successful?
A 0.12
B 0.60
C 0.24
D 0.36
Answer c
160. In a throw of coin what is the probability of getting head.

A 1
B 2
C ½
D 0
Answer c
161. In a throw of dice what is the probability of getting number greater than 5
A ½
B 1/3
C 1/5
D 1/6
Answer d
162. If two events are independent, then

A they must be mutually exclusive
B the sum of their probabilities must be equal to one
C their intersection must be zero
D None of these alternatives is correct.
Answer d
163. Probability lies between :
A -1 and +1
B 0 and 1
C 0 and n
D 0 and co
Answer b
164. A set of all possible outcomes of an experiment is called :

A Combination
B Sample point
C Sample space
D Compound event
Answer c
165. The events having no experimental outcomes in common is called :

A Equally likely events
B Exhaustive events
C Mutually exclusive events
D Independent events .
Answer c
166. The probability associated with the reduced sample space is called:
A Conditional probability
B Statistical probability
C Mathematical probability
D Subjective probability
Answer a
167. If A is any event in S and A its complement, then P(A) is equal to:
A 1
B 0
C 1-A
D 1-P(A)
Answer d
168. When certainty is involved in a situation, its probability is equal to:

A Zero
B Between-I and + 1
C Between 0 and 1
D One
Answer d
169. Which of the following cannot be taken as probability of an event?

A 0
B 0.5
C 1
D -1
Answer d
170. The term 'sample space' is used for:

A All possible outcomes
B All possible coins
C Probability
D Sample
Answer a
171. The term 'event' is used for:
A Time
B A sub-set of the sample space
C Probability
D Total number of outcomes.
Answer b
172. When the occurrence of one event has no effect on the probability of the
occurrence of another event, the events are called :
A Independent
B Dependent
C Mutually exclusive
D Equally likely
Answer a
173. The six faces of the die are called equally likely if the die is :
A Small
B Fair
C Six-faced
D Round
Answer b
174. If we toss a coin and P(T)=2P(H), then probability of head is equal to:
A 0
B ½
C 1/3
D 2/3
Answer c
175. Given P(A) = 0.3, P(B) = 0.5 and P(AUB)=0.8,then:
A A and B are not mutually exclusive events
B A and B are equally likely events
C A and Bare independent events
D A and B are mutually exclusive events
Answer d
176. Two dice are rolled. Probability of getting similar faces is:
A 5/36
B 1/6
C 1/3
D ½
Answer b
177. Probability of getting a red ace if a card is drawn at random from pack of 52 cards
is
A 1/52
B 1/26
C 1/13
D 1
Answer b
178. A standard normal distribution has:

A the mean equal to the variance
B mean equal 1 and variance equal 1
C mean equal 0 and variance equal 1
D mean equal 0 and standard deviation equal 0
Answer c
179. Total Area under the normal curve is
A 0
B Greater than 1
C 1
D Less than 1
Answer d
180. A Bernoulli trial has:

A At least two outcomes
B At most two outcomes
C Two outcomes
D Fewer than two outcomes
Answer c
181. In a binomial probability distribution, the sum of probability of failure and

probability of success is always:
A Zero
B Less than 0.5
C Greater than 0.5
D One
Answer d
182. If n = 6 and p= 0.9 then the value of P(x = 7) is:

A Zero
B Less than zero
C More than zero
D One
Answer a
183. In a multiple choice test there are five possible answers to each of 20 questions. If
a candidate guesses the correct answer each time, the mean number of correct answers is:
A 4
B 5
C 1/5
D 20
Answer a
184. If the probability of a success is 0.80, and there are n=10 trials, then the mean of
the binomial distribution is would be
A 1.6
B 1.26
C 8
D 0.08
Answer c
185. If n = 10 and p = 0.8, then the variance of the binomial distribution is

A 1.6
B 1.26
C 8
D 0.08
Answer a
186. Which of the following is a valid objective function for a linear programming
problem?
A Max 5xy
B Min 4x + 3y + (2/3)z
C Max 5x2 + 6y2
D Min (x1 + x2)/x3
Answer B
187. XYZ Inc. produces two types of paper towels, called regular and super-soaker.
Marketing has imposed a constraint that the total monthly production of regular should be
no more than twice the monthly production of super-soakers. Letting X1 be the number
of units of regular produced per month and X2 represent the number of units of super-
soaker produced per month, the appropriate constraint/s will be
A X1 ≤ 2X2.
B 2X1 ≤ X2.
C X1 ≤ 0.5X2.
D X1 – X2 ≤ 0.
Answer A
Regular uses 2 units of recycled paper per unit of production and super-soaker uses 3
units of recycled paper per unit of production. The total amount of recycled paper
available per month is 10,000. Letting X1 be the number of units of regular produced per
month and X2represent the number of units of super-soaker produced per month, the
appropriate constraint/s will be
A 2X1 + 3X2 = 10000.
B 2X1 + 3X2 ≤ 10000.
C 2X1 + 3X2 ≥ 10000.
D 2X1 = 3X2.
Answer B
Regular uses 2 units of recycled paper per unit of production and super-soaker uses 3
units of recycled paper per unit of production. The total amount of recycled paper
available per month is 10,000. They also have a binding contract to use at least 8000 units
of recycled paper per month with a local pollution control organization. Letting X1 be the
number of units of regular produced per month and X2 represent the number of units of
super-soaker produced per month, the appropriate constraint/s will be
A 2X1 + 3X2 ≥ 8000.
B 2X1 + 3X2 ≤ 10000.
C A or B but not both.
D A and B.
Answer D
190. XYZ Inc. produces two types of printers, called regular and high-speed. Regular
uses 2 units of recycled plastic per unit and high-speed uses 1 unit of recycled plastic per
unit of production. XYZ is committed to using at least 5,000 units of recycled plastic per
month. A critical machine is needed to manufacture the printers and each unit of Regular
requires 5 units of time in this machine and each unit of high-speed requires 3 units of
time in this machine. The total time available in this machine per month is 15000 units.
Letting X1 be the number of units of regular produced per month and X2 represent the
number of units of high-speed produced per month, the appropriate constraint/s will be
A 2X1 + X2 ≥ 5000.
B 2X1 + X2 ≤ 5000.
C 5X1 + 3X2 ≤ 15000.
D A and C.
Answer D
MULTIPLE CHOICE QUESTIONS (347)
DECISION SCIENCE (204)
MCQ Set 01 : Question No 01 to 105 (Answer after the questions)

MCQ Set 02 : Question No 106 to 287 (With Answer)
MCQ Practice Test 01, Test 02 and Test 03 : Questions No 288 to
347
1. Decision Science approach is

b. Scientific
c. Intuitive
d. All of the above
2. 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

a. Controllable
b. Uncontrollable
c. Parameters
4. A model is
a. An essence of reality
b. An approximation
c. An idealization
d. All of the above
5. Managerial decisions are based on

b. The use of qualitative factors
d. All of the above
6. 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. All of the above
8. A physical model is example of

a. An iconic model
c. A verbal model
d. All of the above

a. Logical approach
d. All of the above
11. The qualitative approach to decision analysis relies on

a. Experience
b. Judgement
c. Intuition
d. All of the above
12. The mathematical model of an LP problem is important because

a. It helps in converting the verbal description & numerical data into

d. All of the above

d. All of the above
15. The distinguishing feature of an LP model is

d. All of the above

a. Limitations
b. Requirements
d. All of the above
17. Non-negativity condition is an important component of LP model because

18. Before formulating a formal LP model, it is better to

d. All of the above
19. Maximization of objective function in an LP model means

c. Neither of above
d. Both a & b
20. Which of the following is not a characteristic of the LP model

a. Money
b. Manpower
c. Machine
d. All of the above
22. Which of the following is not a characteristic of the LP

23. Non-negativity condition in an LP model implies

24. Which of the following is an assumption of an LP model

a. Divisibility
b. Proportionality
c. Additivity
d. All of the above
25. Which of the following is a limitation associated with an LP model

d. All of the above

c. Linear equations
d. All of the above
27. A feasible solution to an LP problem

28. Which of the following statements is true with respect to the optimal solution of an
LP problem
29. An iso-profit line represents

30. If an iso-profit line yielding the optimal solution coincides with a constaint line,
then
31. While plotting constraints on a graph paper, terminal points on both the axes are
connected by a straight line because
d. All of the above
32. A constraint in an LP model becomes redundant because


c. Both a & b
35. The solution space (region) of an LP problem is unbounded due to

c. Neither a nor b
d. Both a & b
36. While solving a LP model graphically, the area bounded by the constraints is called
a. Feasible region
37. Alternative solutions exist of an LP model when

d. All of the above
38. While solving a LP problem, infeasibility may be removed by

d. Removing a variable
39. If a non-redundant constraint is removed from an LP problem then

40. If one of the constraint of an equation in an LP problem has an unbounded solution,

then
a. The solution be optimal
d. All of the above


whenever opportunity cost corresponding to unused route of transportation is:
45. One disadvantage of using North-West Corner rule to find initial solution to the
d. All of the above
46. The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns
(destination) is feasible if number of positive allocations are
a. m+n
b. m*n
c. m+n-1
d. m+n+1
a. Equal to zero
d. Any value
48. During an iteration while moving from one solution to the next, degeneracy may
occur when
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
49. The large negative opportunity cost value in an unused cell in a transportation table
is chosen to improve the current solution because
50. The smallest quantity is chosen at the corners of the closed path with negative sign
to be assigned at unused cell because
d. All of the above
51. When total supply is equal to total demand in a transportation problem, the problem
is said to be
a. Balanced
b. Unbalanced
c. Degenerate
52. Which of the following methods is used to verify the optimality of the current
solution of the transportation problem
a. Least cost method
d. All of the above

d. a & b but not c
54. An assignment problem is considered as a particular case of a transportation

problem because
b. All xij = 0 or 1
d. All of the above
55. An optimal assignment requires that the maximum number of lines that can be
drawn through squares with zero opportunity cost be equal to the number of
a. Rows or columns
b. Rows & columns
56. While solving an assignment problem, an activity is assigned to a resource through
a square with zero opportunity cost because the objective is to
a. Minimize total cost of assignment
d. All of the above

b. MODI method
c. Hungarian method


a. Adding each entry in a column from the maximization value in that column
b. Subtracting each entry in a column from the maximum value in that column

a. n! solutions
b. (n-1)! solutions
c. (n!)n solutions
d. n solutions

a. Simplex method
c. Both a & b
62. For a salesman who has to visit n cities which of the following are the ways of his
tour plan
a. n!
b. (n+1)!
c. (n-1)!
d. n

d. All of the above

d. All of the above
65. Every basic feasible solution of a general assignment problem, having a square pay-
off matrix of order, n should have assignments equal to
a. 2n+1
b. 2n-1
c. m+n-1
d. m+n
66. To proceed with the MODI algorithm for solving an assignment problem, the
number of dummy allocations need to be added are
a. n
b. 2n
c. n-1
d. 2n-1
c. A LP problem
d. Both a & b

69. Customer behavior in which the customer moves from one queue to another in a
multiple channel situation is
a. Balking
b. Reneging
c. Jockeying
d. Altering
70. Which of the following characteristics apply to queuing system

b. Arrival process
c. Both a & b
d. Neither a nor b
71. Which of the following is not a key operating characteristics apply to queuing
system
a. Utilization factor
72. Priority queue discipline may be classified as

d. All of the above
73. The calling population is assumed to be infinite when

d. All of the above
74. Which of the cost estimates & performance measures are not used for economic
analysis of a queuing system
75. A calling population is considered to be infinite when

d. All of the above
76. The cost of providing service in a queuing system decreases with

77. Service mechanism in a queuing system is characterized by

d. All of the above
78. Probabilities of occurrence of any state are

d. All of the above
79. In a matrix of transition probability, the probability values should add up to one in
each
a. Row
b. Column
c. Diagonal
d. All of the above
80. In a matrix of transition probability, the element aij where i=j is a

a. Gain
b. Loss
c. Retention
81. In Markov analysis, state probabilities must

a. Sum to one
b. Be less than one
82. State transition probabilities in the Markov chain should
a. Sum to 1
b. Be less than 1
83. If a matrix of transition probability is of the order n*n, then the number of
equilibrium equations would be
a. n
b. n-1
c. n+1
84. In the long run, the state probabilities become 0 & 1

a. In no case
b. In same cases
c. In all cases
d. Cannot say
85. While calculating equilibrium probabilities for a Markov process, it is assumed that
86. The first-order Markov chain is generally used when

d. All of the above
87. A problem is classified as Markov chain provided

c. Long-run probabilities of being in a particular state will be constant over time
d. All of the above
88. The transition matrix elements remain positive from one point to the next. This
property is known as:
c. Regular property
d. All of the above
89. Markov analysis is useful for:
c. All of the above
90. Which of the following is not one of the assumptions of Markov analysis:
d. All of the above
91. An advantage of simulation as opposed to optimization is that

c. It is applicable in cases where there is an element of randomness in a system
d. All of the above
92. The purpose of using simulation technique is to

b. Understand properties & operating characteristics of complex real-life
problems
d. All of the above
93. Which of the following is not the special purpose simulation language
a. BASIC
b. GPSS
c. GASP
d. SIMSCRIPT
94. As simulation is not an analytical model, therefore the result of simulation must be
viewed as
a. Unrealistic
b. Exact
c. Approximation
d. Simplified
95. While assigning random numbers in Monte Carlo simulation, it is

a. Not necessary to assign the exact range of random number interval as the
probability
d. All of the above
96. Analytical results are taken into consideration before a simulation study so as to
c. Identify suitable values of decision variables for the specific choices of
system parameters
d. All of the above
97. Biased random sampling is made from among alternatives which have
98. Large complicated simulation models are appreciated because

d. All of the above
99. Simulation should not be applied in all cases because it

a. Requires considerable talent for model building & extensive computer
programming efforts
d. All of the above
100. Simulation is defined as

b. An approach for reproducing the processes by which events by chance &
changes are created in a computer
c. A procedure for testing & experimenting on models to answer what if ___,
then so & so ___ types of questions
d. All of the above
101. The general purpose system simulation language

102. Special simulation languages are useful because they

d. All of the above
103. Few causes of simulation analysis failure are

d. All of the above
104. To make simulation more popular, we need to avoid
b. Prolonged delays
d. All of the above
105. The important step required for simulation approach in solving a problem is to
a. Test & validate the model
b. Design the experiment
c. Conduct the experiment
d. All of the above
1 a 26 d 51 c 76 d
2 c 27 a 52 a 77 a
3 a 28 d 53 c 78 d
4 d 29 a 54 d 79 a
5 d 30 d 55 d 80 c
6 d 31 c 56 a 81 a
7 c 32 d 57 c 82 a
8 c 33 a 58 a 83 a
9 a 34 a 59 c 84 c
10 c 35 c 60 a 85 b
11 d 36 a 61 c 86 a
12 a 37 b 62 c 87 d
13 d 38 c 63 d 88 c
14 d 39 a 64 d 89 c
15 a 40 b 65 b 90 c
16 d 41 b 66 c 91 d
17 b 42 a 67 b 92 d
18 d 43 b 68 d 93 a
19 a 44 b 69 c 94 c
20 b 45 b 70 c 95 b
21 d 46 c 71 d 96 c
22 d 47 b 72 c 97 b
23 d 48 c 73 a 98 c
24 d 49 a 74 d 99 d
25 d 50 c 75 b 100 d
101 b
102 d
103 d
104 d
105 d
a) Individual
b) Team
c) Critical
Answer- : (b)

Answer-:(c)
d) List payoffs
Answer-:(b)

d) All of the above
Answer -: (d)


b) Maximin
c) Maximax
d) Minimax
Answer-:(c)

Answer-:(a)

a) Bayes'.
b) Laplace.
c) minimax.
d) Hurwicz.
Answer-: (b)

Answer-:(a)

b) corner point.
Answer-: (d)
a) the origin.
Answer-:(b)
Maximize 12X + 10Y
Subject to:
4X + 3Y ch7 <= 480
2X + 3Y ch7 <= 360
all variables >= 0
a) (40,48)
b) (120,0)
c) (180,120)
d) (30,36)
Answer-: (b)

Answer-: (b)
120. Which of the following does not represent a factor a manager might consider
when employing linear programming for a production scheduling?
a) labor capacity

Answer-: (c)
122. In labor planning formulation, how would you write the constraint that there are
only 10 full-time tellers (labeled as T) available?
a) T + 10 > 0
b) T > 10
c) T ≤10
Answer-:(c)
d) all of the above
Answer-: (a)


Answer-: (a)
126. Which of the following is a valid objective function for a linear programming
problem?
a) Max 5xy
b) Min 4x + 3y + (2/3)z
c) Max 5x2+ 6y2
d) Min (x1 + x2)/x3
Answer-: (b)

d) A feasible solution point does not have to lie on the boundary of the feasible
region.
Answer-: (c)
128. A solution that satisfies all the constraints of a linear programming problem
except the non-negativity constraints is called
a) optimal.
b) feasible.
c) infeasible.
d) semi-feasible.
Answer-: (c)
129. In converting a less-than-or-equal constraint for use in a simplex table, we must
add
Answer-: (b)
130. Slack
b) Is the amount by which the left side of a ≤ constraint is smaller than the right
side.
Answer-: (b)

b) is degenerate.
Answer-: (d)
132. To find the optimal solution to a linear programming problem using the
graphical method
Answer-: (d)
133. Which of the following special cases does not require reformulation of the
problem in order to obtain a solution?
b) infeasibility
c) unboundedness
Answer-: (a)
134. Whenever all the constraints in a linear program are expressed as equalities, the
linear program is said to be written in
a) standard form.
b) bounded form.
c) feasible form.
Answer-: (a)
135. In applying Vogel's approximation method to a profit maximization problem,

row and column penalties are determined by:
c) finding the difference between the two lowest unit costs in each row and
column.
d) finding the difference between the two highest unit costs in each row and
column.
Answer-: (d)
136. The northwest corner rule requires that we start allocating units to shipping
routes in the:
a) middle cell.
Answer-:(d)
137. 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:
a) Unbalanced.
b) Degenerate.
c) Infeasible.
d) Optimal.
Answer-: (c)
138. The only restriction can be placed on the initial solution of a transportation
problem is that:
d) must have a number (equal to the number of rows plus the number of columns
minus one) of boxes which contain nonzero quantities.
Answer-: (b)
139. The table
b) Infeasible.
c) degenerate.
d) all of the above
Answer-: (c)
140. Which of the following is used to come up with a solution to the assignment
problem?
a) MODI method
d) Hungarian method
Answer-: (d)
a) utility curve.
c) Laplace curve.
d) benefit curve.
Answer-:(a)

Answer-: (a)
a) infeasible
b) degenerate
c) unbounded
d) Optimal
Answer-:(d)
was obtained by Vogel's approximation. The difference between the objective function
for this solution and that for the optimal is
a) 40
b) 60
c) 80
d) 100
Answer-: (c)
c) MODI method
Answer-:(b)
146. Infeasibility means that the number of solutions to the linear programming
models that satisfies all constraints is
a) at least 1.
b) 0.
d) at least 2.
Answer-: (b)
147. 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
a) m + n − 2
b) m + n − 1
c) m + n
d) m + n + 1
Answer-: (b)
148. The per-unit change in the objective function associated with assigning flow to
an unused arc in the transportation simplex method is called the
Answer-: (a)
b) the number of origins must equal the number of destinations in the
Answer-: (c)

d) MODI method.
Answer-: (a)
151. A solution to a transportation problem that has less than m + n − 1 cells with
positive allocations in the transportation table is
Answer-:(d)
152. Using the transportation simplex method, the optimal solution to the
transportation problem has been found when
Answer-: (d)
153. Identifying the outgoing arc in Phase II of the transportation simplex method is
performed using the
b) MODI method.
Answer-: (c)
154. To use the transportation simplex method, a transportation problem that is

unbalanced requires the use of
155. The problem which deals with the distribution of goods from several sources to
several destinations is the
Answer-: (b)

a) the capacities
b) the flows
c) the nodes
d) the arcs
Answer-: (c)
157. The optimal solution is found in an assignment matrix when the minimum
number of straight lines needed to cover all the zeros equals
Answer-: (b)

a) identify one origin that can satisfy total demand at the destinations and at the
same time minimize total shipping cost.
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-: (d)

Answer-:(b)
160. Which of the following is not true regarding the linear programming
formulation of a transportation problem?
Answer-: (c)

Answer-: (d)
162. Which of the following is not true regarding an LP model of the assignment
problem? ]
Answer-: (b)
Answer-: (a)

Answer-: (a)

b) approaches decision making rationally, with techniques based on the scientific
method.
Answer-: (d)

Answer-: (b)

Answer-: (c)

Answer-: (c)
169. A physical model that does not have the same physical appearance as the object
being modeled is
a) an analog model.
b) an iconic model.
Answer-: (a)

Answer-: (b)
171. George Dantzig is important in the history of management science because he

developed
Answer-: (c)

a) mathematical.
b) iconic.
c) analog.
d) constrained.
Answer-: (a)

a) xij.
b) xji.
c) cij.
d) cji.
Answer- a)
174. Which of the following special cases does not require reformulation of the
problem in order to obtain a solution?
b) infeasibility
c) unboundedness
Answer-: (a)

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.
Answer-: (c)
176. 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
a) dual price.
c) reduced cost.
d) upper limit.
Answer-: (c)

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.
Answer- : (c )
b) zero.
Answer- : (a )

Answer- : (a )

Answer- : (a )

a) the axes
b) the flow
c) the nodes
d) the arrows
Answer- : (c )

a) xij.
b) xji.
c) cij.
d) cji.
Answer- : (a )
183. Slack
b) is the amount by which the left side of a < constraint is smaller than the right
side.
c) is the amount by which the left side of a > constraint is larger than the right
side.
Answer-: (b)
b) the number of origins must equal the number of destinations in the
d) there are many differences between the transportation and assignment
problems
Answer- : (c )

Answer- : (d )

Answer- : (a )

a) Controllable
b) Uncontrollable
c) Parameters
Answer- : (a )
188. A model is
b) An approximation
d) All of the above
Answer- :(d )

a) An iconic model
c) A verbal model
Answer- : (a )

d) All of the above
Answer- : (c )

b) Scientific
c) Intuitive
d) All of the above
Answer- : (a )

Answer- : (d )

d) All of the above
Answer- : (d )

a) Military
b) Business
d) All of the above
Answer- : (d )

a) Feasible
b) Non feasible
c) Optimal
d) Non optimal
Answer- : (c )

a) Quantified
b) Qualified
c) Feasible
d) Optimal
Answer- : (a )
197. ………. Theory is an important operations research technique to analyze the

queuing behaviour.
a) Waiting line
b) Net work
c) Decision
d) Simulation
Answer- : (a )

a) iconic
b) mathematical
c) analogue
d) schematic
Answer- : (a )

a) Iconic
b) Mathematical
c) Analogue
Answer- : (b )
200. A map indicates roads, highways, towns and the interrelationship is an

……model
a) Iconic
b) mathematical
c) analogue
Answer- : (c )

a) Limitations
b) Requirements
d) all of the above
Answer- : (d )

d) all of the above
Answer- : (d )

d) all of the above
Answer- : (d )
204. ……….. is an important Operations research technique to be used for

determining

Answer- : (d )
a) Money
b) Man power
c) Machine
d) all of the above
Answer- : (d )
206. 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?
a) 0.893
b) 0.714
c) 1.607
d) 0.375
Answer-: (c)
a constant service rate, on the average, how many minutes does a customer spend in
the service facility?
a) 0.893 minutes
b) 0.321 minutes
c) 0.714 minutes
d) 1.607 minutes
Answer-: (b)
a constant service rate, what percentage of available service time is actually used?
a) 0.217
b) 0.643
c) 0.321
Answer-: (d)
a) service cost
b) facility cost
c) calling cost
d) waiting cost
Answer-: (d)
a constant service rate, the probability that the server is idle is
e) 0.217
f) 0.643
g) 0.286
h) 0.714
Answer-: (c)
211. Markov analysis is a technique that deals with the probabilities of future
occurrences by
Answer-: (b)

Answer-: (b)
n) channel.
o) steady state.
Answer-: (a)
214. What queue discipline is assumed by the waiting line models presented in the
textbook?
Answer-: (a)
Answer-: (b)
Answer-: (a)

b) the probability a system in a particular state now will be in a specific state next
period.
Answer-: (b)
218. Performance measures dealing with the number of units in line and the time
spent waiting are called
y) queuing facts.
Answer-: (d)

a) p12
b) p23
c) p14
d) p43
Answer-: (c)
220. The probability that a system is in a particular state after a large number of
periods is
Answer-: (a)

Answer-: (a)
222. If the probability of making a transition from a state is 0, then that state is called
a(n)
a) steady state.
b) final state.
c) origin state.
d) absorbing state.

Answer-: (d)

d) all of the above
Answer-: (d)
c) (a) and (d)
d) We can predict any future state from the previous state and the matrix of
transition probabilities.
Answer-:(c)
Answer-: (d)

Answer-: (d)
228. Occasionally, a state is entered which will not allow going to another state in the
future. This is called
b) stable mobility.
Answer-: (d)
229. Markov analysis is a technique that deals with the probabilities of future
occurrences by
Answer-: (b)
230. In Markov analysis, the likelihood that any system will change from one period
to the next is revealed by the
a) identity matrix.
Answer-: (d)
231. The condition that a system can be in only one state at any point in time is
known as
a) Transient state.
Answer-:(c)
232. At any period n, the state probabilities for the next period n+1 is given by the
following formula:
a) n(n+1)=n(n)Pn
b) n(n+1)=n(0)P
c) n(n+1)=(n+1)P
d) n(n+1)=n(n)P

b) our study will have only limited value because the Markov analysis tells us
"what" will happen, but not "why."
d) only constant changes in the matrix of transition probabilities can be handled in
the simple model.
Answer-: (b)
234. The following data consists of a matrix of transition probabilities (P) of three
competing companies, the initial market share state 16_10.gif(1), and the
equilibrium probability states. Assume that each state represents a firm (Company
1, Company 2, and Company 3, respectively) and the transition probabilities
represent changes from one month to the next.
a) 0.10
b) 0.20
c) 0.42
d) 0.47
Answer-: (d)
Answer-: (d)
236. A simulation model uses the mathematical expressions and logical relationships
of the
gg) real system.
hh) computer model.
Answer-: (a)

b) state vector
Answer-: (c)

Answer-: (c)

a) risk analysis.
Answer-: (c)

Answer-: (b)
241. 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-: (d)
242. 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.
Answer-: (c)

Answer-:( b)
244. Simulation
245. 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

247. 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.
248. 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.
d) events.
b) if one number is, say, 10 units above the mean, the next number will be 10 units
below the mean.



Answer-: c) summing all the previous probabilities up to the current value of the
variable.
253. Which of the following statements is INCORRECT regarding the

advantages of simulation?
d) A simulation model provides a convenient experimental laboratory for the real
system.

b) Run the simulation for many days many times, i.e., using multiple sets of
random numbers.
Answer-: b) run the simulation for many days many times, i.e., using multiple sets of
random numbers.

256. In assigning random numbers in a Monte Carlo simulation, it is

important to ________.
257. To simulate is to try to __________ the features, appearance, and

characteristics of a real system.
a) Develop
b) Analyze
c) Multiply
d) Duplicate


a) Divisibility
b) Proportionality
c) Additively
d) all of the above
Answer- : d )
260. Most of the constraints in the linear programming problem are expressed
as ……….
a) Equality
b) Inequality
c) Uncertain
d) all of the above
Answer- : b )

Answer- : a )
262. While plotting constraints on a graph paper, terminal points on both axes
are connected by a straight line because
d) all of the above
Answer- : c )

Answer- : a )

d) Both (a) and (b)
Answer- : c )
c) Linear equations
d) All the above
Answer- : d )
266. While solving LP problem graphically, the area bounded by the

constraints is called
a) Feasible region
Answer- : a )
267. Which of the following is not a category of linear programming

problems?
Answer- : d )
268. Which of the following may not be in a linear programming

formulation?
a) <=.
b) >.
c) =.
d) All the above
Answer- : b )

Answer- : c )
270. A linear programming model does not contain which of the following
components?
a) Data
b) Decisions
c) Constraints
d) A spread sheet
Answer- : d )

b) Constraints
c) Points
d) All the above
Answer- : b )
272. In linear programming problem if all constraints are less than or equal
to, then the
feasible region is
a) Above lines
b) Below the lines
c) Unbounded
Answer- : b )
273. ……. is a series of related activities which result in some product or

services.
a) Network
c) assignment
d) none of these
Answer- : a )
274. Any activity which does not consume either any resource or time is
called
a) Predecessor
b) Successor
c) Dummy
d) End
Answer- : c )

a) Equality
b) Non equality
Answer- : c )
276. Activities that cannot be started until one or more of the other activities
are completed, but immediately succeed them are called ……activities
a) Predecessor
b) Successor
c) Dummy
d) End
Answer- : b )
277. An event which represents the beginning of more than one activity is
known as
………..event.
a) Merge
b) Net
c) Burst
Answer- : c )
278. If two constraints do not intersect in the positive quadrant of the graph,
then
Answer- : d )
279. 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- : a )

Answer- : a )

Answer- : c )
282. ….……..is that sequence of activities which determines the total project
time.
a) Net work
b) Critical path
Answer- : b )

a) Net work
b) Critical path
Answer- : c )
284. ………..models in which the input and output variables follow a

probability distribution.
a) Iconic
b) mathematical
c) analogue
Answer- : d )

a) Game theory
b) Charts
c) Graphs
d) All the above
Answer- : a )

d) all of the above
Answer- : b )
287. . ………..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
d) Queuing theory
Answer- : b )
TEST NO 01 For Practice
Sr No. Questions Option a Option b Option c Option d Answer
Which of the
following is (are)
Decision making Decision making Decision making
288 types of decision- All of the above Option d
under uncertainty under certainty under risk
making
environments?
have based the
A good decision have used
will obtain the best have followed a decision on all
289 always implies that appropriate Option c
final results logical process. available appropriate
we quantitative analysis
information.
All of the following
Compute the
are steps in the Identify possible
290 Define the problem posterior List payoffs Option b
decision-making outcomes
probabilities
process EXCEPT:
The equally likely
291 decision criterion is Bayes'. Laplace. minimax. Hurwicz. Option b
also known as
The graph that plots
the utility value
292 utility curve. decision tree graph Laplace curve. benefit curve. Option a
versus monetary value
is called:
Which of the
following might be
293 viewed as an Hurwicz criterion Maximin Maximax Minimax Option c
"optimistic" decision
criterion?
the difference
the regret from not
Opportunity loss the expected value the expected loss between the actual
294 having made a Option c
refers to of a bad decision. from a bad decision payoff and the
decision.
optimal payoff.
should be identified
are evaluated as a
before decision are limited to are best generated by
295 Decision alternatives part of the problem Option a
criteria are quantitative solutions brain-storming.
definition stage.
established.
The quantitative the manager's prior a relatively mathematical
each of the above is
296 analysis approach experience with a uncomplicated expressions for the Option c
true.
requires similar problem. problem. relationships
Management science quantitative scientific research as
qualitative operational
297 and operations approaches to opposed to Option b
managerial skills. management skills.
research both involve decision making. applications.
Which of the
following is a alternate courses of
minimization of usage of graphs in
298 property of all linear action to choose computer program Option a
some objective the solution
programming from
problems?
A point that satisfies
intersection of the
all of a problem's maximum profit
299 Corner point. profit line and a None of the above option d
constraints point
constraint.
simultaneously is a(n)
The first step in understand the
identify the objective define the decision
300 formulating an LP graph the problem. managerial problem Option b
and the constraints. variables.
problem is being faced.
LP theory states that
a corner point of the the highest point of the lowest point in
301 the optimal solution to the origin. Option b
feasible region. the feasible region. the feasible region.
any problem will lie
at
Consider the
following linear
programming
problem:
Maximize 12X + 10Y
Subject to:
4X + 3Y ch7
302 (40,48) (120,0) (180,120) (30,36) Option b
<= 480
2X + 3Y ch7 <= 360
all variables >= 0
Which of the
following points
(X,Y) could be a
feasible corner point?
Unboundedness is contains too many
has finite multiple has been formulated
303 usually a sign that the is degenerate. redundant Option d
solutions. improperly.
LP problem constraints.
Which of the
following does not
represent a factor a
manager might
warehouse
304 consider when labor capacity employee skill levels none of the above Option d
limitations
employing linear
programming for a
production
scheduling?
In labor planning
formulation, how
would you write the
All of the above are
305 constraint that there T + 10 > 0 T > 10 T ≤10 Option c
correct ways.
are only 10 full-time
tellers (labeled as T)
available?
A type of linear
programming problem
media selection Madison Avenue marketing allocation
306 that is used in all of the above Option a
problem. problem. problem.
marketing is called
the
In converting a less-
than-or-equal
both a surplus and a
307 constraint for use in a a surplus variable. a slack variable. an artificial variable. Option b
slack variable.
simplex table, we
must add
TEST NO 02 for Practice

Sr
Questions Option a Option b Option c Option d Answer
No.
decision for constraint of objective of
The maximization or minimization of a goal of management
308 decision operations linear Option d
quantity is the science.
analysis. research. programming.
309 Decision variables tell how much or how represent the measure the must exist for Option a
many of something to values of the objective each
produce, invest, constraints. function. constraint.
purchase, hire, etc.
Which of the following is a valid objective Min 4x + 3y + Min (x1 +
310 Max 5xy Max 5x2+ 6y2
function for a linear programming problem? (2/3)z x2)/x3
A feasible
solution point
An optimal An infeasible
does not have
Which of the following statements is NOT A feasible solution solution solution
311 to lie on the Option c
true? satisfies all constraints. satisfies all violates all
boundary of
constraints. constraints.
the feasible
region.
A solution that satisfies all the constraints of a
312 linear programming problem except the non- optimal. feasible. infeasible. semi-feasible. Option c
is the amount is the amount
exists for
is the difference by which the by which the
each variable
between the left and left side of a ≤ left side of a ≥
313 Slack in a linear
right sides of a constraint is constraint is
programming
constraint. smaller than larger than the
problem.
the right side. right side
find the
find the
To find the optimal solution to a linear find the feasible point feasible point None of the
feasible point
314 programming problem using the graphical that is the farthest away that is at the alternatives is Option d
that is closest
method from the origin. highest correct.
to the origin.
location.
Which of the following special cases does not each case
315 require reformulation of the problem in order to alternate optimality infeasibility unboundedness requires a Option a
obtain a solution? reformulation.
316 Infeasibility means that the number of solutions at least 1. 0 an infinite at least 2. Option b
to the linear programming models that satisfies number.
all constraints is
Whenever all the constraints in a linear
bounded alternative
317 program are expressed as equalities, the linear standard form. feasible form. Option a
form. form.
Vogel's
Which method usually gives a very good stepping-
318 northwest corner rule approximation MODI method Option b
solution to the Transportation problem? stone method
method
finding the finding the
finding the difference difference
In applying Vogel's approximation method to a finding the largest unit smallest unit between the between the
319 profit maximization problem, row and column cost in each row or cost in each two lowest unit two highest Option d
penalties are determined by: column. row or costs in each unit costs in
column. row and each row and
column. column.
Lower right Upper right Upper left-
The northwest corner rule requires that we start
320 middle cell. corner of the corner of the hand corner Option d
allocating units to shipping routes in the:
table. table. of the table.
In a transportation problem, when the number
of occupied routes is less than the number of
321 Unbalanced. Degenerate. Infeasible. Optimal. Option c
rows plus the number of columns -1, we say
that the solution is:
must have a
number
(equal to the
must have nonzero all constraints
The only restriction can be placed on the initial demand must number of
322 quantities in a majority must be Option b
solution of a transportation problem is that: equal supply. rows plus the
of the boxes. satisfied.
number of
columns
minus one) of
boxes which
contain
nonzero
quantities.
Th table
all of the
323 an initial solution. Infeasible. degenerate Option c
above
Which of the following is used to come up with northwest stepping-stone Hungarian

324 MODI method Option d
a solution to the assignment problem? corner method method method
What is wrong with the following table?
The solution is The solution The solution is Nothing is

325 Option a
infeasible. is degenerate unbounded. wrong.
The solution presented in the following table is
326 infeasible degenerate unbounded Optimal Option d

The solution shown
was obtained by Vogel's approximation. The
difference between the objective function for
this solution and that for the optimal is
327 40 80 100 Option c

60
TEST NO 03
Sr
Questions Option a Option b Option c Option d Answer
No.
A solution to a transportation problem
an initial
that has less than m + n − 1 cells with an optimal a minimum-cost
328 feasible a degenerate solution. Option d
positive allocations in the solution. solution.
solution.
transportation table is
The optimal solution is found in an
(the number of agents)
assignment matrix when the minimum (the number of (the number of (the number of
329 + (the number of Option b
number of straight lines needed to agents) − 1. agents). agents) + 1.
tasks).
cover all the zeros equals
The stepping-stone method requires
that one or more artificially occupied
330 cells with a flow of zero be created in m+n−2 m+n−1 m+n m+n+1 Option b
the transportation tableau when the
number of occupied cells is fewer than
The per-unit change in the objective
function associated with assigning flow net evaluation degenerate
331 opportunity loss. simplex multiplier. Option a
to an unused arc in the transportation index. value.
simplex method is called the
the number of
origins must
total supply
equal the each supply and there are many
The difference between the must equal total
number of demand value is 1 in differences between
332 transportation and assignment demand in the Option c
destinations in the assignment the transportation and
problems is that transportation
the problem assignment problems
problem
transportation
problem
minimum-cost stepping-stone
333 An example of a heuristic is the Hungarian method. MODI method. Option a
method. method.
Using the transportation simplex
there is a more than one the net evaluation
method, the optimal solution to the there is a tie for
334 shipment in stepping-stone index for each Option d
transportation problem has been found outgoing cell.
every cell path is available unoccupied cell is ≥ 0
when
Identifying the outgoing arc in Phase
minimum cost stepping-stone matrix reduction
335 II of the transportation simplex method MODI method. Option c
method. method method
is performed using the
identify an identify an identify unoccupied identify an initial
336 The MODI method is used to Option b
outgoing arc. incoming arc. cells. feasible solution
To use the transportation simplex one or more
artificial a dummy origin or
337 method, a transportation problem that transshipment matrix reduction. Option c
variables destination.
is unbalanced requires the use of nodes
The problem which deals with the
maximal flow transportation
338 distribution of goods from several assignment problem shortest-route problem Option b
problem problem
sources to several destinations is the
The parts of a network that represent
339 the capacities the flows the nodes the arcs Option c
the origins are
identify one
origin that can minimize the minimize the
satisfy total number of number of minimize the cost of
The objective of the transportation demand at the origins used to shipments necessary shipping products from
340 Option d
problem is to destinations and satisfy total to satisfy total several origins to
at the same time demand at the demand at the several destinations.
minimize total destinations destinations
shipping cost.
The number of units shipped from
341 origin i to destination j is represented xij. xji. cij. cji. Option a
by
The number of
The number of
Which of the following is not true Costs appear variables is
constraints is The constraints' left-
regarding the linear programming only in the (number of
342 (number of origins) hand side coefficients Option c
formulation of a transportation objective origins) ×
× (number of are either 0 or 1.
problem? function (number of
destinations)
destinations)
one agent can one task can be each agent is one agent is assigned
In the general linear programming
343 do parts of done by several assigned to its own to one and only one Option d
model of the assignment problem,
several tasks. agents. best task task
Which of the following is not true Costs appear in All constraints All constraint left-
All decision variable
344 regarding an LP model of the the objective are of the ≥ hand side coefficient Option b
values are either 0 or 1.
assignment problem? function only. form. values are 1.
must connect
represent the indicate the
every node to a All of the alternatives
345 Arcs in a transshipment problem cost of direction of the Option c
transshipment are correct.
shipments. flow.
node
agent 3 can be agent 2 can be a mixture of agents
The assignment problem constraint there is no feasible
346 assigned to 2 assigned to 3 1, 2, 3, and 4 will be Option a
x31 + x32 + x33 + x34 ≤ 2 means solution.
tasks. tasks. assigned to tasks
The assignment problem is a special transportation transshipment maximal flow shortest-route
347 Option a
case of the problem. problem. problem. problem.

DS Merge2

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DS Merge2

Uploaded by

Copyright:

Available Formats

Id 1

B (b) Mutually exclusive

C (c) Posterior probability

D (d) All of the above

Question Q. 2 The probability of event A occurring is 0.3, while

Question Q. 3 A production process is known to produce a

Question Q. 4 A company is considering producing some new

Question Q. 5 In a throw of coin what is the probability of

Question Q. 6 In a throw of dice what is the probability of getting

Question Q. 7 If two events are independent, then

A (a) they must be mutually exclusive

B (b) the sum of their probabilities must be equal to one

C (c) their intersection must be zero

D (d) None of these alternatives is correct.

Question Q. 8 Probability lies between :

Question Q. 9 A set of all possible outcomes of an experiment is

B (b) Sample point

C (c) Sample space

D (d) Compound event

Question Q. 10 The events having no experimental outcomes in

A (a) Equally likely events

B (b) Exhaustive events

C (c) Mutually exclusive events

D (d) Independent events .

Question Q. 11 The probability associated with the reduced

A (a) Conditional probability

B (b) Statistical probability

D (d) Subjective probability

Question Q. 12 If A is any event in S and A its complement, then

Question Q. 13 When certainty is involved in a situation, its

B (b) Between-I and + 1

C (c) Between 0 and 1

Question Q. 14 Which of the following cannot be taken as

Question Q. 15 The term 'sample space' is used for:

A (a) All possible outcomes

B (b) All possible coins

Question Q. 16 The term 'event' is used for:

B (b) A sub-set of the sample space

D (d) Total number of outcomes.

Question Q. 17 When the occurrence of one event has no effect

C (c) Mutually exclusive

D (d) Equally likely

Question Q. 19 If we toss a coin and P(T)=2P(H), then probability

Question Q. 20 Given P(A) = 0.3, P(B) = 0.5 and P(AUB)=0.8,then:

A (a) A and B are not mutually exclusive events

B (b) A and B are equally likely events

C (c) A and Bare independent events

D (d) A and B are mutually exclusive events

Question Q. 22 Two dice are rolled. Probability of getting similar

Question Q. 24 Probability of getting a red ace if a card is drawn

Question Q. 25 A survey of 120 business executives revealed the

Question Q. 26 If an executive is picked at random, find the

Question Q. 27 A standard normal distribution has:

A (a) the mean equal to the variance

B (b) mean equal 1 and variance equal 1

D (d) mean equal 0 and standard deviation equal 0

Question Q. 31 Shape of normal curve can be related to (a) Circle

B (b) Greater than 1

D (d) Less than 1

Question Q. 33 A Bernoulli trial has:

A (a) At least two outcomes

B (b) At most two outcomes

C (c) Two outcomes