A

Question A B C D
ns
both a surplus
In converting a less-than-or-equal constraint for use in a surplus an artificial
a slack variable. and a slack A
a simplex table, we must add variable. variable.
variable
A relation
function to be
Objective function of a linear programming problem is a constraint between the None of these. B
obtimized
variables
a slack and an a surplus and an a slack and a
In converting a greater-than-or-equal constraint for use an artificial
artificial artificial surplus C
in a simplex table, we must add variable.
variable. variable variable.
The Cj - Zj row in a Simplex table for maximization
profit per unit. constraints. gross profit. net profit. D
represents
Which technique is used in finding a solution for optimizing
Quailing Linear
a given objective, such as profit maximization or cost Waiting Line Both A and B D
reduction under certain constraints?
Theory Programming
For a maximization problem using a Simplex table, we
has no numbers has no positive has no negative
know we have reached the optimal solution when the None of these. B
in it. numbers in it. numbers in it.
Cj - Zj row
dividing every
number in the
dividing every dividing every
pivot row by
number in the number in the
In a Simplex table, the pivot row is computed by the None of these. B
profit row by the pivot row by the
corresponding
pivot number pivot number.
number in the
profit row.
there are no
special
A feasible solution requires that all artificial variables greater than requirements
less than zero. equal to zero. B
is zero. on artificial
variables; they
may take on
 any value.

The standard form of LPP if the objective function is of greater than or lesser than or
equations. Inequalities. A
minimization then all the constraints __________. equal to type equal to type
one optimal Two optimal
An LPP has _________ Three none of these D
solutions. solutions.
Which of the following is not associated with any feasible optimum Quadratic
Basic solution D
LPP_____________. solution solution equation.
It cannot be It implies that Extreme points
determined in a It is independent there must be a of the convex
Which of the following is not true about
graphical of the objective convex region region gives A
feasibility__________?
solution of an function. satisfying all the the optimum
LPP. constraints. solution.
In Graphical solution the feasible solution is any
solution to a LPP which only objective non-negativity
only constraint all the three B
satisfies function restriction
____________ .
The feasible
region will Each parameter is Every LP problem Decision variables
Which of the following statements is NOT true regarding linear
programming (LP)?
assumed known with must have one or are assumed to be A
always have at certainty. more constraints continuous.
least one point.
which
which which which satisfies
maximizes or
maximizes the minimizes the the non
Optimal solution in an LPP is ___________. minimizes the A
objective objective negativity
objective
function. function. restrictions
function
The canonical form of LPP if the objective function is
greater than greater than or lesser than or
of maximization, then all the constraints other than lesser than type D
type equal to type equal to type.
non-negativity conditions are __________.
 The objective The constraints
If the number of available constraints is 3 and the number of The solution is
function can be are short in None of these B
parameters to be optimized is 4, then problem oriented
optimized number
The canonical form of LPP if the objective function is
of minimization then greater than greater than or lesser than or
lesser than type C
all the constraints other than non-negativity conditions type. equal to type equal to type.
are ________.
Which of the following is not associated with any feasible optimum quadratic
Basic solution D
L.P.P_________? solution solution. equation.
The __________ is the method available for solving an graphical least cost Hungarian
MODI method. A
L.P.P. method method. method
In Simplex method,the feasible basic solution must non negativity negativity comman
Basic constraint A
satisfy the constraint constraint constraint
The maximum value of the object function Z = 5x + 10
y subject to the constraints x + 2y ≤ 120, x + y ≥ 60, x – 300 600 400 800 B
2y ≥ 0, x ≥ 0, y ≥ 0 is
find a basic include them in facilitate the
SIMPLEX uses artificial variables in order to feasible the optimal modelling of the None of these A
solution solution problem

has the same

For the 2-Phases Method, the objective function of the is a is a sense as the
All of these A
first phase minimization maximization original
objective

When artificial variables appear in the optimal solution, Wrong

Degenerated Unbounded Infeasible C
we say the problem is question

In a matrix of transition probability, the element aij

Gain Loss Retention None of these C
where i=j is a ---
 Be greater than
In Markov analysis, state probabilities must: Sum to one Be less than one None of these A
one
State transition probabilities in the Markov chain Be greater than
Sum to 1 Be less than 1 None of these A
should 1
If a matrix of transition probability is of the order n*n,
n n+1 n-1 None of these A
then the number of equilibrium equations would be
The transition matrix elements remain positive from Steady-state Equilibrium Regular
All of these C
one point to the next. This property is known as: property property property
Predicting the Calculating
state of the transition
Markov analysis is useful for All of these None of these. C
system at some probabilities at
future tim some future time
There are a A future state
There are
Which of the following is not one of the assumptions of limited number can be predicted
limited number None of these. C
Markov analysis: of possible from the
of future periods
states preceding one
analyzing the maximal
Markov analysis is a technique that deals with the using Bayes' time series
presently known flow B
probabilities of future occurrences by theorem. forecasting.
probabilities. technique.
university
technology machine
Markov analysis might be effectively used for retention All of these D
transfer studies. breakdowns.
analysis.
matrix of
In Markov analysis, the likelihood that any system will transition- matrix of state
identity matrix. transition C
change from one period to the next is revealed by the elasticities. probabilities.
probabilities
Occasionally, a state is entered which will not allow an equilibrium a terminal
stable mobility. None of these. C
going to another state in the future. This is called state. state.
There are a A future state
There are
Which of the following is not one of the assumptions of limited number can be predicted
limited number All of these C
Markov analysis: of possible from the
of future periods
states preceding one
 It is applicable
Several options
in cases where
of measure of Complex real-
An advantage of simulation as opposed to optimization there is an
performance life problems All of these D
is that element of
can be can be studied
randomness in a
examined
system
Understand
properties & Reduce the cost
Imitate a real- operating of experiment
The purpose of using simulation technique is to All of these D
world situation characteristics on a model of
of complex real- real situation
life problems
As simulation is not an analytical model, therefore the
Unrealistic Exact Approximation Simplified C
result of simulation must be viewed as
Not necessary Necessary to
Necessary to
to assign the assign the
develop a
While assigning random numbers in Monte Carlo exact range of particular
cumulative All of these B
simulation, it is random number appropriate
probability
interval as the random
distribution
probability numbers
Identify suitable
values of
Identify
decision
Analytical results are taken into consideration before a suitable values Determine the
variables for the All of these C
simulation study so as to of the system optimal decision
specific choices
parameters
of system
parameters
Probability
Biased random sampling is made from among Equal Unequal
which do not None of these B
alternatives which have probability probability
sum to 1
 pij are called
pij are called one- step
pij are called n pij are called (j-
For a Markov chain X n with state space S, transition transition
step transition i) step transition D
pij=P[Xn+1=j/Xn=i]] for all i,j ∈ 𝑆, then probabilities of probabilities
probabilities. probabilities
order n from state i to
state j
They may be
It is difficult to
Their average expensive to
Large complicated simulation models are appreciated create the
costs are not write and use as All of these C
because appropriate
well-defined an experimental
events
device
Requires
considerable
talent for model Provides at best
building & Consumes much approximate
Simulation should not be applied in all cases because it. All of these D
extensive computer time solution to
computer problem
programming
efforts
Simulation models can be used to obtain operating
Time
characteristic estimates in less time than with the real Warp speed Microseconds None of these. A
compression
system using a feature of simulation called
Random-
Monte Carlo simulation gets its name from which of Model
Data collection number Analysis C
the following? formulation
assignment
Conduct
Relationship
Optimized experiments
between the Answers 1 and
Select the valid reasons for using simulation. solutions are without D
variables is 3
obtained disrupting the
nonlinear
real system
There is a Transition There is a single
While calculating equilibrium probabilities for a
single probabilities do non-absorbing None of these B
Markov process,it is assumed that?
absorbing state not change state
The time required by each job in each machine is called
Elasped Idle Processing Average C
----- time.
The order in which machines are required for
Machines order working order processing order Job order C
completing the jobs is called ------.
The time between the starting of the first job and
completion of the last job in sequencing problem is total time assignment time elapsed time idle time C
called -----.
The time during which a machine a machine remains
waiting or vacant in sequenceing problem is called ----- Processing waiting idle free C
time.
In sequencing problem, the order of completion of jobs completion
job sequence processing order Job order B
is called -----. sequence
The total time required to complete all the jobs in a job processing
idle time Processing time elapsed time C
sequencing problem is known as -------. order
additional horizantal
job enlargement does not have scope for full autonomy variety in job C
responsibility addtion of jobs
------ is the basis for job analysis, job descriptionand job
job rotation job design job enrichment B
job specification. enlargement
Manager makes the job of an employee more
vertically horizontally parallel lateral B
interesting by enlarging his job.
Assigning specific jobs to each work centre for the
loading routing dispatching mapping A
planning period is called.
Which of the following is a pre-requisite for
job rotation job enrichment job enlargement All of these B
empowerment of personnel
which of the following minimizes the ideal time of an Johnsons critical ratio
SPT Rule EDD Rule B
n-jobs and 2 machine problems. algorithm rule
----- investigates the job content, the physical
conditions in which the job is done and the job
job description job analysis job profile B
qualifications that are necessary to carry out job specification
responsibilities.
 shortest
longest slack earliest due date critical ratio
Which of the following is not a job sequencing rule. processing time A
time rule rule
rule
job represented
job represented
on x axis is
on x axis is
While solving a 2 job n stations in random order progressing
waiting while both jobs are both jobs are
problem graphically, a horizontal line on the graph while job A
job represented progressing waiting
indicates. represented on
on y axis is
y axis is
progressing
waiting
Used to track used to depic used to track
can adapt to
the work load levels progress of jobs
Which of the following is not an application of Gantt changes in
performance of for equipment, as they go A
Chart. scheduling
shop floor workstations or thorugh various
requirement
workers department departments
if the
minimum time
of processing a
if the jobs are if some jobs are
if all jobs follow job on
to be processed to be processed
The johnson's rule can be applied to a n job 2 station the same order machine one
in random on one machine B
situtation for processing igs greater
order on the and some on the
on the machines than the
machines other
maximum time
on machine
two
On a given machine only ------ job can be processed at
one two three four A
a time.
 to find the
sequence in
which jobs on
to find the to find the time hand are to be
order in which required for the processed to to maximize
The objective of sequencing problem is----- C
jobs are to be completing all minimize the the cost
made the job on hand total time
required for
processing the
jobs
In sequencing,an optimalpath is one that minimizes-----
Elasped time Idle time Both a and b Ready time C
--
If job A to D have processing time as 5,6,8,4 on first
machine and 4,7,9,10 on 2nd machine then the optimal CDAB DBCA BCDA ABCD B
sequesnce is
if there are n jobs and m machines then there will be ---
mn m(n!) n^m (n!) ^m D
-- sequences of doing the jobs
the time of
passing
In solving 2 machines n jobs sequencing problem, the No passing is processing times handling time is
depends on the D
following assumption is wrong allowed are known negligible
order of
machining
The time interval between starting the first job and Total
Total elapsed Total average
completing the last job including the idle time(if any) Total Idle time Processing B
time time
in a particular by the given set of machines is called time
The time for which a machine j does not have a job to
Idle time Processing time average time Elasped time A
process to the start of job is called --------
Decision theory Replacement
--------- and------ techniques applied in project Assignment &
cpm &pert & Inventory & Queuing A
management transportation
model theory
Operation research techniques are ---- in nature Judgemental Qualitative Quantitative approximate C
Longest path in network diagram is known as -----path best worth non critical critical D
Forward pass calculation are done to find -----
exact earliest latest approximate B
occurrence times of event
Backward pass calculation are done to find -----
exact earliest latest approximate C
occurrence times of event
Floats for critical activities will be always zero one N large A
Activity which represent by dotted line is known as-----
precding succeding dummy critical C
activity
measurable & visible & non normal &
Two types of costs involved in project crashing total & partial D
non measurable visible crash
In PERT time estimate calculate using formula
optimistic pessimistic most likely expected D
(to+4tm+tp/6) is known as----- time
Forward & pessimistic &
For calculation of float -------- & ------ method required Front & Back normal & crash A
Backward optimistic
Program Program Program Program
Evaluation and Evaluation and Evaluation and Evaluation and
The full form of PERT is ___________ D
Rate Robot Robot Review
Technology Technique Technology Techniques
Critical Path Control Path Critical Plan Control Path
The full form of CPM is ___________ A
Method Method Management Management
_________ are used to represent activity in a network
Circles Squares Rectangles Arrows D
diagram.
Most likely
What is PERT analysis based on? Optimistic time Pessimistic time All of these D
time
What is the completion of a CPM network diagram
Connector Event Node All of these D
activity commonly known as?
assignment calculation PERT CPM
What is PERT &CPM C
techniques techniques techniques techniques
PERT network is activity oriented and CPM network is
correct incorrect maximum minimum B
event oriented
 Activity
Time oriented Target oriented event oriented
CPM is ------- oriented D
technique technique technique
technique
Activity
Time oriented Target oriented event oriented
PERT is ------- oriented C
technique technique technique
technique
Difference between maximum time available and Independent
Total Float Free Float Half Float A
actual time needed to perform an activity Float
Network Circle Circuit Float
diagram is also known as-------- A
Diagram diagram diagram diagram
Time Scheduling Expected Optimistic
Ts is referred for ------ B
Schedule Time time time
Operation Optimization Optimization
PERT & CPM these Both methods are for Optimization A
Research Research reversal
Techniques
Project is an ----- to perform specific task Task Activity Node Arrow B
Crashing activity calculated by using formula for-- crash cost crash time cost slope normal time C
What is the particular task performance in CPM known
dummy event activity contract C
as
It compares the It compares the
activity’s activity’s end It directs when It regulates
What is the earliest start time rule starting time time for an a project can when a project B
for an activity activity start. must begin.
successor. predecessor.
Activities A, B, and C are the immediate predecessors
for Y activity. If the earliest finishing time for the three can not
10 15 12 B
activities are 12, 15, and 10, then what will be the determine
earliest starting time for Y
Which of the following is not a phase of project Project Project Project
Project being D
management planning scheduling controlling
 According to the time estimates made by the PERT
most likely pessimistic time optimistic time expeted time
planners, the maximum time that would be needed to B
time estimate estimate estimates estimates
complete an activity is called as __________
is an used in provide realistic
Critical path method bar chart approach to avoids delays All of these D
method daily problems
artificially represented by does not
A dummy activity All of these D
introduced dotted line consume time
The estimated time required to perform an activity, is
event dummy duration float C
known as
The critical activity has maximum float minimum float zero float none of these C
For completion of a project, the critical path of the
minimum time maximum time minimum cost maximum cost A
network represents
Which one of the following is a part of every game
players payoffs probabilities strategies A
theory model?
Outcomes of playing a game is known as – players play payoff strategies C
The game is called fair if the value of the game is---- zero one two all A
if maximin and minimax is same that corresponding
middle point corner point saddle point none of these C
row and column is known as –
dominant
extensive & players,strategi
The basic elements of a game are: game trees strategy & D
normal form es & payoff
threats
number of sum of all number of
Game theory models are classified by the all of these D
players payoffs strategies
What happens when maximin and minimax values of solution is saddle point no solution
none of these B
the game are same? mixed exists exists
algebraic graphical
A mixed strategy game can be solved by matrix method all of these D
method method
The size of the payoff matrix of a game can be reduced rotation game
game inversion dominance C
by using the principle of reduction transpose
 conflicting
Games which involve more than two players are called negotial games N persons game all of these C
games
The payoff value for which each player in a game equalibrium
Saddle point both A &B none of these A
always selects the same strategy is called the point
reducing the
finding the
size of the
When no saddle point is found in a payoff matrix of a solving any one average of all
game to apply none of these A
game, the value of the game is then found by 2x2 subgame the values of the
the algebraic
payoff matrix
method
maximin value minimax value
minimax value =
A saddle point exists when = maximax = maximin none of these C
minimum value
value value
each player
selects the same each player
no saddle point strategy without always selects
In a mixed strategy game all of these A
exists considering the same
other player’s strategy
choice
selecting resolving giving equal
Game theory is the study of optimal conflict between outcome to none of these D
strategies players participants
represents the represents the is the is Expected
While using Hurwitz criterion, the coefficient of
degree of degree of probability of a Monetory A
realism ( α )
optimism pessimism state of nature Value
The maximin criteria is a(n) __________ criteria. optimistic neutral pessimistic rational C
Which of the following might be viewed as an Hurwicz
Maximax Maximin Minimax B
"optimistic" decision criterion? criterion
Hurwicz alpha criterion represents __________
Optimistic Pessimistic Realsistic Rational C
approach
The decision-maker’s knowledge and experience may
Hurwicz
influence the decision-making process when using the Maximin Maximax Laplace D
Alpha
criterion of
in Hurwicz Alpha criterion value of coefficient of
optimism (α) is between 0 to 1. if α = 0 implies Maximin Maximax Laplace EMV A
pessimism i.e.
Arrange the steps involved in ecision making process:
P) Identify the problem to be solved
Q) Collection of Rellavant data for solving problem
R) Develioping Various Alternatives for solving the
problem
PSQRUT PSQRTU PQSRTU PSRQTU A
S) Define objectives sought by the solution of the
problem
T) Select the best alternative and implement it.
U) Evaluate all alternative in the light of the solution
objective using a suitable criterion
Decision envirnment where the decision maker is Decision Decision Decision Decision
aware of all possible states of nature but does not know making under making under making under making under B
their occurances with certainty , it is reffered as conflict risk uncertainty certainty
In decision making under ________, there are several
possible outcomes for each alternative, and the decision risk utility certainty probability A
maker knows the probability of occurrence of each outcome
Decision
Elements of Decision Making model are States of Nature Pay off Table All of Above D
alternatives
Expected value
Expected Expected
The _______________can be referred to as a graphic of perfect
opportunity Decision tree monetary B
model of a decision process. information
loss (EOL) value (EMV)
(EVPI)
For regret criterion, the given payoff matrix is New payoff Diagonal payoff Opportunity Rectangular
C
converted into _________________. matrix matrix loss payoff matrix
The minimin criterion is used when consequences are Opportunity
Probabilities Table Payoff C
given in the form of _______________. loss
In the maximin criterion, a decision maker selects the
average, maximum, maximum, minimum,
___________profit from the set of B
maximum minimum average maximum
______________profit.
The Laplace criterion is based on the simple principal
dependent
that since probabilities of state of nature are unknown, equally likely valuable events defined events A
events
various events can be treated as ______________.
Values in payoff matrix are ____________________
unconditional certain uncertain conditional D
because of uncertain state of nature.
Problems based on the phenomenon of decision making Numerical Complex Probabilistic
None of above C
under risk are referred to as ______________. Problem problem problems
A decision node is generally represented by a
_______________ and is a decision point where a
dotted line square circle line B
decision maker must select one action from amongst
several possible actions.
In the Hurwicz approach , Coefficient of Pessimism is
α 1- α 1/α α2 B
denoted by
A Businessman has 3 alternative actions that he can
take. Each of these follows 4 possible events. Find
optimal decision under Maximin and Laplace criterion. III,II III,III II,III II,IV B
The conditional Payoffs for each action event
combination are as under:
In probabilistic problems, after any combination of act
victory or payoff (reward) successful or delight or
and event, there is a final outcome that may be viewed B
defeat or loss unsuccessful sadness
in two ways: ____________________.
Find strategy using Maximax and Laplace Criterion.
The conditional pay off in crores of rupees for the three
X, Z X,X Y,Y Z,Z D
models of a car for the various likely sales figures are
as follows:
Omega manufacturing company ltd. is proposing to
introduce two models of a Radio set X and Y which
vary in complexity , but the company has sufficient
capacity to manufacture only one model. Find
Model Y , Model X Model X , Model X,
i) Which model should the company introduce?
Worth Rs Worth Rs. Worth Rs. Worth Rs. C
ii) How much is it worth to know the model acceptance
6,10,000 9,000 20,000 7,00,000
level before making the decision?
An analysis of the probable acceptance of the two
models has been carried out and the resulting profits (in
Rs. Ten thousands) are given in table.

Calculate Maximin and Maximax for following Pay-off

6 , 85 8 , 78 12 , 85 6, 78 C
Table
A bakery owner has to buy 100 units of cakes A and B
from the producer at the beginning of a week. The
Cake A costs him Rs. 5 which he sells at Rs. 9 per
unit.Similarly, cake B costs him Rs. 4 per unit which he
sells for Rs. 7 . The expected demands per week for
these cake couls be 80,90,100 or 110 units. Any cake A,cake A cake A,cake B cake B,cake A cake B,cake B A
quantity of cakes remaining at the end of a week is
collected back by the producer for Rs. 2 per unit.
Identify which of the cakes A or B should bakery
owner buy using i) Maximax criterion and ii) Laplace
criterion