FR55
1.
2.
3.
4.
5.
6.
7.
8.
Operation research employs ____
methods for purpose of solving
problems.
(a) Scientific
(b) Historic
(c) Economic
(d) None of the above
Operation research tries to reduce the
___________ of business operations.
(a) Simplicity
(b) Complexity
(c) Both (a) and (b)
(d) None of the above
How many phases of Operation
research.
(a) One
(b) Two
(c) Three
(d) None of the above
Operation research present s a
modification of ______ Solution.
(a) Scientific
(b) Mathematical
(c) Both (a) and (b)
(d) None of the above
How many advantages of Operation
research approach in decision making.
(a) One
(b) Two
(c) Three
(d) Four
To maximize the per capita income with
_______ resource.
(a) Minimum
(b) Maximum
(c) Both (a) and (b)
(d) None of the above
Analysis of available information and
verification of hypothesis is the phase.
(a) Judgment
(b) Research
(c) Action
(d) None of the above
Operation research model frequently
yield action that improve a ______
sense decision making.
(a) General
(b) Common
(c) Standard
(d) None of the above
XIX
9.
10.
11.
12.
13.
14.
15.
16.
How many factors are in Mathematical
model?
(a) One
(b) Two
(c) Three
(d) None of the above
Decision literally means choosing form
_______ alternative.
(a) Unavailable
(b) Available
(c) Present
(d) None of the above
A non- linear relationship is changed to
liners fitting the problem to ________
pattern.
(a) I.P.
(b) L.P.
(c) Q.P.
(d) None of the above
All relationship in LP model must be
______________.
(a) Linear
(b) Cervical
(c) Exponential
(d) None of the above
The objective function is also knows as
the _______ function.
(a) Real
(b) Rational
(c) Criterion
(d) None of the above
Optimum solution is the best of ______
solutions.
(a) Non- feasible
(b) Feasible
(c) Both (a) and (b)
(d) None of the above
Resource must be ______ in supply.
(a) Unlimited
(b) Limited
(c) Both (a) and (b)
(d) None of the above
The objective is to minimize the total
elapse time in _____ management.
(a) Production
(b) Marketing
(c) Financial
(d) None of the above
(1)
FR55
17. Traveling salesman problem belongs to
management.
(a) Production
(b) Marketing
(c) Financial
(d) None of the above
18. L P also helps in ________ of a basic
plan for changing conditions.
(a) Evaluation
(b) Re-Evaluation
(c) Personnel
(d) None of the above
19. The set of values of decision variable
which satisfy the constraints is.
(a) Solution
(b) Linear
(c) Both (a) and (b)
(d) None of the above
20. The set of values of decision variables
which do not satisfy the constraints.
(a) Feasible solution
(b) In feasible solution
(c) Both (a) and (b)
(d) None of the above
21. A basic feasible solution is called
degenerate if at least ore basic variable is .
(a) One
(b) Zero
(c) Infinite
(d) Three
22. The number of competitive actions that
are available for a player are ……… to
that player.
(a) Strategies
(b) LP models
(c) Simplex method
(d) All of these
23. Subject:
-x1+3x2≤10,
x1+x2≤6,
x1+x2≤2, x1,x2≥0 and min z=-x1+2x2
then x1 and x2 are.
(a) 2,0
(b) 0,2
(c) -2,0
(d) 0,-2
24. Max
z=
15x1+10x2
and
14x1+6x2<360, 00331<180, 5x2<200,
x1x2>0 then z is.
(a) 1200
(b) 1000
(c) 1100
(d) 1300
XIX
25. Max z= 10x1+6x2 and 5x1+3x2≤30,
x1+2x2≤18, xx1x2≥0 then solution.
(a) X1= 6/7, X2=60/7
(b) X1=6, X2=0
(c) Both (a) and (b)
(d) None of the above
26. Max z=3x1+4x2, and x1-x2=-1, x1+x2≤0, x1x2≥0 then solutions are.
(a) Bounded
(b) Un bounded
(c) Unique
(d) None of the above
27. A straight line representing all non
negative combination of x1 and x2 for a
representing profit level is the line.
(a) ISO- profit
(b) ISO- cost
(c) Perpendicular
(d) None of the above
28. Min z=20x1+10x2 and x1_2x2≤40,
3x1+x2≤≥30, 4x1+3x2≥60, x1,x2≥0
then solution x1 and x2 are.
(a) 3,2
(b) 5,-2
(c) 3,5
(d) None of the above
29. The concept of simplex method is
similar to ______________ method.
(a) Systematic
(b) graphical
(c) Linear
(d) None of the above
30. The use of simplex method to solve an
____________ problem.
(a) I.P.
(b) Yam theory
(c) L.P.
(d) None of the above
31. Types of additional variables in simplex
namely.
(a) Slack
(b) Surplus
(c) Artificial
(d) All of these
32. The right-hand side of each constraint
should be made.
(a) Negative
(b) Non – negative
(c) Both (a) and (b)
(d) None of the above
(2)
FR55
33. If the constraint is (=) type, then there is
add the variable in constraint of.
(a) Artificial
(b) Surplus
(c) Slack
(d) None of the above
34. A surplus variable is subtracted and
artificial is added in constraint of.
(a) (≥) type
(b) ≤ (type )
(c) (=) type
(d) None of the above
35. Negative slack variable is called the
variable.
(a) Artificial
(b) Surplus
(c) Both (a) and (b)
(d) None of the above
36. If objective is minimize is primal then
objective is.
(a) Minimize
(b) Minimizes
(c) Equal
(d) None of the above
37. Which variables provide an important
economic interpretation of the final
solution of an L.P. problem.
(a) Artificial
(b) Slack
(c) Dual
(d) None of the above
38. Which does play an important roll in our
economy and managerial ___________
making?
(a) Result
(b) Merit
(c) Demerit
(d) Decision
39. If the calls are less than (M + N-1)
allocations then it is.
(a) Non-degeneracy
(b) Degeneracy
(c) Both (a) and (b)
(d) None of the above
40. An even number of at lest four cells
must participate in.
(a) Closed loop
(b) Open loop
(c) Parallel side
(d) None of the above
XIX
41. The number of occupied cell must
equal to.
(a) M+N+1
(b) M+N-1
(c) M+N
(d) M-N
42. If the players select the same, strategy
each time, then it is referred as.
(a) Mix strategy
(b) Pure strategy
(c) Both (a) and (b)
(d) None of the above
43. When the players use a combination of
strategies then it is.
(a) Mix strategy
(b) Pure strategy
(c) Both (a) and (b)
(d) None of the above
44. Players act rationally and _________.
(a) Unintelligently
(b) Carefully
(c) Both (a) and (b)
(d) None of the above
45. The maximum element in each column
of the pay of matrix is called.
(a) Row minima
(b) Column minima
(c) Both (a) and (b)
(d) None of the above
46. Jo reducer the size of the pay off matrix
refers the rule of.
(a) Saddle point
(b) Dominance
(c) Pay off
(d) None of the above
47. The two larger element of the matrix
must constitute one of the diagonally
then share is the saddle point.
(a) One
(b) Two
(c) Zero
(d) Infenite
48. Each player in an __________ situation
working under uncertain conditions.
(a) Stally
(b) Oligopoly
(c) Trial
(d) None of the above
(3)
FR55
49. The positive sign on the net cost
change indicate a cost ______ .
(a) Decrease
(b) Increase
(c) Both (a) and (b)
(d) None of the above
50. Max Z=5x1+3x2 and 2x1+4x2≤10,
5x1+2x2≥10, x1x2≥0 then by big –M
method the Z is.
(a) 20
(b) 20M
(c) -20M
(d) None of the above
51. Optimization type is performing a job
more.
(a) Deficiently
(b) Efficiently
(c) Both (a) and (b)
(d) None of the above
52. Allocation problems are represented by
iconic model.
(a) True
(b) False
(c) Both (a) and (b)
(d) None of the above
53. Operation research increases the
effectiveness of ______.
(a) Carreet
(b) Wrang
(c) Clecesion making
(d) None of the above
54. Diagram belongs to physical model.
(a) True
(b) False
(c) Both (a) and (b)
(d) None of the above
55. The inter action between Operation
research team and management
reaches peak level in implantation
phase.
(a) True
(b) False
(c) Both (a) and (b)
(d) None of the above
56. Pivotal element lies on the crossing of
key column and key row.
(a) Yes
(b) No
(c) Both (a) and (b)
(d) None of the above
XIX
57. “≤” constraints change to ______ to be
in dual L-P.
(a) ≥
(b) ═
(c) ≥
(d) <
58. The results of sensitive analysis
establishes upper and lower _______
for eripiet parameters value.
(a) Ounce
(b) Bounce
(c) Trounes
(d) None of the above
59. Matrini-minima method gives optimum
solution.
(a) Yes
(b) No
(c) Both (a) and (b)
(d) None of the above
60. North-West corner rule gives optimum
solution.
(a) True
(b) False
(c) Both (a) and (b)
(d) None of the above
61. …………….is a scientific approach to
problems for executive management :
(a) Research
(b) Game theory
(c) Operation research
(d) Management
62. Which of the following is not the nature
of operation research :
(a) Inter disciplinary team approach
(b) Systems approach
(c) No use of models
(d) Scientific method
63. The models are applied to the management
of large scale projects is known as :
(a) Network models
(b) Game theory
(c) Inventory model
(d) Allocation model
64. The standard form of the LP problem is
expressed as :
(a) Optimize (max or min) z = c1x1+c2x2
(b) Optimize (max or min) z =
c1x1+c2x2+...+cnxn
(c) Optimize (max or min) z =
c1x1+c2x2+os1
(d) Optimize (max or min) z =
c1x1+c2x2+….+cnxn+os1+os2….+osm
(4)
FR55
65. The (nm) variables whose value did
not appear in this solution are called :
(a) Basic solution
(b) Non-basic variables
(c) Basic variables
(d) None of the above
66. An optimal solution of a maximization
problem is reach if all :
(a) Cj  zj  1
(b) Cj  zj  0
(c) Cj  zj  0
(d) Cj  zj  1
67. ………..plays an important role in our
economy and in managerial decision
making.
(a) Transportation
(b) LP model
(c) OR
(d) None of the above
XIX
68. A finite value of objective function
satisfy the inequality znzy, this
inequality is interpreted as:
(a) Profit  worth of resources
(b) Profit  worth of resources
(c) Profit > worth of resources
(d) Profit < worth of resources
69. An assignment problem can be solved
by :
(a) Enumeration method
(b) Simplex method
(c) Hungarian method
(d) All of the above
70. A game involving n persons is known
as :
(a) N-person game
(b) Strategy
(c) Game
(d) All of the above
(5)