Nowsath Mem Unit-2

7ME-03 OPERATION RESEARCH

QUESTION
1. The mathematical technique for finding the best use of
limited resources in an optimum manner is known as:a) Operation research
b) Linear programming
b) Network analysis
d) Queuing theory
Ans:- Linear programming
2. The linear programming technique can be applied
successfully to industries like:a) Iron and steel
b) Banking
b) Food processing
d) All of above
Ans:- All of above
3. The simplex method is basic method for:a) Value analysis
b) Operation research
b) Linear programming
d) Model analysis
Ans:- Linear programming
4. Graphical method, Simplex method and transportation
method are connected with:c) Value analysis
b) Operation research
d) Linear programming
d) Model analysis
Ans:- Linear programming
5. Direct cost
a) is directly proportional to the duration of time of an event
b) Is inversely proportional to the duration of time of an
event
c) Is associated with total project time
d) All of the above

Ans:- Is inversely proportional to the duration of time of an

event
6. PERT isa) Program evalution and review technique
b) Progress evalution and review test
c) Project evalution and review technique
d) Project estimation and review technique
Ans- Program evalution and review technique
7. The time which result in the least possible direct cost of an
activity is known asa) Normal time
b) Slow time
b) Crash time
d) Standard time
Ans- Slow time
8. CPM is
a) Time oriented technique
technique
b) Activity oriented technique

b) Event oriented
d) Target oriented

Ans- Activity oriented technique

9. The probability distribution of activity times in PERT followsa) Normal
b) Binomal
b) Beta
d) Exponential
Ans- Beta
10.
The probability
distribution of project completion in PERT follows
a) Normal
b) Binomial
c)Beta

d) Gaussian

Ans- Gaussian
11.
activities are those for which-

Critical

a) Float=0

b) Float=+1

c)Float<1

d) Float>1

Ans- Float=0
12.
programming shadow prices area) Cost of brought out items
item
b) Value assigned per unit
prices

In linear
b)Max cost per
d) Lowest sale

Ans- Value assigned to one unit

13.
base variable in the assignment model isa) 2 or 4
b) 1or 0
b) 1 or 2
d) 0 or 4

The value of

Ans- 1 or 2
14.
The artificial
variable are made to leave the base and never to enter in
the further iteration by the applicationa) Big M method
b) Two phase method
b) Simplex method
d) Both a and b
Ans- d
15.
In the simplex
method the variable which have not been assigned the value
zero, during an iteration, are calleda) Basic variable
b) Artificial variable
c) Actual variable
d) None of the above
Ans- Basic variable
16.
Limitation of
linear programming model are based on criterian ofa) Proportionality
b) Additivity

b) Divisibility

d) All of above

Ans- All of above

17.
Simulation is
basically a technique which is useda) Optimisation
b) Testing alternatives
b) Cost minimization
d) Computerisation
Ans- b
18.
Simulation is
useda) To analyse and evaluate a system performance
b) To accommodate a great degree of complexity
c) To determine the system outcome
d) All of above
Ans- All of above
19.
hasa) Max float
c)Zero float

Critical activity
b) min float
d) None of above

Ans-c
20.
Critical path
moves along the activities having total float ofa) Positive value
b) negative value
c)Zero value

d) Same value

Ans- c
21.In the graphical method of linear programming problem every
corner of the feasible polygon indicates
(a) a basic feasible solution
(c) a & b

(b) optimum solution

(d) none of above

Ans: (a)
22.In an linear programming model there are four discision
variable and three constraints. During an iteration by simplex
method the cofficien of base variable would form
(a) an identity metrix

(b) slack variable

(c)basic solution

(D) none

Ans: a
23.A linear programming problem is called so,because in that
problem
(a)all the functions expressing constraints are linear
(b)the objective function also linear
(c)both a& b
(d)none of the above
24.The value of base variable in the assignement variable is
(A)2 or 4
(b)1 or 0
(C)1 or 2
(d)0 or 4
25.Limitation of linear programming models are based on criteria
of
(A)proportionality
(b)additive
(c)divisibility
(D)all of above

26.PERT is
(a)activity oriented
(b)event oriented
(C)cost oriented
(d)none of above