QUESTION BANK

SUB: OPERATIONAL RESEARCH

CLASS: TYBMS
SEM-VI
SR.
NO QUESTION TEXT OPTION A OPTION B OPTION C OPTION D
.
Decision making is one of the Characteristic
1 Limitations Advantages None of these
_____ of Operations Research. s / Features

Credit policy Analysis and risks

etc. are the areas of Application of
2 Accounting Marketing Industrial All of these
Operations Research in _____
Function.
_____ helps to determine the best
cause of action for a firm in view of Job sequencing Decision None of
3 Job sequencing
the expected Countermoves from problem theory these
the Competitors.
The advantage(s) of Operations Better
4 Better Control Better Systems All of these
Research is _____. Decisions
Dependence on Non-
The Limitation(s) of Operations Money and
5 an Electronic Quantifiable All of these
Research is _____. Time Costs
Computer Factors
A mathematical programming
problem is one that seeks to
maximize an objective function
Linear Linear
6 subject to constraints. If both the Divisibility None of these
Programming constraints
objective function and the
constraints are linear, the problem
is referred to as a _____ problem.
_____ are functions in which each
variable appears in a separate term
Linear Linear
7 raised to the first power and is Linearity All of these
Programming functions
multiplied by a constant (which
could be 0).
_____ are linear functions that are
restricted to be "less than or equal Linear Linear
8 Proportionality None of these
to", "equal to", or "greater than or constraints Programming
equal to" a constant.
The maximization or minimization
9 of some quantity is the _____ in all Decision First Divisibility Objective
linear programming problems.
_____ variables can never be Linear
10 Decision Linearity All of these
negative. Programming
 The _____ property of linear
programming models indicates that
Linear
11 the decision variables cannot be Proportionality Decision Divisibility
functions
restricted to integer values and can
take on any fractional value.
The objective function 3x + 2y +
Proportionalit Proportionality Linear
12 4xy violates the assumption of None of these
y or linearity constraints
_____.
The _____ property of linear
programming models indicates that
Linear Proportionalit
13 the rate of change, or slope, of the Divisibility All of these
Programming y or linearity
objective function or a constraint is
constant.
Standard form is attained by adding
14 _____ variables to "less than or Artificial Basic Slack None of these
equal to" constraints.
Standard form is attained by
subtracting _____ variables from
"greater than or equal to"
15 Slack Basic Artificial Surplus
constraints. They represent the
difference between the left and
right sides of the constraints.
Resources which are 100% utilized Scarce or
16 Artificial Unbounded All of these
are _____ resources. binding
Resources which are not fully Scarce or
17 Scarce Abundant None of these
utilized are _____ resources. binding

In a constraint, the _____ variable

18 Slack Artificial Degenerate All of these
represents unused resources. 

_____ is the difference between the

19 left- and right-hand sides of a Shadow Price Unique Optimum Surplus
greater than or equal to constraint.
Basic variables for a given basis B
20 are the ones corresponding to the Incoming Dual Column None of these
_____ vectors of B.
Non--basic variables for a given
21 basis B are all variables except the Basic Degenerated Artificial All of these
_____ variables.
The _____ variable will have a
22 coefficient of – M in the objective Basic Unique Surplus Artificial
function of maximization type.
Every primal LPP is associated
23 Unbounded Dual Abundant All of these
with another LPP called _____.
If at least any one of Solution (bi)
Scarce or
24 value of basis variables is negative, Infeasible Standard None of these
binding
the solution is _____ solution.
 If at least any one of Solution (bi)
25 value of basis variables is zero, Slack Column Degenerate All of these
the solution is _____ solution.
If in an optimal Simplex table, all
delta values (∆) of non-basis
26 Unique Shadow Price Degeneracy None of these
variables are negative, then the
solution is _____.
Whenever the key column values
27 are zero or negative, we get _____ Basic Artificial Abundant Unbounded
Solution in Simplex.
Time Taken by Machine ´ _____
28 Optimum Shadow Price Zj All of these
= Rent or Cost
In an optimal Simple table, Shadow
Price of Resource is indicated by
29 Infeasible Degenerate Zj None of these
corresponding slack variable value
in _____ row.
If there is a tie between at least 2
30 least positive replacement ratios, Degeneracy Dual Basic All of these
then there is a _____ in solution.
The solution is _____ if all values
31 of opportunity cost i.e. ∆ are zero Abundant Slack Optimum None of these
or negative. (D≤ 0)
The _____ method used to obtain
32 optimum solution of Assignment Reduced matrix MODI German Hungarian
problem.
The purpose of a _____ row or
column in an assignment problem
33 Enumeration Simplex Dummy None of these
is to obtain balance between total
activities and total resources.
If the number of facilities are equal
to the number of jobs, the given
34 Minimization Balanced Optimal All of these
assignment problem is of _____
type.
If the assignment elements are time
35 elements in given assignment Maximization Minimization Balanced None of these
problem, then it is of _____ type.
When minimum number of
horizontal and vertical lines (N)
drawn to cover all zeros in reduced
36 Minimization Maximization Unbalanced Optimal
matrix becomes equal to order of
matrix (n), then _____ Solution is
obtained.
In _____ solution, numbers of
None of
37 allocated cell is not equal to m + n Non-degenerate Feasible Optimal
these
– 1.
 To find initial feasible solution, the Vogel’s
Least cost North West
38 allocation starts from top left corner Approximation None of these
method Corner
in _____ method of transportation. method
If Total Supply is not equal to the
Total Demand, then we have to
39 convert _____ Transportation Balanced Unbalanced Minimization None of these
Problem to the balanced stage to
find Optimal Transport Cost.
CPM is deterministic in nature
40 Longest Pessimistic Probabilistic All of these
where as PERT is _____ in nature.
The critical path is the _____ path
41 Shortest Negative Positive Longest
through the network.
Critical path activities can have
42 Positive Five Negative None of these
zero or _____ values for slack.
PERT uses _____ time estimates
43 and CPM use a single time Six Three Nine None of these
estimate.
_____ Float is the amount of time
that the activity completion time
can be delayed without affecting
44 Free Node Linear All of these
the earliest start time of the
immediate successor activity in the
network.
The process of reducing total time
that it takes to complete a project Normal Direct
45 PERT Crashing None of these
by employing additional resources Cost
is called _____.
PERT often assumes that the time
46 estimates follow the _____ PERT CPM Beta All of these
probability distribution.
The optimum time required to
Manufacturing None of the
47 complete all jobs using sequencing Elapsed time Minimum
Plant above
is known as _____.
Sequencing can be viewed as a
Manufacturin None of the
48 special kind of problem commonly Elapsed time Minimum
g Plant above
encountered in the _____.
The sequence in which the jobs are
Manufacturing None of the
49 performed is such that the total time Minimum Elapsed time
Plant above
taken is _____.
_____ time is the time on a
50 machine, for which a machine does Greater Idle Working None of these
not have a job to process.

_____ time is the time required by

51 Elapsed Working Idle Processing
each job on each machine.

_____ order (sequence) refers to

52 Completion Processing Idle All of these
the order (sequence) in which
 machines are required for
completing the job.
In n jobs and 3 machines ABC
problem, to convert the problem in
2 machines to solve further, the
53 minimum processing time on Smaller Equal Greater None of these
machine A and / or on machine C
must be _____ than the maximum
processing time on machine B.
_____ is the process of determining
which job to start first and in what
Batch Job
54 order other jobs should be Priority rules None of these
production Sequencing
processed on the machine or in
work centre.
The participant of the game who act
None of the
55 as decision makers are called Reduce Conflict Players
above
_____.
The term “Game” represents a
None of the
56 _____ between two or more Uncertainty Gains Conflict
above
persons.
The game theory deals with the
None of the
57 competitiveness of decision making Reduce Players Uncertainty
above
under _____.
When the best for each player is to
play one particular strategy None of the
58 Pure Players Reduce
throughout the game it is known as above
_____ Strategy game.
Operation Research involves
59 various ___________ to solve Decision Study Techniques Applications
problems.
Operation Research provide a
60 solution only when all the element Quantified Qualified Measure Not defined
related to a problem can be ______
This innovative science of
  World War Industrial
61 operations Research was Civil War World War I
II Revolution
discovered during _______.
Objective function is expressed in Decision
62 Number Symbols Solutions
term of the ___________ Variables
In simplex method, feasible basic Non-negative Negative Common
63 Basic constraint
solution must satisfy the _____ constraint constraint constraint
According to algebra of simplex No High Divisor Base
method, slack variables are contribution in contribution in contribution in contribution
64
assigned zero coefficients because objective objective objective in objective
______ function function function function
The tie in the replacement ratio
65 Infeasible Unbounded Alternate Degenerate
indicate the solution is ______
In converting a less-than-or-equal
Surplus Artificial Alternate
66 constraint for use in a simplex Slack variable
variable variable variable
table, we must add ________
67 A feasible solution to an LPP Must satisfy Need not Must be a Must
 all of the satisfy all of optimize the
corner point of
problem’s the constraints, value of the
the feasible
constraints only some of objective
region
simultaneously them function
An infinite An infinite
An infinite A boundary
number of number of
number of of these
68 An iso-profit line represents solutions all of solutions all of
optimal feasible
which yield the which yield the
solutions region
same profit same cost
If two constraints do not intersect in One of the Represent
The solution is The problem
69 the positive quadrant of the graph, constraints is optimal
unbounded is infeasible
then redundant solution
While solving the LP model
Infeasible Unbounded Feasible Degenerate
70 graphically, the area bounded by
region region region region
the constraints is called
Graphical method can be applied to
71 solve a LPP when there are only 4 3 1 2
_________ variable
Objective
function
One of the Adding
Alternate solutions exist of an LP equation is Two constraints
72 constraints is another
model when parallel to one are parallel
redundant constraint
of the
constraints
The method used for solving an Reduced matrix Hungarian
73 MODI method VAM
assignment problem is called method method
Obtain Provide a
Prevent a
The purpose of a dummy row or balance means of Obtain the
solution from
74 column in an assignment problem between total representing a maximum use
becoming
is to activities and dummy of resources
degenerate
total resources problem
The assignment problem is said to
75 be balanced if total rows and total Not equal Equal Symmetric Not defined
capacities are ______
Hungarian method was developed
76 Harold Kuhn Fisher Vogel Karl Pearson
by _________
The purpose of the transportation
Total shipping Total variable Total fixed
77 approach for locational analysis is Total profit
cost cost cost
to minimize _______
The number of
filled cells is
The solution All demand
one less than
A transportation problem has a All the squares yields the and supply
78 the number of
feasible solution when _______ are used lowest possible constraints
rows plus the
cost are satisfied
number of
columns
When total capacity is same as total
79 Balanced Unbalanced Feasible Degenerate
demand it is said to be __________
 Modified Vogel’s
The following is used to test North west Least cost
80 distribution approximatio
optimality test corner method method
method n method
Penalty Least cost
81 Vogel’s Method is also known as MODI method NWCR method
method method
Difference Difference
Difference Difference
between between
between least between
82 Penalty is defined as _________ maximum and maximum
and next least maximum and
next maximum and minimum
cost least cost
cost cost
One of One of
One of One of
opportunity opportunity
83 The loop in the exist if opportunity opportunity
cost is cost is not
cost is positive cost is zero
negative defined
Longest path Shortest path in Shortest path
Longest path in
84 The critical path refers to ______ in terms of terms of in terms of
terms of length
duration duration length
Critical
Critical project Critical path Critical path
85 The full form of CPM is project
method method management
management
__________ is applied for small Network
86 PERT CPM Critical path
and repetitive projects. diagram
__________ is applied for huge and Network
87 PERT CPM Critical path
non-repetitive projects. diagram
Reducing
Increasing
Time and cost duration of Profit and
88 Crashing is also known as _______ duration of
trade off non-critical cost trade off
project
events
In crashing we have to crash all Non-critical
89 Critical path Shortest path Total path
activities on ________ path
If for an activity in PERT network
if pessimistic time is 13 hrs,
optimistic time is 5hrs and most
90 12 14 5 9
likely time is 9hrs then expected
time of that activity is _________
hrs.
All activities lying on _______ are Non critical
91 Path Critical path Shortest path
critical activities. path
In the sequencing if the smallest
time for a job belongs to machine At second
92 In the middle In the starting At end
-1 then that job has to placed position
______ of the sequence.
________ operation is carried out More than
93 Two At least one Only one
on a machine at a time. one
If there are n jobs to be performed,
one at a time, on each of m
94 (n!)m (m!)𝑛 mn nm
machine, the possible sequence
would be
95 _________ is the process of Project work Job series Network Job
determining which job to start first Sequencing
 and in what order other jobs should
be processed on the machine or in
work centers.
William J. Neumann Samuelson P.
96 Who develop the Game Theory J. R. Hicks
Baumol Morgenstern T
Unstable
Equilibrium Balanced Imbalanced
97 What is a saddle point equilibrium
point growth point growth point
point
in game theory, the outcome or
End-game
98 consequences of a strategy is Payoff Penalty Reward
strategy
referred to as the
It cannot be
It is It is strictly It can not be
When the minimax and the solved by a
99 indetermined determined solved by two
maximin in pay off matrix are equal zero-sum
solution solution persons
game
The choice of Utility
Predicting the The migration
an optimal maximization
result of bets patterns of
100 Game theory is concerned with strategy in by firms in
placed on the caribou
conflict competitive
game Alaska
situations market