OPERATIONS RESEARCH (MCQs)

1. Operation research approach is

(i) Multi- (ii)Artificial (iii) Intuitive (iv) All of the
disciplinary above
2. Operation research analysis does not
(i) Predict future (ii)Build more (iii) Collect the(iv)
operation than one model relevant data Recommended
decision and
accept
3. Mathematical model of Linear Programming is important because
(i) It helps in (ii)decision (iii) it captures (iv) it enables the
converting the makers prefer to the relevant use of algebraic
verbal work with formal relationship techniques.
description and models. among decision
numerical data factors.
into
mathematical
expression
4. A constraint in an LP model restricts
(i) value of the (ii)value of the (iii) use of the (iv) all of the
objective function decision variable available above
resources

5. In graphical method of linear programming problem if the ios-cost line coincide

with a side of region of basic feasible solutions we get
(i) Unique (ii)unbounded (iii) no feasible (iv) Infinite
optimum solution optimum solution solution number of
optimum
solutions
6. A feasible solution of LPP
(i) Must satisfy all (ii)Need not (iii) Must be a (iv) all of the
the constraints satisfy all the corner point of above
simultaneously constraints, only the feasible region
some of them
7. The objective function for a L.P model is 3x1+2x2, if x1=20 and x2=30, what is the
value of the objective function?
(i) 0 (ii)50 (iii) 60 (iv) 120
8. Maximization of objective function in LPP means
(i) Value occurs at (ii)highest value (iii) none of the (iv) all of the
allowable set is chosen among above above
decision allowable
decision
9. Alternative solution exist in a linear programming problem when
(i) one of the (ii)objective (iii) two (iv) all of the
 constraint is function is constraints are above
redundant parallel to one of parallel
the constraints
10. Linear programming problem involving only two variables can be solved by
______________
(i) Big M method (ii)Simplex (iii) Graphical (iv) none of these
method method
11. The linear function of the variables which is to be maximize or minimize is
called _________
(i) Constraints (ii)Objective (iii)Decision (iv) None of the
function variable above

12. A physical model is an example of

(i) An iconic (ii)An analogue (iii) A verbal (iv) A
model model model mathematical
model
13. If the value of the objective function z can be increased or decreased indefinitely,
such solution is called _____________
(i) Bounded (ii)Unbounded (iii) Solution (iv) None of the
solution solution above
14. A model is
(i) An essence of (ii)An (iii) An (iv) All of the
reality approximation idealization above
15. The first step in formulating a linear programming problem is
(i) Identify any (ii) State the (iii) Understand (iv) Identify the
upper or lower constraints as the problem decision
bound on the linear variables
decision variables
combinations of
the decision
variables
 The role of artificial variables in the simplex method is
(i) to aid in (ii) to find optimal (iii) to start with (iv)all of these.
finding an initial dual prices in the Big M method.
solution final simplex table.
1. For a maximization problem, the objective function coefficient for an artificial
variable is
(i) + M (ii) -M (iii) Zero (iv)None of these
2. For maximization LPP, the simplex method is terminated when all values
(i) cj –zj ≤ 0 (ii) cj –zj ≥ 0 (iii) cj –zj = 0 (iv) zj ≤ 0
3. If any value in b - column of final simplex table is negative, then the solution is
(i)unbounded (ii) infeasible (iii) optimal (iv)None of these
4. To convert ≥ inequality constraints into equality constraints, we must
(i)add a surplus (ii)subtract an (iii) subtract a (iv)add a surplus
variable artificial variable surplus variable variable and
and an add subtract an
artificial artificial
variable variable.
5. In the optimal simplex table cj –zj = 0 value indicates
(i)unbounded (ii) cycling (iii) alternative (iv)None of these
solution solution
6. At every iteration of simplex method, for minimization problem, a variable in the
current basis is replaced with another variable that has
(i) a positive (ii) a negative cj –zj (iii) cj –zj = 0 (iv)None of these
cj –zj value value
7. A variable which does not appear in the basis variable (B) column of simplex table
is
(i)never equal to (ii) always equal to (iii) called basic (iv)None of these
zero zero variable.
8. To formulate a problem for solution by the simplex method, we must add artificial
variable to
(i)only equality (ii)only > constraints (iii) both (i) & (iv)None of these
constraints (ii)
9. If all xij values in the incoming variable column of the simplex table are negative,
then
(i)solution is (ii) there are multiple (iii)there exist no (iv)None of these
unbounded solution solution
10. If an artificial variable is present in the basic variable column of optimal simplex
table, then the solution is
(i)unbounded (ii) infeasible (iii) optimal (iv)None of these

11. If for a given solution, a slack variable is equal to zero, then

(i)the solution is (ii)the solution is (iii) there exist (iv)None of these
optimal infeasible no solution
12. Linear programming problem involving more than two variables can be solved by
______________
(i) Simplex (ii) Graphical (iii) Matrix (iv)None of these
method method minima method.
1. The initial solution of a transportation problem can be obtained by applying any
known method. However, the only condition is that
(i) the solution be (ii)the rim (iii) the solution (iv) all of the
optimal condition are not be degenerate. above.
satisfied.
2. The dummy source or destination in a transportation problem is added to
(i) satisfy rim (ii) prevent (iii) ensure that total (iv) all of the
condition. solution from cost does not exceed above.
becoming a limit.
degenerate.
3. The occurrence of degeneracy while solving a transportation problem means that
(i) total supply (ii) the solution (iii) the few (iv) none of the
equals total so obtained is not allocations above.
demand feasible. become negative.
4. An alternative optimal solution to a minimization transportation problem exists
whenever opportunity cost corresponding to unused routes of transportation is:
(i) positive and (ii) positive with (iii) negative with (iv) all of the
greater than zero. at least one equal at least one equal above.
to zero. to zero.
5. One disadvantage of using North-West Corner Rule to find initial solution to the
transportation problem is that
(i) ) it is (ii) it does not (iii) it leads to (iv) all of the
complicated to take into account degenerate initial above.
use. cost of solution
transportation.
6. The solution to a transportation problem with m-rows and n-columns is feasible if
number of positive allocations are
a) m+n (ii) m x n (iii) m + n -1 (iv) all of the
above.
7. The calculation of opportunity cost in the MODI method is analogous to a
(i) cj –zj value (ii) value of a (iii) variable in xb- (iv) all of the
for non-basic variable in b- column. above.
variable columns column of the
in the simplex simplex method.
method.
8. If we were to use opportunity cost value for an unused cell to test optimality, it
should be
(i) equal to zero. (ii) most negative (iii) most positive (iv) all of the
number. number. above.
9. An assignment problem is considered as a particular case of a Transportation problem
because
(i) the number (ii) all xij = 0 (iii) all rim (iv) all of
of rows equals conditions are 1 above.
 columns
10. For a salesman who has to visit n cities, following are the ways of his tour plan
(i) n! (ii) ( n + 1)! (iii) ( n - 1)! (iv) n
11. Every basic feasible solution of a general assignment problem having a square pay-off
matrix of order n should have assignments equal to
(i)2 n +1 (ii) 2n-1 (iii) m+n+1 (iv). M+n
12. The purpose of a dummy row or column in an assignment problem is to
(i)obtain (ii) prevent a (iii)provide a (iv)none of the
balance solution from means of above.
between total becoming representing a
activities and degenerate dummy
total resources problem
13. The Hungarian method for solving an assignment problem can also be used to solve
(i) a (ii) a traveling (iii) both (i) and (iv). only (ii)
transportation salesman (ii)
problem problem
14. An optimal of an assignment problem can be obtained only if
(i) each row and (ii) each row (iii) the data are (iv). non of the
column has and column has arrangement in above
only one zero at least one zero a square matrix
element element
15. The method used for solving an assignment problem is called
(i) reduced (ii) MODI (iii) Hungarian (iv). none of the
matrix method method method above
1. The Objective of network analysis to
(i) Minimize (ii) Minimize (iii) Minimize (iv) All of the
total project total project production above.
duration. cost. delays,
interruption and
conflicts.

2. Network models have advantage in terms of project

(i) Planning. (ii) Scheduling. (iii) Controlling. (iv) All of the
above.
3. The slack for an activity is equal to
(i) LF-LS. (ii) EF-ES (iii) LS-ES. (iv) None of the
above.
4. The Another term commonly used for activity slack time is
(i) Total float. (ii) Free float. (iii) independent (iv) All of the
float. above.
5. If an activity has zero slack, it implies that
(i) It lies on the (ii) It is a (iii) The project (iv) None of the
critical path. dummy activity. progressing well above.

6. A dummy activity is used in the network diagram when

(i) Two parallel (ii) The chain of (iii) Both (i) (iv) None of the
activities have activities may and (ii). above.
the same tail have a common
and head event yet be
events. independent by
themselves.

7. While drawing the network diagram , for each activity project, we should
look
(i) What (ii) What (iii) What (iv) All of the
activities activities follow activities can above.
precede this this activity? take place
activity? concurrently
with this
activity?

8. The critical path satisfy the condition that

(i) Ei = Li & E j (ii) Lj-Ei=Li-Lj. (iii) Lj-Ei=Li- (iv) All of the
= Lj . Ej=c(constant). above.

9. If there are in jobs to be performed, one at a time, on each of m machines,

the possible sequences would be
(i) (n!)m (ii) (m!)n (iii) (n)m (iv) (m)n
10. Total elapsed time to process all jobs through two machine is given by
 (i) n n (ii) n n (iii) n (iv) None of the
Σ M1j + Σ Σ M2j + Σ Σ (M1j + above.
M2j M1j I1j)
j=1 j=1 j=1 j=1
j=1

11. The minimum processing time on machine M1 and M2 are related as

(i) Min t1j= Max (ii) Min t1j ≤ (iii) Min t1j (iv) Min t2j ≥
t2j Max t2j ≥Max t2j Max t1j

12. You Would like to assign operators to the equipment that has
(i) Most jobs (ii) Job with the (iii) Job which (iv) All of the
waiting to be earliest due has been above.
processed. date. waiting longest.

13. Unforeseen factors that prevent the plans from actually happening are
(i) Equipment (ii) Additional (iii) (iv) All of the
may develop a order may Specifications above.
fault. arrive to be may be
added to changed.
schedules.