Operation Research
Compiled By: - Mr.
Shubham Kapoor
Q. Who coined the
term Operations Research in 1940?
A. McClosky and Trefthen
Q. In India,
Operations Research came into existence in which year?
A. 1949
Q. Operations
Research came into existence in 1949 in India, with the opening of an OR unit
at which place?
A. Regional Research Laboratory,
Hyderabad
Q. How OR helps in
decision making?
A. OR helps in decision making by
having Better control, Better decision,and Better system.
Q. What is a model?
A.A model as used in OR
is defined as idealized representation of a real-life system.
Q. what is
Deterministic model?
A. Models which assume conditions
of complete certainty and perfect knowledge are known as deterministic model.
Q. ___________ is not general method of deriving the
solution.
A. Hit and trial method
Q. The first formal activities of OR were initiated in which
country?
A. England during the
Second World War
Q. The
definition“OR is a scientific method of providing executive departments with a
quantitative basis for decisions under their control” was given by?
A. P.M. Morse and G.E.
Kimball
Q. How
T.L. Saaty defines OR?
A. OR is the art of giving bad answers to
problems which otherwise have worse answers.
Q. What
is the objective of OR?
A. OR attempts to locate
the best or optimal solution to the problem under consideration. For this
purpose, it is necessary that a measures of effectiveness is defined which is
based on the goals of the organization.E.g.profit, net returns, cost of
production etc.
Q.
________ models are pictorial representation of real systems and have the
appearance of the real thing. They represent the system as it is by scaling it
up or down.
A. Iconic model
Q.
_________ models are the one in which one set of properties is used to
represent another set of properties.
A. Analogue models
Q. What
is static model?
A. The model which does not consider
the impact of changes that takes place during the planning horizon is known as
static model.
Q. What is the
first step in methodology of Operations Research comprises?
A. Formulation of problem
Q. ________ is the
first step in formulating a linear programming problem.
A. Identify the decision variables
Q. What is redundant
constraint?
A. Whenever, a constraint does not
define a portion of the boundary of the feasible solution region, it is called
redundant constraint.
Q. The optimal
value of the objective function is attained at what points?
A. Corner points of the feasible
region.
Q. In general LPP
the function which optimizes a linear function of variables subject to a set of
linear equations and/or inequations is known as __________?
A. Objective Function
Q. In LP problem
having only less than or equal to constraints the initial basic feasible
solution is provided by using _________?
A. Slack variables
Q. In Simplex Method, variable with non-zero
values are calledas ?
A. Basic variables
Q. What is a
Surplus variable?
A. The positive variable which is
subtracted from the left hand side of the constraint to convert it into equation
is called as surplus variable.
Q. The element at
the intersection of minimum ratio arrow and incoming vector arrow is called?
A. Key element or pivot element
Q. In
transportation problem where supply and demand are exactly equal is known as
_____?
A. Balanced
Q. In a
transportation problem having m origins and n destinations then the problem is
solvable if numbers of basic variables are ______?
A. Exactly equal to (m +n -1)
Q. _________
problem in OR arises in situations involving physical movements of goods
A. Transportation Problem
Q. What is the
objective of transportation problem ?
A. In a Transportation problem the
objective is to transport various quantities of a single homogenous commodity
that are stored at various origins to different destinations in such a way that
the transportation cost isminimum.
Q. In which method
an algorithm is used to find a relatively efficient initial feasible solution
to a transportation problem _________?
A. Vogel’s Approximation Method
Q. Systematic
allocation to cells beginning in the upper left hand corner of the
transportation problem to obtain an initial feasible solution is _______?
A. North- West Corner Method
Q. In Vogel’s
Approximation Method, the penalty (opportunity cost) associated with a row is
determined by?
A. The difference between the
smallest cost and the next smallest cost in that row.
Q. In
transportation problem a feasible solution to a 5 origin, 4 destination problem
is said to be basic if the number of positive allocations are ____?
A. 8
Q. What is a Rim
condition in a transportation problem?
A. Rim conditions in a
transportation problem means satisfy all the supply and demand constraints
Q. ____________
Method is used to solveTransportation Problem
A. Modified Distribution
Q. _________ method
uses the stepping stone path to determine how many items to allocate to the
selected unused cell
A. MODI method
Q. If the feasible
solution of a transportation problem with m origins and n destinations is equal
to m+n-1 then solution of transportation problem is said to be ________?
A. Non-degenerate
Q. If the feasible
solution of a transportation problem with m origins and n destinations is fewer
than m+n-1 then solution of transportation problem is said to be _______?
A. Degenerate
Q. What is
assignment problem?
A. The problem which involves the
allocation of n different facilities to n different tasks is often termed as
assignment Problem.
Q. Assignment
problem is special class of __________ Problem.
A. Transportation Problem
Q. In an assignment
problem, if we add or subtract a constant to every element of any row (or
column) of the cost matrix [Cij ], then an assignment that minimizes the total
cost on one matrix also __________ the total cost on the other matrix.
A. Minimizes
Q. Hungarian Method
is a technique of solving ________ problem
A. Assignment Problem
Q. What is an
efficient means of finding the optimal solution of assignment problem ?
A. Hungarian method
Q. Hungarian method
of assignment problem was developed by
A. D. Konig
Q. What is Shortage
or stock out cost?
A. The penalty costs that are
incurred as a result of either delay in meeting the demand or inability to meet
it at all due to running out of stock are known asShortage or stock out cost.
Q. The concept of
Economic Order Quantity (EOQ) Model was developed by?
A. F. Haris
Q. In inventory
model ,the ordering and the holding costs are equal at
A. Economic Order Quantity
Q. what is the full
form of EOQ?
A. Economic Order Quantity
Q. What is
Progressive failure?
A.The type of failure in which the
probability of failure increases with the increase in the life of an item
isProgressive failure.
Q. What is gradual
failure?
A. Slow or progressive failure as
the life of the item increases , its efficiency decreases is known as gradual
failure
Q. When the items
do not deteriorate markedly with service but which ultimately fail after a
period of use is known as _______?
A. Sudden failure
Q. Replacement
theory deals with the analysis of materials and machines which deteriorate with
time and fix the optimal time of their replacement so that total cost is
________
A. Minimum
Q. The present
worth factor with regard to replacement and maintenance models, is given by:
A. (1+r)^-n
Q. The present
worth factor of unit amount to be spent after one year is given by
A. V = 1/1+r
Q. Optimal policy
for replacement of items whose maintenance costs increase with time; while the
value of money changes with constant rate during the period is given by
A. Replace the item if the next
period’s cost is greater than the weighted average of previous costs.
Q. What is
Sequencing Problem?
A. The assignment of the order in
which jobs are processed is known asSequencing Problem.
Q. In sequencing
problem , the effectiveness is a function of ______?
A. Order in which given tasks are
performed
Q. Theoretically
all possible sequence with n jobs and m machines is given by _____?
A. (nᴉ)^m
Q. The procedure to
solve sequencing problem with n jobs through two machines was given by
A. Johnson
Q. Every sequencing
problem must have ________ optimal solutions
A. Several optimal solutions
Q. In sequencing
problem, we select the sequences for which the total time taken in processing
all the jobs on the machines would be _____
A. Minimum
Q. In Johnson’s
procedure to solve n jobs though two machines, find the minimum processing time
from all the jobs, do the job first if
A. The minimum time happens to be
on first machine
Q. One of the
oldest and most widely used Operations Research techniques to study the waiting
lines is called __________?
A. Queuing theory
Q. The __________
theory owes its development to sequencing problem
A. Queuing
Q. The rule to
determine the formation of queue and manner in which customers form the queue
are selected for service is called _______
A. Queue discipline
Q. What is
Jockeying?
A. Customers who switch from one
queue to another hoping to receive service more quickly are said to
beJockeying.
Q. In service
discipline if the customers are served in the order of their arrival, then this
is known as the _________
A. First-come-first-served (FCFS)
Q. If customer
arrives at known intervals and the service time is known with certainty, the
nature of queuing model will be ____
A. Deterministic
Q.If the arrivals are
completely random, then the probability distribution of number of arrivals in a
fixed time –interval follows ________
A. Poisson distribution
Q. First in first
out discipline is indicated by
A. (M/M/1): (∞/FIFO)
Q. The unit of
traffic intensity is
A. Erlang
Q. What is Network
Analysis?
A. The OR techniques used for
planning, scheduling and controlling large and complex projects are known as
network Analysis.
Q. Activities which
cannot be started until one or more of other activities are completed but immediately
succeed them are called ________?
A. Successor activity
Q. What is Dummy
activity?
A. An activity which does not
consume any kind of resources but merely depicts the technological dependence
is called dummy activity.
Q. To disconnect an
activity before the completion of all activities in a network diagram is known
_________ error.
A. Dangling error
Q. The event
marking start of an activity called ________event and the event marking the end
is termed as ______event.
A. head/ tail
Q. A standard procedure
called i-j rule for convenience labeling on a network diagram was developed by
__________?
A. D.R.F Fulkerson
Q. CPM stands for?
A. Critical Path Method
Q. If value of
total float for any activity is equal to zero, then one can draw conclusion
that resources are _________
A. Just sufficient
Q. The difference
between the latest and the earliest finish times of an activity is its ________
float
A. Total float
Q. What is critical
path?
A. The longest path in the CPM
network is called the critical path.
Q. What is
optimistic time?
A. The shortest amount of time that
could be required to complete the activity assuming that everything goes very
well is known asOptimistic time.
Q. CPM is
__________ oriented
A. Event
Q. The sum total of
variances of critical activity times gives the ________of the overall project
completion time.
A. variance
Q. The greatest
amount of time that could be required to complete the activity if everything
goes wrong is known as
A. Pessimistic time
Q. PERT Stands for?
A. Program evaluation and review
technique
Q. A PERT chart
uses circles or rectangles called ______ to represent project events
A. Nodes
Refrences:-
1.
ICAR
E-course
2.
Online
Quiz
3.
Previous
year question papers
Comments
Post a Comment