OPERATION RESEARCH

One mark
UNIT 1
1) Operation research is the application of methods to arrive at the
problems
a) Economical
b) Scientific
c) Both a and b
d) Physical
Ans b)scientific
2) In operations research the are prepared for situations
a) Mathematical models
b) Physical models
c) Diagrammatic models
d) Economical

Ans a) mathematical models

3) Operations management can be defined as the application of

to a problem within a system to valid the optimal solution
a) Suitable manpower
b) Mathematical techniques, models and tools
c) Financial operations
d) Diagrammatic models

Ans b) Mathematical techniques, models and tools

4) Operation research is based upon collected information,knowledge and

advanced study of various factors impacting a particular operation this leads
to more informed
a) Management processor
b) Decision making
 c) Procedure
d) Diagrammatic models

Ans b) Decision making

5) Operation research approach is

a) Multi-disciplinary
b) Scientific
c) Intuitive
d) Procedure

Ans a) Multi-disciplinary

6) Which one of the following is application area of operation research?

a) Experience
b) Portfolio management
c) Decision
d) Procedure

Ans b) Portfolio management

7) In OR models, the variables and goals are converted into mathematical

symbols
a) True
b) False
c) Either true or false
d) None of the above

Ans a) true

8) Every mathematical model

a) Must be deterministic
b) Requires computer aid of its solution
 c) Represents data in normal form
d) Procedure

ans c) Represents data in normal form

9) What are two design used in OR?

a) Quasi design, true experiment design
b) Quasi experiment design, true experiment design
c) System design and quasi design
d) Represents data in normal form

Ans b) Quasi experiment design, true experiment design

10) A physical model is example of

a) An iconic model
b) A verbal model
c) An analogue model
d) Mathematical model

Ans b) A verbal model

11) Operation research which is a very powerful bed for

a) Research
b) Decision making
c) Operations
d) Represents data in normal form

Ans b) Decision making

12) This innovative science of operation research was discovered during
a) civil war
b) world war I
 c) world war II
d) none of the above

Ans c) world war II

13) Operation research has the charactertics the it is done by a team of

a) Scientists
b) Mathematicians
c) Academics
d) none of the above

Ans a) Scientists

14) Operations research was known as an ability to win a war without

really going in to a
a) Battlefield
b) Fighting
c) Both a and b
d) none of the above

Ans c) Both a and b

15) Operation research emphasizes on the overall approach to the system.

This characteristics of operations research is often referred as

a) System approach
b) Team approach
c) System orientation
d) Economic apporach

Ans b) Team approach

16) Operation research study generally involves how many phases

a) Four
b) Three
 c) Five
d) two

Ans b) three

17) Operation research cannot give perfect to problem

a) Solution
b) Decision
c) Both a and b
d) none of the above

Ans a) solution
18) Which model can answer for ‘ what if’ type of question

a) Deterministic model
b) Normative model
c) Predictive model
d) Mathematical model

Ans c) Predictive model

19) is also known as conflict while arriving at the decision

a) Scienitific approach
b) Holistic approach
c) Objective oriented approach
d) none of the above

Ans b) Holistic approach

20) Which of the following is not advantages for operational research

a) it is an iconic model

b) it is easy to construct

c) it is not possible to make any modification

 d) none of the above

Ans c) it is not possible to make any modification

21) Models could be classified into type

a) 4

b)3

c) 2

d)1

Ans b)3

22) Iconic model is a physical representation of a real project on same scale- state
this statement true or false

a) true

b)false

c)none of the above

d)either true or false

Ans a) true

23) Cash flow planning credit policy planning of deliquent account strategy are
some of the areas in accounting where are used.

a) analogue model

b) iconic model

c) OR technique

d) none of the above

Ans c) OR technique

24) Almost all the models in OR are symbolic –state this statement true or false

a) true

b) false

c)none of above

d) either true or false

Ans a) true

25) Which of the following is advantages for symbolic model?

a) It is most general

b) It is most abstract

c) Both a and b

d) none of the above

Ans c) c) Both a and b

UNIT -2

1. LPP stands for

a) Liner programming
b) Liner programming problem
c) Line programming problem
d) Either a nor c

2. ____________ may be defined as method of determining on optimum

programme inter dependent activities in view of available resource
 a) A goal programming
b) Liner programming
c) Decision making
d) None of the above

3. Liner programming is a technique to find __________

a) Optimal value
b) Normal value
c) Both a&b
d) None of the above

4. If there are more than one optimum solution for the decision variable the
solution is _______
a) Infesable
b) Unbounded
c) Alternative
d) All the bove

5. Which of the following is said to assume non negative value

a) Secondary variable
b) Final variable
c) Basic variable
d) All the above

6. The computational routine for the simplex method is based on

a) Matrix , algebra
b) Liner programming
c) Either a nor b
d) None of the above

7. Simplex method is a technique to solve LLP by obtaining _______

a) Optimum feasible solution
 b) Basic feasible solution
c) Feasible solution
d) All the above

8. Liner programming techniques are used in _____________

a) Industrial & economical
b) Railway and chemical
c) Food processing area
d) All the above

9. Which of the following is basic assumption to formulate “linear

programming problem”
a) Certainity
b) Finiteness
c) Activity
d) All the above

10.If resource availability increase by some percentage then the output shall
also increase by some percentage –this statement is applicable in case of
a. Optimality
b. Divisibility
c. Additivity
d. Proportionality

11.The problem involves only one objective namely profit maximaisation or

cost minimization – state the statement is true or false
a) True
b) False

12.Graphical method is not a ____________ of liner programming

a) Model
b) LPP
c) Powerful tool
d) Powerless tool
13.All basic variables are yield ________________
a) Non zero and positive
b) Zero and negative
c) One and positive
d) One and negative

14.Graphical method we can deal any number of constraints

a) True
b) False

15.The redundant constraints are __________ for system

a) Automatically eliminated
b) Manually eliminated
c) Systematically eliminated
d) Both a&C

16.A basic feasible solution is called __________when there is one basic

variable posses zero value
a) Slack variable
b) LPP
c) Simplex method
d) Degenerate

17.Which method is simple to understand and easy to use _

a) Graphical method
b) Simplex method
c) Formulation method
d) All the above

18.Variables and constraints are finite in number this is example

for_________
a) Additives
b) Divisibility
c) finiteness
d) proportionality
19.what is the objective function linier programming problem?
a) A constaints for available resource
b) An objective for research and development
c) A linier function is an optimization problem
d) A set of non negative condition

20.Which statement characteristics standard from of a LLP

a) Constraints are given by inequalities of any type
b) Constraints are given by Set of linier equation
c) Constraints are given only by inequalities of >= type
d) Constraints are given only by inequalities of <= type

UNIT-3
1) is a transportation problem is the set of all non-negative
allotments .
a) Feasible solution
b) Optimal solution
c) Basic solution
d) none of the above

Ans a) Feasible solution

2) The transportation problem has m rows and n rows columns then

transportation problem is called
a) Optimal solution
b) Basic feasible solution
c) Initial feasible solution
d) Basic solution

Ans b) Basic feasible solution

3) The minimizes the total transportation cost is called
a) Optimal solution
b) Basic feasible solution
c) Feasible solution
d) Initial feasible solution

Ans a) Optimal solution

4) How many methods are available for initial feasible solution?

a) Three
b) Four
c) Five
d) two

Ans c) five

5) is determined whether the total cost corresponding to the initial

feasible solution is minimum or not
a) Test of optimality
b) Transportation
c) Feasible cost
d) Initial feasible solution

Ans a) Test of optimality

6) The number of allotted cells is than m+m-1 the transportation problem

Is called a ________
a) Degeneracy transportation problem
b) Unbalanced transportation problem
c) Maximisation problem in transportation
d) Initial feasible solution

Ans a) Degeneracy transportation problem

7) When conditions is not satisfied then the transportation problem is called an
______
a) Unbalanced transportation problem
b) Degeneracy transportation problem
c) Maximisation problem in transportation
d) transportation problem

Ans a) Unbalanced transportation problem

8) A transportation problem is considered only for minimizing the ______

a) Total transportation cost
b) Minimizing cost
c) Maximising cost
d) transportation problem

Ans a) Total transportation cost

9) Which method is used to minimize the total method?

a) Assignment
b) North west corner
c) Least cost
d) None of the above

Ans a) Assignment

10) How many properties are there in assignment method?

a) One
b) Two
c) Three
d) four

Ans b) two

11) The number of person is less than the number of jobs which has no
equal matrix.This kind of assignment is called?

a) Restricted assignment problem

b) Unbalanced Assignment problem
 c) Maximisation problem
d) transportation problem

Ans b) Unbalanced Assignment problem

12) In assignment problems we can also come across situations wherein

no assignment can be made in some of the place/ this kind of assignment is
called?
a) Restricted assignment problem
b) Unbalanced Assignment problem
c) Maximisation problem
d) transportation problem

Ans a) Restricted assignment problem

13) ______ is a method for computing a basic feasible solution for a

transportation problem
a) North west corner rule
b) Vogel approximation
c) Least cost method
d) Restricted assignment problem

Ans a) North west corner rule

14) How many method are used in solving a maximization problem in
transportation problem
a) one
b) two
c) three
d) four
Ans b) two
15) A feasible solution is called ________
a) Optimal solution
b) Feasible solution
c) Basic feasible solution
d) Restricted assignment problem
 Ans a) Optimal solution
16) What are the conditions to satisfies non-generate basic feasible
a) Total number of allocation is equal m+n-1
b) The allocations are independent postion
c) Both a and b
d) None of the above

Ans c) Both a and b

17) How many stages for optimal solution?

a) One
b) Two
c) Three
d) four

Ans b) two

18) Which method uses the least value in the table?

a) Least method’
b) Vogel approximation
c) North west corner rule
d) None of the above

Ans a) Least method

19) An iterative procedure for computing a basic feasible solution of a

transportation problem is called______
a) North west corner rule
b) Vogel approximation
c) Least method
d) None of the above

Ans b) Vogel approximation

20) The total supply is not equal to the total demand in the transportation
problem with unequal supply and demand. Then it is called _______
a) Unbalanced transportation problem
b) Balanced transportation problem
c) Least cost method
d) None of the above

Ans a) Unbalanced transportation problem

21) _______ method provides minimum cost solution to the transportation

problem
a) Modified distribution method
b) North west corner rule
c) Least cost method
d) None of the above

Ans a) Modified distribution method

22) In modified distribution method the basic feasible solution can one of
the following method can be used?
a) North west corner method
b) Least cost method
c) Both a and b
d) None of the above

Ans c) Both a and b

23) Efficient method for solving assignment problem is called ______

a) Least cost method
b) Hungarian method
c) Modified distribution method
d) None of the above

Ans b) Hungarian method

24) Using least value in the table is called least cost method-state true or
false
a) True
b) False
c) None of the above
d) Either true or false

Ans a) true

25) An unbalanced transportation problem is converted into a balanced

transportation problem by introducing a dummy warehouse or a dummy
store which will provide for the excess availability or the requirement-state
whether true or false
a) True
b) False
c) None of the above
d) Either true or false

Ans a) true

Unit 4
1) ______ is a technique which determines the various sequences of jobs
concerning a project and the project completion time

a) Network analysis

b) PERT

c) CPM

d) none of the above

Ans a) Network analysis

2) how many techniques are available in networks analysis?

a) one

b) two

c) three

d)four

Ans b) two

3) ________ method differentiates between planning and scheduling

a) critical path method

b) programme evaluation and review technique

c) network analysis

d) none of the above

Ans a) critical path method

4) how many times critical path method can be used?

a) three

b)two

c)one

d) four

Ans b) two

5) critical path method types of times

a) normal time

b)crash time

c) both a and b

d) either a or b

ans c) both a and b

6)_______ technique is generally applied to well known projects where the
time schedule to perform the activites can exactly be determined

a)CPM

b)PERT

c) none of the above

d) crash time

ans a) CPM

7) ______ techniques does not do statistical analysis for determining the

normal time and crash time

a)CPM

b)PERT

c) none of the above

d) crash time

ans a) CPM

8) using which technique the management was able to obtain the expected
project completion time and the bottleneck activites in a project

a)PERT

b)CPM

c) none of the above

d) crash time

ans a) PERT

9)PERT is used _____ and CPM is used _____

a) activity, eventually

b) eventually, activity
c) once, twice

d)twice,once

ans b) eventually, activity

10) _______ plays an important role in the problem of determining the

optimum solution

a)CPM

b)PERT

c) network

d) crash time

ans c) network

11) the path that takes the longest duration is called _____

a) bottleneck

b) critical path

c) project duration

d) crash time

ans b) critical path

12) the duration of this path is called _____

a) project duration

b) bottleneck

c) critical path

d) crash time

ans a) project duration

13) the activities coming along this path are called _______
a) critical path

b) project duration

c) bottleneck

d) crash time

ans c) bottleneck

14) the amount of time a path of activites could be delayed without affecting
the overall project duration is called _______

a) latest finish time

b) total float

c) latest start time

d) crash time

ans b) total float

15) the amount of time an activities can be defined without affecting the
commencement of a subsequent activity at its earliest start time is called___

a) independent float

b)free float

c) total float

d) crash time

ans b) free float

16)________ float does not affects either preceding or subsequent activites

a) independent float

b) free float

c) total float
d) crash time

ans a) independent float

17) the finishing point of an activities is called ____

a) tail event

b) head event

c) end event

d) crash time

ans a) tail event

18) the starting points of an activites is called ______

a) tail event

b) head event

c) end event

d) crash time

ans a) tail event

19) the activites which does not consume time or resources is called ___

a) regular activity

b) irregular activity

c) dummy activity

d) none of the above

ans c) dummy activity

20) the shortest possible time estimate for finishing an activity is called ____

a) optimistic time estimate

b) pessimistic time estimate

c) most likely time estimate

d) estimate time

ans a) optimistic time estimate

21) the longest time conceivable for an activity is called ____

a) optimistic time estimate

b) pessimistic time estimate

c) most likely time estimate

d) estimate time

ans b) pessimistic time estimate

22) the time estimate to be an executed under normal condition of the

activity is called _____

a) optimistic time estimate

b) pessimistic time estimate

c) most likely time estimate

d) estimate time

ans c) most likely time estimate

23) deals with unpredictable activity in PERT-state whether true or false

a)true

b) false

c) none of the above

d) either a or b

ans a) true

24) uses deterministic model in PERT-state whether true or false

a)false

b) true

c) none of the above

d) either a or b

ans a) false

25) non repeatative in the nature of job in CPM- state whether true or false
a) true
b)false
c) none of the above
d) either a or b
ans b) false
UNIT 5
1) The possible alternatives to be considered for taking a decision is called
_____
a) States of nature
b) State of action
c) Pay-off
d) none of the above

Ans b) State of action

2) To identify all the possible events but the difficulty is to identify the
event which will occur is called ______
a) States of nature
b) States of action
c) Pay-off
d) none of the above

Ans a) States of nature

3) The possible profits for the different alternatives under diffrednt, states of
nature is called ____
 a) States of nature
b) States of action
c) Pay-off
d) none of the above

Ans c) Pay-off

4) What are the decision under different environment?

a) Decision making under condition of certainty
b) Decision making under condition of risk’
c) Both a and b
d) none of the above

Ans c) Both a and b

5) How many types of are available in criteria for decision making under
uncertainty
a)three
b)four
c) five
d) two
ans c) five

6) It is an optimistic rule which maximizes the maximum that can be gained

under different products is called _____
a) Maximax criterion
b) Maximin criterion
c) Minimax regret criterion
d) none of the above

Ans a) Maximax criterion

7) _____ criterion for the selction of the best among the wrost
a) Maximax criterion
b) Maximin criterion
c) Minimax regret criterion
d) none of the above
Ans b) Maximin criterion

8) The opportunity loss under each states of nature we take the largest pay-
off for each states of nature and subtract all other pay-off under the state
from the largest – state the statement true or false
a) True
b) False
c) None of the above
d) Either true or false

Ans a) true

9) A weighted average of the best and the worst pay off of the alternative is
called _______
a) Hurwicz criterion
b) Laplace criterion
c) Maximax criterion
d) none of the above

Ans a) Hurwicz criterion

10) _______ associate equal probabilities for the different states in the
absences of information about these probabilities
a) Hurwicz criterion
b) Laplace criterion
c) Maximax criterion
d) none of the above

Ans b) Laplace criterion

11) Laplace criterion is also known as ______

a) Principles of equality
b) Principles of rationality
c) Principles of measurement
d) none of the above

Ans b) Principles of rationality

12) the expected value of additional gain by knowing perfect information
over optimum profit under no such information is called ______
a) expected value of perfect information
b) decision tree
c) unexpected value of perfect information
d) none of the above

ans a) expected value of perfect information

13) how many types of loss are there in minimizing expected loss?
a) One
b) Two
c) Three
d) four

Ans a) two

14) The diagrammatic representation of logical relationship between the

parts of a complex situation of a decision-making problem is called___
a) Decision making
b) Planning
c) Decision tree
d) none of the above

Ans c) Decision tree

15) How many types of mode are there in decision tree?

a) One
b) Two
c) Three
d) four

Ans b) two

16) The particular branch leaving a decision mode which leads to the
states of nature mode with highest expected monetary value. This is
known as____
a) Roll back technique
 b) Decision tree
c) Decision making tree
d) none of the above

Ans a) Roll back technique

Ans a) Roll back technique

17) To tackle conflicting situations in a special discipline is called ____

a) Decision making theory
b) Game theory
c) Player theory
d) none of the above

Ans c) Game theory

18) A player is a plan specifies his actions for every possible action of his
opponent is called ______
a) Strategy
b) Competitor
c) Player
d) none of the above

Ans a) Strategy

19) the number of strategies of the players is finite the game is called

_______

a) Infinite game
b) Finite game
c) Player
d) none of the above

Ans b) Finite game

20) if atleast one of the players has infinite number of strategies the game
is called ___
a) Infinite game
 b)Finite game
c) player
d) none of the above

ans a) Infinite game

21) a game with two players wherin on person is the loss of the other is called
_____

a) mixed strategy game

b) pure strategy game

c) zero sum game

d) none of the above

ans c) zero sum game

22) the pay offs corresponding to various strategies of the players are represented
in a matrix is called ____

a) game matrix

b) mixed strategy game

c) pure strategy game

d) none of the above

ans a) game matrix

23) the best strategy for each player is for play one particular strategy throughtout
the game it is called _____

a) pure strategy game

b) mixed strategy game

c) game matrix
d) none of the above

ans a) pure strategy game

24) the optimal plan for each player is to choose different strategies at different
situation is called ______

a) pure strategy game

b) mixed strategy game

c) game matrix

d) none of the above

ans b) mixed strategy game

25)_______ is a two person zero sum game is obtained by minimum-maximum

principle

a) Optimal solution
b) Value of game
c) Mimimum solution
d) none of the above

Ans a) Optimal solution

26) The pure strategies corresponding to the value of the game are ____
a) Optimal strategies
b) saddle point
c) Value of game
d) none of the above

Ans a) Optimal strategies

27) The positions in the pay off matrix corresponding to optimal strategies
is called a ______

a)Optimal strategies
 b) saddle point

c) Value of game
d) none of the above
ans b) saddle point
28) Maximum guaranteed gain to the palyer B _____
a) Saddle point
b) Value of game
c) Optimal strategies
d) none of the above

Ans b) Value of game

29) State the rule for determining saddle point

a) The minimum pay off in each row
b) The maximum pay off in each column
c) Both a and b
d) none of the above

ans c) Both a and b

30) The problem can be reduced into a game which can be solved either
by reducing it to a game with pure strage
by reducing it to a game with pure strategy or reducing it into 2*2 game
which can be solved by mixed strategies is called____
a) Dominance property
b) Saddle point
c) Value of game
d) none of the above

Ans a) Dominance property