OPERATION RESEARCH Unit 1 Question1: During world war II the country that used Operations Research method is….. Britain* U.S.A Russia China Question2: A blue print is an……… Symbollic Model Schematic Model Iconic Model * Dynamic Model Question3: Establishment of the objectives is considered in…… Action phase Judgment phase* Research phase Implementation phase Question4: Graphs and charts belong to…….. Physical model* Mathematical model Deterministic model General model Question5: In Hospitals Operations Research is used to study……
119
Embed
sagarsir9.files.wordpress.com · Web viewUnit 1. Question1: During world war II the country that used Operations Research method is….. Britain* U.S.A. Russia. China. Question2:
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
OPERATION RESEARCH
Unit 1
Question1: During world war II the country that used Operations Research method is…..
Britain*
U.S.A
Russia
China
Question2: A blue print is an………
Symbollic Model
Schematic Model
Iconic Model *
Dynamic Model
Question3: Establishment of the objectives is considered in……
Action phase
Judgment phase*
Research phase
Implementation phase
Question4: Graphs and charts belong to……..
Physical model*
Mathematical model
Deterministic model
General model
Question5: In Hospitals Operations Research is used to study……
Number of beds
Waiting problem*
Plan and layout
Types of departments
OPERATION RESEARCH
Question6: In India Operations Research was started in
1952
1960
1949*
1964
Question7 :In industry scheduling and sequencing is applied in Research and Development..
Purchasing
Production*
Finance
Question:
Que 8. In the Research phase we decide……
Formulation of the problems
Determination of the operation
Making recommendations
Formulation of hypothesis and model*
Question9: Large and Complex problems can be solved by Operations Research methods using
Statistical techniques
Mathematical techniques
Ecometric techniques
Availability of high speed computers*
Question10: Many industrial and Business situations are not concerned with…..
Making profit
OPERATION RESEARCH
Increasing percentage of their share
Cost reduction
Planning activities*
Question:11 Models are
Small size representation
Representation of relationships only
An abstraction of some real-life system*
Well decorated piece
Question: 12 Models that employ a set of symbols are known as
Analogue model
Symbolic model*
Static model
Descriptive model
Question: 13 One of the advantage of using Operations Research is
Easy solution
OPERATION RESEARCH
Lesser constraints
Better coordination*
More resources
Question:14 One of the drawbacks of model is
Provide a good grip over the problem
It can incorporate tools Construction of models require services of subject experts*
They indicate scope
Question15: One of the main draw back of Operations Research application is
Human relations and behaviour*
Complex problems
Mathematical formulation
Establishing relationship between variables
Question16 : One of the most commonly used Operations Research technique is
Tests of hypothesis
Input-output analysis
Variation in parameters
OPERATION RESEARCH
Simulation*
Question17 : Operations Research approaches problem solving and decision making from
Individual's view
Departmental view
Technical view
The total system's view**
Question18 : Operations Research is based on
Methodological approach
Mathematical approach*
Statistical approach
Applied sciences
Question19: Operations Research provides
Earliest solution
Feasible solutions
Scientific approach to solutions*
Statistical approach to solutions
Question:20 Operations Research totally eliminates
Quantitative approach
Intuitive approach*
Qualitative approach
Decision makers ability
Question:21 The definition "Operations Research is application of scientific methods, techniques and tools to operation system with optimal solution to the problems" was given by
Morse and Kimble
Churchman, Ackoff and Arnoff*
Miller and Stasr
OPERATION RESEARCH
James Lendy
Question 22: The interaction between the operation research team and the operating personnel will reach its peak in
Construction stage
Solution stage
Implementation stage*
Validation stage
Question: 23 The number of phases of Operations Research is
3*
4
5
6
Question:24 The problems relating objectives and constraints are known as
Maximization
Minimization
Optimization
Constrained optimization*
Question25: The solution obtained using Operations Research technique makes
Objectives clear
Assumptions clear
Objectives and assumptions clear *
Resources clear
Question 26 : The scientific method in Operation Research consists of
All the above*
Judgement Phase
OPERATION RESEARCH
Research Phase
Action Phase
Question 27: Every mathematical model
must be Deterministic
requires computer aid for its solution
represents data in numerical form
ALL of the above
Question 28: Operation Research techniques are not applicable in the following situation:
Resources available are unlimited*
Objectives can be defined for maximization or Minimization.
Sufficient input data is available for formulating the problem.
Scientific methods, techniques and tools may be applied.
Question 29 : Which of the following is not correct?
O.R is applied decision theory
O.R is the art of giving good answers to problems which otherwise have best answers*
O.R is a scientific approach to problems solving for executive management.
O.R is the science of use.
Question30 : which of the following is not correct?
A model should be simple & coherent.
A model should not take much time in its construction for any problem.
A model representing the typical budget of business accounts is called 'account Model'
A model which has the probability of measuring observations is called 'Quailitative model'****
Q.)31 The scientific method in O.R. study generally involves A. Judgement Phase
B. Research Phase
OPERATION RESEARCH
C. Action Phase D. All of the given E. None of the given
Q.32) Which of the following is not a major requirement of a Linear Programming Problem? A. There must be alternative course of action among which to decide
B. An objective for the firm must exist C. The problem must be of maximization type
D. Resources must be limited Q.33) Which of the following assertations is true of an optimal solution to an Linear Programming Problem? A. Every LP has an optimal solution B. The optimal solution always occur at extreme points
C. If an optimal solution exists, there will always be atleast one at a corner
D. All of the given
Q34.The management problem may be to optimize
Maximize the output
Minimize the output
Both a) and b)*
None of the above
Q35. In simple situation decisions are taken simply by -------
a) O Rb) Mathematical equation c) Common sense*d) All of the above
Q36.Mathematical model can best be discussed through its constituents they are
a) Decision variableb) Objective functionc) Constraintsd) All of the above*
Q37. The output or the -------------- subject to the set of ------
OPERATION RESEARCH
a) Problem, constraintsb) Objective function, constraints*c) Constraints, objective functiond) None of the above
Q38 .Ojective of operation research is to provide a --------- basis to the ----------- for solving the problems involving the interaction of various ------------ of organization, by employing a team of -------------- from different disciplines, all working -------- for finding a solution which is the best in the interest of the organization as a whole.
Question40 : Dr.Bhaskar is the chairman of a company. He is interested in O.R and its applications. He has called MBA graduates a) Anand b) Amar c) Anil d) Arjun for interview. But he himself does not know much about O.R. There fore he calls for an O.R specialist's service. i. He wants to know in a simple way "what does O.R stands for"
O.R is an aid
OPERATION RESEARCH
Methodology adopted to take decision
O.R is an art of giving bad answers to problem
Scientific method for getting optimal solution on quantitative basis*
Question42: Mr .Bhaskar is a chairman of a company.He is interested in O.R & its applications He has called MBA graduates a) Anand b) Amar c) Anil d) Arjun for interview. But he himself does not know much about O.R. There fore he calls for an O.R specialist's service. ii. When and where OR came into existence in India?
1957, O.R.Society of India, Calcutta
1959, Delhi conference
1953, Indian Statistical Institute, Calcutta
1949, Regional research laboratory, Hyderabad *
Question43 : Mr .Bhaskar is a chairman of a company.He is interested in O.R & its applications. He has called MBA graduates a) Anand b) Amar c) Anil d) Arjun for interview. But he himself does not know much about O.R. There fore he calls for an O.R specialist's service. iii. One of the characteristics of OR is
Make use of all available information
Gives solution to problems
Improves the quality of decisions
Does not consider human factors *
Question44: Mr .Bhaskar is a chairman of a company.He is interested in O.R & its applications. He has called MBA graduates a) Anand b) Amar c) Anil d) Arjun for interview. But he himself does not know much about O.R. There fore he calls for an O.R specialist's service. iv. Its process is
Concentrates on specific problem and gives solution
All factors affecting the system is taken into account to form a Mathematical model and obtain solution on the system
as a whole *
Concentrate on solution that will be beneficial to stake holders
Concentrates on individuals opinion to give solution that satisfies him
Question45 : Dr.Bhaskar is the chairman of a company. He is interested in O.R and its applications. He has called MBA graduates a) Anand b) Amar c) Anil d) Arjun for interview. But he himself does not know much about O.R. There fore he calls for an O.R specialist's service. i. By effectiveness measures of a model we mean
A measure of success of the model relative to the objectives*
OPERATION RESEARCH
Transferring innovations to other fields
Ability to forecast the problem solution with future changes
Determination of the problem type
Question46 : Mr.Bhaskar is the chairman of a company. He is interested in O.R and its applications. He has called MBA graduates a) Anand b) Amar c) Anil d) Arjun for interview. But he himself does not know much about O.R. There fore he calls for an O.R specialist's service. ii. Formulation of the problem relative to the objective comes under
Judgment phase*
Research phase
Implementation phase
Action phase
Question 47: Mr.Bhaskar is the chairman of a company. He is interested in O.R and its applications. He has called MBA graduates a) Anand b) Amar c) Anil d) Arjun for interview. But he himself does not know much about O.R. There fore he calls for an O.R specialist's service. iii. The need for O.R in industry is due to
Scarcity of resources
Complexity of problem*
Customer demand
Policies of Government
Question48 : Mr.Bhaskar is the chairman of a company. He is interested in O.R and its applications. He has called MBA graduates a) Anand b) Amar c) Anil d) Arjun for interview. But he himself does not know much about O.R. There fore he calls for an O.R specialist's service. iv. In both developing and developed economies O.R helps in
Activating*
Planning
Improving profit
Reducing cost
Question49: Mr .Bhaskar is a chairman of a company.He is interested in O.R & its applications. He has called MBA graduates a) Anand b) Amar c) Anil d) Arjun for interview. But he himself does not know much about O.R. There fore he calls for an O.R specialist's service. i. In Finance O.R can be applied in
Profit plan for the company*
Wage determination
OPERATION RESEARCH
Assignment of jobs
Selection, location and design of production plants
Question50: Mr .Bhaskar is a chairman of a company.He is interested in O.R & its applications. He has called MBA graduates a) Anand b) Amar c) Anil d) Arjun for interview. But he himself does not know much about O.R. There fore he calls for an O.R specialist's service. ii. Optimal solution to EOQ model is based on
Matrix
Differential calculus*
Algebraic
Integral calculus
Question 51: Mr .Bhaskar is a chairman of a company.He is interested in O.R & its applications. He has called MBA graduates a) Anand b) Amar c) Anil d) Arjun for interview. But he himself does not know much about O.R. There fore he calls for an O.R specialist's service. iii. In numerical procedure of trying various values of controllable variables in the model, their value approaches optimum.
Through better control
Through flexible changes in variables
Through simulation
Through successive iteration*
Question 52: Mr.Bhaskar is the chairman of a company. He is interested in O.R and its applications. He has called MBA graduates a) Anand b) Amar c) Anil d) Arjun for interview. But he himself does not know much about O.R. There fore he calls for an O.R specialist's service. iv. Mathematical models are classified by
Structure
Extent of generality
Degree of abstraction*
Function
Question53: Mr .Bhaskar is a chairman of a company.He is interested in O.R & its applications. He has called MBA graduates a) Anand b) Amar c) Anil d) Arjun for interview. But he himself does not know much about O.R. There fore he calls for an O.R specialist's service. i. Organization chart belong to
Deterministic model
OPERATION RESEARCH
Static model
Analogue model*
Iconic model
Question54: Mr .Bhaskar is a chairman of a company.He is interested in O.R & its applications. He has called MBA graduates a) Anand b) Amar c) Anil d) Arjun for interview. But he himself does not know much about O.R. There fore he calls for an O.R specialist's service. ii. One of th advantage of the model is:
Construction is easy
Are idea1ized representation
Provides a logical and systematic approach*
It does not consume time
Question 55: Mr .Bhaskar is a chairman of a company.He is interested in O.R & its applications. He has called MBA graduates a) Anand b) Amar c) Anil d) Arjun for interview. But he himself does not know much about O.R. There fore he calls for an O.R specialist's service. iii. Queing model is based on the concept of
concept of probabilty*
concept of optimization
concept of linear programming
concept of queing theory
UNIT 2
Question1:
OPERATION RESEARCH
Question2:
Question3:
A firm produces two types of products A and B. The contribution of A is Rs.50 / unit and of B is Rs.100 / unit then the objective function will be
Min Z= 50X + 100Y
Max Z = - 50X – 100Y
Max Z = 50X + 100 Y
Min Z = -50X + 100Y
Question4:
A solution is said to be degenerate if
One or more basic variables are zero
All basic variable are not equal to zero
All non basic variable are not equal to zero
All non basic variable are zero.
Question: 5
A solution is said to be infeasible if
Feasible region exists
OPERATION RESEARCH
Feasible region is a convex set
Feasible region does not exist
Feasible region is a concave set
Question6:
All coefficients of decision variables in the objective and constraints expression should be
:
Linear
Deterministic
Additive
Divisible
Question7:
Any constraint in two variables divides the graph
Into 4 portions
Into 2 half planes
Into 2 portions
Into positive and negative halves
Question8: Any non-negative values of the variables lead to
Solution
Infeasible solution
Feasible solution Basic solution
OPERATION RESEARCH
Question9:
Question10:
Existence of alternative courses of action in L.P.P is
An assumption
A hypothesis
An objective
A basic requirement
Question11: Graphical method of getting solution is restricted to
5 Variables
4 Variables
2 Variables
3 Variables
Question12: If the solution set satisfies both non-negativity conditions and constraints then it is said to be
A basic feasible solution
Solution
Optimal solution A feasible solution
OPERATION RESEARCH
Question13:
a
b
c
d
Question14:
Question15: In graphical method a solution is said to be unbounded if
Feasible region does not contains infinity as a corner point
Feasible region contains infinity and the objective function is to be maximized
Feasible region is bounded Feasible region contains infinity as a corner point
OPERATION RESEARCH
Question16:
a
b
c
d
Question17: Linear programming helps management
To allocate limited and scarce resources
To allocate products To formulate a problem
To find solution
Question18: Multiple solution exists if
Objective functions slope is - 1
Objective functions is + 1
OPERATION RESEARCH
Objective functions slope ~= slope of one of the one of constrains
Objective functions slope = slope of one of the one of the constraints
Question19:Optimal solution always occurs
On the boundaries of feasible region
Anywhere
At corner points of feasible region
Within the feasible region
Question20:
a
b
C
D
OPERATION RESEARCH
Question21:
a
b
c. d
Question22:
The canonical form of the general L.P.P
Maximizes objective function
Determines maximum value of some of decision variables
Determines minimum value of some of decision variables
Minimizes objective function.
Question23:
OPERATION RESEARCH
a
bc
d
Question24:
a
b
c
d
OPERATION RESEARCH
Question25:To draw the constraint 4X + 5Y <= 20, we take the points
(20, 5)
(4, 5)
(4, 20)
(5, 4)
Question26:
Response:
ab
c
d
Question27:
OPERATION RESEARCH
a
b
c
d
Question28:
a
b
OPERATION RESEARCH
c
d
Question29:
a
b
c
d
Question30:
OPERATION RESEARCH
a
b
c
d
Question31: Each constraint in an LP model is expressed as an
Inequality with ≥ sign.Inequality with ≤ sign
Equation with = sign
None of the above.
Question32:A feasible solution to an LP problem
OPERATION RESEARCH
Must satisfy all of the problem's constraints simulataneouslyneed not satisfy all of the constraints , only some of them.
must be a corner point of the feasible regionmust optimize the value of the objective function.
Question33:
The solution space (region) of an LP problem is Unbounded due to:
an incorrect formulation of the LP model.Objective function is unbalancedneither (a) nor (b).both (a) and (b)
Question34:
While plotting constraints on a graph paper, terminal points on both the axes are connected by a straight line because
The resources are limited in supply
the objective function is a linear functionthe constraints are linear equations or inequalities.
All of the above
Question35: The feasible region represented by the constraints X1+X2≤1, 3X1+X2≥3, X1≥0,X2≥0 of the objective function Z= X1+2X2 is:
A polygon
Unbounded setEmpty set
A singleton set
Question36:
A feasible solution to an LP problem
Must satisfy all of the problem's constraints simulataneouslyneed not satisfy all of the constraints , only some of them.
must be a corner point of the feasible region
OPERATION RESEARCH
must optimize the value of the objective function.
Question37:
The solution space (region) of an LP problem is Unbounded due to:
an incorrect formulation of the LP model.Objective function is unbalancedneither (a) nor (b)This is the Right choice.both (a) and (b)
UNIT 3
Question: For the first simplex table the variable that can be a Basic variable is
Slack
Artificial
Profit variable Decision variable
OPERATION RESEARCH
Question: A solution that satisfies all constraints is known as
Optimum Solution
Non-feasible Solution
Feasible Solution
Basic Solution
Question: Given a set of 4 simultaneous linear equations in 6 unknowns, Ax = B, then rank of A is
4
56Cannot be found
Question: If any one of basic variable becomes zero in optimal solution, then solution is said to be
CompleteIncompleteNot optimumDegenerate
Question: If in a system of m equations in n (n >= m) variables, we assign n-m variables as zero then the n-m variables are called as
Decision variableSlack variables
Non-basic variables
Surplus variables
Question: The artificial variable is added to a constraint of the form
"?"To all
"0"
None
Question: The feasible solution to the problem exists
At middle of the feasible region
OPERATION RESEARCH
At the corner points of the region
Outside the regionLocated at every point
Question: The key column corresponds to the value of Zj - Cj which is
Negative
Zero
Positive
Fraction
Question: The non-negativity conditions are expressed as
= 0
<0
0
≥0
Question: To get optimum solution all Zj - Cj values must be
=
Some zero values and some negative values
Negative
Positive values
Question: The optimal solution to LPP is obtained by simplex algorithm which is
Iterative Procedure
Complex Procedure
Simple Procedure
OPERATION RESEARCH
Optimal Procedure
Question: The pivotal element is converted to unity by
Question: The ratio is obtained by dividing quantities by
Cj element
Corresponding key column elements
Pivotal element . Key row elements
Question: The slack variable is added to a constraint of the form
" = "
To all
0
None
Question:The variable that is replaced is called
Incoming variable
Slack variable
Pivotal variable
Outgoing variable
Question:To get optimal solution we consider
OPERATION RESEARCH
Maximum number of feasible solutions
Minimum number of solutions
Minimum number of feasible solutions All possible solutions
Question: In Two-phase method, maximize Z = 4X1 + 5X2 is written asMaximize Z = - 4X1 - 5X2
Maximize Z = - 4X1 - 5X2
Maximize Z = - A1 Maximize Z = A1
Question: For the first simplex tableSlack and artificial variables will be basic variables
Slack and Surplus variables will be basic variables
Surplus and artificial variables will be basic variables
Only Artificial varaible will be basic variables
A
BC
D
OPERATION RESEARCH
Question:
a
b
c
d
Question: The incoming variable is determined from ratio formed by dividing
Key column elements by qualities
Qualities by any column elements
Qualities by key column elements
Key row elements by qualities
Question: If we get a solution to L.P.P having three variables X1, X2 and X3 as X1 = X2 = 0 X3 = 15 then the solution is said to be
Degenerate and infeasible
Degenerate and feasible
Non-degenerate and infeasible Non-degenerate and feasible
Question:
OPERATION RESEARCH
Response:
a
b
c
d
Question: If there are “m” simultaneous equations in “n” unknown (n > m) then basic and non-basic variables are obtained by setting
m variables to zero
n-m variables to infinity
n-m variables to zero
n variables to zero
Question:
OPERATION RESEARCH
Response:
a
bcd
Question: which of the following is not correct?
The key column in simplex table indicates the incoming basic currently non-basic variable and the key row represents the basic variable that willbecome non-basic in the next iteration.
If all entries in the key column are negative or zero and the corresponding (Zj-Cj)<0, then there is an unbounded solution to the LPP.
In improving a non-optimum solution, the leading element may be positive , negative or Zero.
For a maximization problem, the optimum solution is attained when all (Zj-Cj)=0.
Question: To formulate a problem for solution by the simplex method , we must add artificial variable to
Only equality constraintsOnly 'greater than' constraintsboth (a) & (b)
None of the above
OPERATION RESEARCH
Question: At every iteration of simplex method, for minimization problem, a variable in the current basis is replaced with another variable that has
A negative Zj-Cj value
A positive Zj-Cj valueZj-Cj=0
None of the above
Question: In a maximization LPP, if at least one artificial variable is in the basis, but not at zero level and the coefficient of M in each of the net evaluation (Zj-Cj) is non-negative , then we have
a feasible solutionNo feasible solution
An unbounded solution.
An optimum solution.
UNIT 4Question1:
It is possible to reverse the dual of L.P.P to primal L.P.P - the statement is
Not-possibleUnder certain conditions trueIncorrect
Correct
Question2:
OPERATION RESEARCH
Sensitivity analysis establishes upper and lower limits to
Input parameter values
Objective functionConstraintsDual variables
Question3:
If the primal has "a" variables and "b" constraints the dual will have
"b" variables and "a" constraints
"a" variables and "2b" constraints"a+b" variables and constraints
"a" variables and "b" constraints
Question4:
If bi represents the number of units available of resource I then dual variable y represents
Worth per unit of resource i
Worth per unit of variablesQuantitiesWorth per unit of prices
Question5: The standard form for writing dual incase of Maximisation problems, should have constraints
All less than type
All greater than typeMixed typeOnly equal to type
Question6: Optimality in L.P.P is reached if only
Input equals to output
OPERATION RESEARCH
Input is greater than outputInput is less than outputDepends upon the problem
Question7:The advantage of solving through dual is
Solved in minimum time
Reduced computation
Very simpleLess cost
Question8: A non-basic variable can be brought into the basis if and only if it is
Its contribution is positive
IntegerA FractionIts contribution is negativeThis is not the right choice, refer 4.5.1
Question9: For every linear programming problem there exists
Two or more than two dual problemDual problem
A unique dual problem
Primal problem
Question10: In linear programming all model parameters are assumed as
Changes at constant rateChanges with probabilistic valuesConstant
Variable
Question11:The constraints of dual problem is constructed by taking
Profit coefficient
The coefficient of basic variables of primal problem
Right hand side quantities of primal problemCoefficient of non basic variable
Question12: Sensitivity analysis also deals with
Constraints
OPERATION RESEARCH
InequalitiesObjective functionTo what extent changes can be made in the coefficients of profit function without affecting optimal solution
Question13: Dual problem is used when
Primal problem has several constraints and small variables
Primal problem has constraintsPrimal problem has five decision variablesPrimal problem has several constraints
Question14: Sensitivity analysis deals with
Finding optimal solutionHow profit would be affected by an increase or decrease in the resource level
How quantities are affectedFinding basic feasible solution
Question15: The L.P.P can be thought of as
Simulation modelEOQ model
Resource allocation model
Replacement model
Question16: The dual problem is helpful in solving Primal problems having
Question17: The right hand side quantities of dual in primal becomes
Coefficient of decision variables of objective function
Solution to the problemR.H.S quantitiesCannot say
Question18:
OPERATION RESEARCH
Response:
a
b
c
d
Question19:
OPERATION RESEARCH
a
b
c
d
OPERATION RESEARCH
Question 20:
a
b
c.
d
OPERATION RESEARCH
Question21:
a
b
c
d
Question22:
OPERATION RESEARCH
a
b
c d
Question 23:
OPERATION RESEARCH
a
b
c
OPERATION RESEARCH
D
Questionv24:
OPERATION RESEARCH
a
b C
D
d
Question25:
a
b
c
d
Question26:
OPERATION RESEARCH
Response:
A
b
c
d
Question28:
OPERATION RESEARCH
A
B
C D
OPERATION RESEARCH
Question29:
A
B
C
D
Question31:
OPERATION RESEARCH
A
B
C
D
Question32:
For the first simplex table
Slack and artificial variables will be basic variables
Slack and Surplus variables will be basic variables
Surplus and artificial variables will be basic variables
Only Artificial varaible will be basic variables
Question 33: If there are “m” simultaneous equations in “n” unknown (n > m) then basic and non-basic variables are obtained by setting
m variables to zero
n-m variables to infinity
OPERATION RESEARCH
n-m variables to zero
n variables to zero
Question: 34
If we get a solution to L.P.P having three variables X1, X2 and X3 as X1 = X2 = 0 X3 = 15 then the solution is said to be
Degenerate and infeasible
Degenerate and feasible
Non-degenerate and infeasible Non-degenerate and feasible
Question35:
Response:
a
b
c
d
Question35:
The incoming variable is determined from ratio formed by dividing
OPERATION RESEARCH
Key column elements by qualities Feedback:Qualities by any column elements Feedback:Qualities by key column elements
Key row elements by qualities
Question:
A
B
C
D
Question:
A
OPERATION RESEARCH
B
c
d
UNIT 5
Question1:
A
B
OPERATION RESEARCH
C
D
Question: 2
The T.P develops an integral transportation schedule
Both supply and demand exceeds targetThat exceeds all supplies from required demandThat exceeds all demands from available suppliesThat meets all demands from available supplies
Question3:
a
B
C
D
Question4:
The objective function in Transportation problem is
OPERATION RESEARCH
Minimized
MaximizedOptimized
Well allocated
Question5:
There can be
Only one allocation per columnOnly one allocation per rowMore than one allocation per row or column
Only two allocation per row
Question6:
Transportation problems are a special class of
Queuing modelsSimulation Models
Linear programming problem
Investment model
Question7:
OPERATION RESEARCH
a
B
CD
Question8:
OPERATION RESEARCH
ABC
D
Question9:
OPERATION RESEARCH
ABCD
OPERATION RESEARCH
E
Question10:
OPERATION RESEARCH
ABC
dScore of NA
Question:
OPERATION RESEARCH
Response:
ab
c
d
OPERATION RESEARCH
Question:
Response:
a
bc
d
Question:
OPERATION RESEARCH
Response:
a
b
c
d
OPERATION RESEARCH
Question:
Response:
a
b
C
D
OPERATION RESEARCH
Question:
Response:
A
BC
D
OPERATION RESEARCH
Question:
Response:
A
B
C
D
OPERATION RESEARCH
Question:
OPERATION RESEARCH
OPERATION RESEARCH
Response:
a
b
c
d
Question:
If there are 3 rows and 5 columns then the T.P has
8 constraints and 10 cell values5 constraints and 15 cell values8 constraints and 15 cell values
8 constraints and 10 cell values
UNIT 6
Question:
A job is assigned to
Response:
Only one machine
Several machinesOnly two machinesOnly M/cs
Question:
Assignment problem is a special care of
Response:
Transportation problemL.P.P
OPERATION RESEARCH
Mathematical problemStatistical problem
Question:
Response:
a b
c
d
Question:
In assignment problem the number of rows can be
Response:
Less than number of columns
Equal to number of columns
Greater than number of columnsNot equal to number of columns
Question:
OPERATION RESEARCH
The right hand side quantities of constraints are always equal to
Response:
3
4
1
n
Question:
Response:
a
b
c
d
OPERATION RESEARCH
Question:
OPERATION RESEARCH
OPERATION RESEARCH
Response:
abc
d
Question:
Response:
a
OPERATION RESEARCH
b
c
d
Question:
Response:
ab
cd
Question:
OPERATION RESEARCH
Response:
abc
d
Question:
OPERATION RESEARCH
Response:
a
bcd
Question:
OPERATION RESEARCH
Response:
abc
d
OPERATION RESEARCH
Question:
Response:
a
b
OPERATION RESEARCH
cd
Question:
Response:
a
OPERATION RESEARCH
bc
d
Question:
Response:
a
b
c
d
Question:
OPERATION RESEARCH
Response:
a b
c
D
Question:
Response:
A
OPERATION RESEARCH
B
C
D
UNIT 7
Question: If all variables are restricted to take integral values then it is known as
Mixed integer programming
Pure linear programming
Pure integer programmingMixed linear programming
Question: I.P.P is solved using the new Gomory cut by
Simplex methodSpecial Methods
Usual MethodDual simplex method
Question: Optimum solution to an I.P.P is first obtained by using
Simplex method
Modi method
Hungarian methodVAM method
Question:The first Gomory constraint is introduced with respect to Basic variable that contains
Maximum Fractional value
Minimum Fractional value
OPERATION RESEARCH
Negative fractional value
Fractional Value
Question:To get integral values a new constraint know as _________ Is introduced
HurwiezGomory
ModiLaplacian
Question:When decision making involves no fractional values, then the technique adopted is
T.P
I.P.P
A.P.L.P.P
.
Question:As a first step in I.P.P algorithm
Convert minimization problem to maximisation and consider integrality conditionConvert maximisation problem to minimization and consider integrality conditionConvert minimization problems to maximisation problem and ignore integrality condition**
Convert maximisation problem to minimization and ignore integrality condition
Question: In I.P.P we should consider
Maximum fractional value and write Gomory's constraint for that row
Minimum fractional value and write Gomory's constraint for that rowMaximum fractional value and write Gomory's for the row just before
Maximum fractional value and write Gomory's fourth row next to it
Question: Integer programming deals with integer solution by
Rounding of the fractional values to the nearest integer and applying dual simplex method
OPERATION RESEARCH
Introducing Gomory's constraints and applying dual simplex method
Rounding of the fractional values to the nearest integer and simplex method
Introduction Gomory's constraint and applying simplex method
Question:
Consider the LPP: Maximize Z= 3x+5y, Subject to: x+2y=4 2x+y=6 and x=0,y=0 This problem represents a
Zero-one IPP
Pure IPP
Mixed IPP
Non-IPP
Question:In the context of Branch & Bound method, Which of the following is not correct?
It can be used to solve any kind of programming problem.
It divides the feasible region into smaller parts by the process of branchingIt is very usefully employed in problems where there are finite number of solutions.It is not a standardised method and is applied differently for different problems.
Question:The optimum integer solution of the following integer programming problem are: Max Z= X1+X2, Subject to: 3X1-2X2 = 5 X1=2 X1, X2= 0and are integers.
X1=3, X2= 4, Max Z=8
X1=3, X2= 2, Max Z= 5
X1=2, X2= 2, Max Z= 4
OPERATION RESEARCH
X1= 6, X2=4 , Max Z= 8
Question:Which of the following is not correct?
A linear programming problem with only one decision variable restricted to integer values is not an integer programming problem.
An integer programming problem is an LPP with decision variables restricted to integer values.
A mixed IPP is one where mixed constraints are involvedA pure IPP is one where all the decision variables are either Zero or unity.
Question: Which of the following is the consequence of adding a new cut constraint to an optimal simplex table
Addition of a new variable to the tablemakes the previous optimal solution infeasible.Eliminates non-integer solution from the solution space.All the above
UNIT 8
Question: One of the following is not a example of Queue
Machines waiting for repairArrangement of colours in a row
Customers waiting at Bank
Cars waiting at Petrol
Question: Arrival of customers is
In specific orderRegularAt random
Uniform
Question: Application of Queuing theory cannot be viewed as
OPERATION RESEARCH
Mathematical method
Optimization method
Probability method
Scientific method
Question: It may not be _______ to totally avoid Queue
BadProperCorrect
Economical
Question:It is possible to get _______Performance of the system
Efficient
BestNormal
Un interrupted
Question:Queuing theory is based on
Probability concepts
Past recordsExperience
Initiations
Question: Criteria for measure of efficiency is given by
Arrival rateExpected length of Queue
Utilization factorService rate
Question: Queuing theory is based on _______ and gives an indication of the ________of a given system
Input process, progress
OPERATION RESEARCH
Mathematics, Systematic function
Probability, Capability
Scientific, optimization
Question:The constituents of Queuing system are
Arrival pattern, service facility
Arrival pattern, waiting time of the customerInput process, service and output process
Arrival pattern, length of Queue
Question: Which of the cost estimates and performance measures are not used for economic analysis of a Queuing system?
Cost per server per unit of timeCost per unit of time for a customer waiting in the systemAverage number of customers in the system.
Average waiting time of customers in the system
Question:The calling population is assumed to be infinite
Arrivals are independent to each other
Capacity of the system is infiniteservice rate is faster than the arrival rate.All of the above
Question: The cost of providing service in a Queuing system decrease with
Decreased average waiting time in the QueueDecreased arrival rateincreased arrival rate
None of the above
Question: Customer behaviour in which be moves from one queue to another in a multiple channel situation is
balkingReneging
OPERATION RESEARCH
jockeying
Alternating
UNIT 9
Question: Example of finite Queue is
Queue for Balaji DarshanQueue at Railway counters
Queue of Machines requiring service
Banking transaction
Question: Infinite Queuing model N = 10, L = 3, T = 2 hrs, M = 2/hr, U = 3/hr, W = 1/hr Answer Questions 1 to 5 Efficiency factor F is
5/6
1/3.2/31/6
Question: In finite Queuing model N = 10, T = 2 hrs, M = 2/hr, U = 3/hr, W = 1/hr .Then Average number of units waiting for service L is
2/3
5/3
4/7.1/6
Question: In finite Queuing model N = 10, L = 3, T = 2 hrs, M = 2/hr, U = 3/hr, W = 1/hr .Then Average number of units services H
1/32/52/3.
10/3
OPERATION RESEARCH
UNIT 10
Question: Mr.Vijay produces products that will be destroyed. The quantitative model to be used to find % defectives ________ and he should be able to associate ________with his variable
Simulation, profitL.P.P, probability distributionSimulation, cost
Simulation, probability distribution
Question: The service time on a super market follows the following distribution Service time (mts) 5 10 15 20 25 Frequency 10 20 40 20 10 The three digit random numbers assigned to 10 mts and 20 mts are
100-399, 400-599
200-299, 300-399
700-299, 300-499
100-299, 200-899
Question: Mr.Vijay has the following probability distribution for percentage defective Percentage defectives: 2 3 4 5 6 7 8 Probability distribution: 0.05 0.15 0.20 0.25 0.20 0.10 0.05 The two-digit random numbers that will be assigned to percentage defectives 4 and 7 are
40-54, 85-9415-29, 80-94
05-19, 65-8420-39, 85-94
Question: Mr.Vijay produces products that will be destroyed. The quantitative model to be used to find % defectives ________ and he should be able to associate ________with his variable
Simulation, profitL.P.P, probability distributionSimulation, cost
Simulation, probability distribution
Question: The service time on a super market follows the following distribution Service time (mts) 5 10 15 20 25 Frequency 10 20 40 20 10 The three digit random numbers assigned to 10 mts and 20 mts are
OPERATION RESEARCH
100-399, 400-599
200-299, 300-399
700-299, 300-499
100-299, 200-899
Question: Mr.Vijay has the following probability distribution for percentage defective Percentage defectives: 2 3 4 5 6 7 8 Probability distribution: 0.05 0.15 0.20 0.25 0.20 0.10 0.05 The two-digit random numbers that will be assigned to percentage defectives 4 and 7 are
40-54, 85-9415-29, 80-94
05-19, 65-8420-39, 85-94
UNIT 11
Question: The main task of project manager is
Planning and schedulingScheduling and controlling
Planning and controlling
Planning, scheduling and controlling
Question: Activities consume
Resources onlyResource and time
Time onlyMoney
Question: PERT and CPM are used in
Scheduling stage
Planning stageControlling stage
Final stage
OPERATION RESEARCH
Question: Materials, Money, Manpower and space in project Managements falls under the name
Inter related tasks
Resources
Events
Activities
Question: A project has to be completed
In a specified time according a specified order
In a specified time according to any order
In a specified orderWell in advance of time limit
Question:A project consists of
Collection of activitiesCollection of interrelated activities
EventsCollection of tasks
Question: PERT is used for projects which are
Non-repetitive in nature and have uncertain time estimates
Non-repetitive in nature and having definite timingsRepetitive in nature and having definite timings
Non-repetitive in nature and have inter related activities
Question: In PERT total project duration is regarded as a
Variable associated with activities
Random variable with associated probabilities
Random variable with associated activities
Variable associated with events
Question: Efficiency in project implies
OPERATION RESEARCH
Planning well and reducing timeUtilizing available resources effectively and complete project in timeReducing time and economic feasibility of using available resources
Planning well and reducing cost
UNIT 12
Question: The outcome of combinations of actions is
Known and fixed
Unknown
known & varaible.Known
Question: The number of courses of action available to a player is
Countably infiniteLegal negotiations
Infinite
Indefinite
Question: The rational and intelligent players are involved in
Under conditions of conflict and cooperation
Conciliation
ConfrontationCooperation
Question:A Game is said to played when
Two or more rational and intelligent persons play
More than two persons playTwo persons play
OPERATION RESEARCH
one person plays
Question:Games Theory can be used in
Replacement policiesAllocation of resourcesAssigning jobs to machines
Legal negotiations
Question:A Two-person game in which gains of one player is equal to loss of other player is known as
N-Person-gameTwo person-zero sum game
Two-person-sum game
Zero-sum game
Question:Mr.Anish is 20 years old and his youngest brother is 10 years old. He plays a chess-game with him. Can we call it as a Game? If not, why?
No, he is too youngNo, he is Mr.Anish brotherYes
No, he is not a rational and intelligent opponent
Question:The given pay-off matrix of a game is transposed. Which of the following is not correct?
Value of the game changes.Saddle point of the game , if exists, changesPlayer B has as many strategies as A had, and A has as many strategies as B.
Optimum startegies of both the players does not change.
Question:Which of the following is not correct?
In a two person game, both the players are assumed to be in full knowledge of the strategies available to his opponent and the pay-offs resulting from each combination of strategies.The solution to a game implies determining optimum strategies for both the players and value of the game
OPERATION RESEARCH
The solution to a two-person game is based on the assumption that player A will always play his strategy first and the other player B, would play his startegy thereafter.Player A's strategy is determined on the basis of maximum criterion, whereas player B's on the basis of minimax criterion
Question: For a two-person game with A and B , the minimizing and the maximizing players, the optimum startegies are :
Minimax for A and Maximin for B
Maximax for A and Minimax for BMinimin for A and Maximin for B
Maximin for A and Minimax for B.
Question:A two-person game is said to be Zero-sum, if
gain of one player is exactly matched by a loss to the other so that their sum is equal to zero.
gain of one player does not match the loss to the other.Both the players must have an equal number of strategies.Diagonal entries of the pay-off matrix are zero.