1.

Operations research is the application of ____________methods to arrive at

the optimal Solutions to the problems.
A. economical B. scientific
C. a and b both D. artistic
2. In operations research, the ------------------------------are prepared for situations.
A. mathematical models
B. physical models diagrammatic
C. diagrammatic models
3. Operations management can be defined as the application of ----------------------
--------------------to a problem within a system to yield the optimal solution.
A. Suitable manpower
B. mathematical techniques, models, and tools
C. Financial operations
4. Operations research is based upon collected information, knowledge and
advanced study of various factors impacting a particular operation. This leads to
more informed -------------------------------------.
A. Management processes
B. Decision making
C. Procedures
5. OR can evaluate only the effects of --------------------------------------------------.
A. Personnel factors.
B. Financial factors
C. Numeric and quantifiable factors.
6. By constructing models, the problems in libraries increase and cannot be
solved.
A. True
B. False
7. Operations Research started just before World War II in Britain with the
establishment of teams of scientists to study the strategic and tactical problems
involved in military operations.
A. True
B. False
8. OR can be applied only to those aspects of libraries where mathematical
models can be prepared.
A. True
B. False
9. The main limitation of operations research is that it often ignores the human
element in the production process.
A. True
B. False
10. Which of the following is not the phase of OR methodology?
A. Formulating a problem B. Constructing a model
C. Establishing controls D. Controlling the environment
11. Who defined OR as scientific method of providing execuitive departments
with a quantitative basis for decisions regarding the operations under their
control?
A. Morse and Kimball (1946) B. P.M.S. Blackett (1948)
C. E.L. Arnoff and M.J. Netzorg D. None of the above
12. OR has a characteristics that it is done by a team of
A. Scientists B. Mathematicians
C. Academics D. All of the above
13. Hungarian Method is used to solve
A. A transportation problem B. A travelling salesman problem
C. A LP problem D. Both a & b
14. Which technique is used in finding a solution for optimizing a given
objective, such as profit maximization or cost reduction under certain
constraints?
A. Quailing Theory B. Waiting Line
C. Both A and B D. Linear Programming
15. What is the objective function in linear programming problems?
A. A constraint for available resource
B. An objective for research and development of a company
C. A linear function in an optimization problem
D. A set of non-negativity conditions
16. Which statement characterizes standard form of a linear programming
problem?
A. Constraints are given by inequalities of any type
B. Constraints are given by a set of linear equations
C. Constraints are given only by inequalities of >= type
D. Constraints are given only by inequalities of <= type
17. Feasible solution satisfies __________
A. Only constraints
B. only non-negative restriction
C. [a] and [b] both
D. [a],[b] and Optimum solution
18. In Degenerate solution value of objective function _____________.
A. increases infinitely B. basic variables are nonzero
C. decreases infinitely D. One or more basic variables are zero
19. Minimize Z = ______________
A. –maximize(Z) B. -maximize(-Z)
C. maximize(-Z) D. none of the above
20. In graphical representation the bounded region is known as _________
region. A. Solution B. basic solution C. feasible solution D. optimal
21. Graphical optimal value for Z can be obtained from
A. Corner points of feasible region
B. Both a and c
C. corner points of the solution region
D. none of the above
22. In LPP the condition to be satisfied is
A. Constraints have to be linear
B. Objective function has to be linear
C. none of the above
D. both a and b State
23. Objective function in Linear Programming problems has always finite value at
the optimal solution-TRUE
24. A finite optimal solution can be not unique- FALSE
25. Feasible regions are classified into bounded, unbounded, empty and multiple:
TRUE
26. Corner points of a feasible region are located at the intersections of the region
and coordinate axes: TRUE
27. Consider the linear equation 2 x1 + 3 x2 - 4 x3 + 5 x4 = 10 How many basic
and non-basic variables are defined by this equation?
A. One variable is basic, three variables are non-basic
B. Two variables are basic, two variables are non-basic
C. Three variables are basic, one variable is non-basic
D. All four variables are basic
28. The feasible region of a linear programming problem has four extreme
points: A(0,0), B(1,1), C(0,1), and D(1,0). Identify an optimal solution for
minimization problem with the objective function z = 2 x - 2 y
A. A unique solution at C
B. A unique solutions at D
C. An alternative solution at a line segment between A and B
D. An unbounded solution
29. Linear programming is a
(a) Constrained optimization technique
(b) Technique for economic allocation of limited resources.
(c) Mathematical techniques
(d) All of the above
30. In the optimal simplex table, Cj -Zj value indicates
(a) Unbounded solution (b) Cycling
(c) Alternative solution (d) None of these
31. For a maximization problem, objective function coefficient for an artificial
variable is
(a) + M (b) -M
(c) Zero (d) None of these
32. When the total supply is not equal to total demand in a transportation
problem then it is called
(a) Balanced (b) Unbalanced
(e) Degenerate (d) None of these
33. The solution to a transportation problem with m-rows and n-columns is
feasible if number of positive allocations are
(a) m + n (b) m *n
(c) m+n-l (d) m+n+l
34. An assignment problem is considered as a particular case of a transportation
problem because
A. The number of rows equals columns
B. All xij= 0 or 1
C. All rim conditions are 1
D. All of the above
35. The method used for solving an assignment problem is called
A. Reduced matrix method
B. MODI method
C. Hungarian method
D. None of the above
36. The assignment problem
A. Requires that only one activity be assigned to each resource
B. Is a special case of transportation problem
C. Can be used to maximize resources
D. All of the above
37. An assignment problem is a special case of transportation problem, where
A. Number of rows equals number of columns
B. All rim conditions are 1
C. Values of each decision variable is either 0 or 1
D. All of the above
38. The Hungarian method for solving an assignment problem can also be used
to solve
A. A transportation problem B. A travelling salesman problem
C. A LP problem D. Both a & b
39. An optimal solution of an assignment problem can be obtained only if
A. Each row & column has only one zero element
B. Each row & column has at least one zero element
C. The data is arrangement in a square matrix
D. None of the above
40. In applying Vogel's approximation method to a profit maximization problem,
row and column penalties are determined by:
A. finding the largest unit cost in each row or column.
B. finding the smallest unit cost in each row or column.
C. finding the sum of the unit costs in each row or column.
D. finding the difference between the two lowest unit costs in each row and
column.
41. The northwest corner rule requires that we start allocating units to shipping
routes in the: middle cell.
A. Lower right corner of the table.
B. Upper right corner of the table.
C. Highest costly cell of the table.
D. Upper left-hand corner of the table
42. Which of the following is used to come up with a solution to the assignment
problem?
A. MODI method
B. northwest corner method
C. stepping-stone method
D. Hungarian method
43. The solution presented in the following table is

A. infeasible. B. degenerate. C. unbounded. D. Optimal.

44. Optimal solution of an assignment problem can be obtained only if

A. Each row & column has only one zero element
B. Each row & column has at least one zero element
C. The data is arrangement in a square matrix
D. None of the above
45. In assignment problem of maximization, the objective is to maximize
A. Profit B. optimization
C. cost D. None of the above
46. The purpose of the stepping-stone method is to
A. develop the initial solution to the transportation problem.
B. assist one in moving from an initial feasible solution to the optimal solution.
C. determine whether a given solution is feasible or not.
D. identify the relevant costs in a transportation problem.
47. The purpose of a dummy source or dummy destination in a transportation
problem is to
A. prevent the solution from becoming degenerate.
B. obtain a balance between total supply and total demand.
C. make certain that the total cost does not exceed some specified figure.
D. provide a means of representing a dummy problem.
48. Which of the following is a method for improving an initial solution in a
transportation problem?
A. northwest-corner
B. intuitive lowest-cost
C. southeast-corner rule
D. stepping-stone
49. In a transportation problem, we must make the number of __________ and
__________ equal.
A. destinations; sources
B. units supplied; units demanded
C. columns; rows
D. positive cost coefficients; negative cost coefficients
50. __________ or __________ are used to "balance" an assignment or
transportation problem.
A. Destinations; sources
B. Units supplied; units demanded
C. Dummy rows; dummy columns.
51. The equation Ri + Kj = Cij is used to calculate __________.
A. an improvement index for the stepping-stone method
B. the opportunity costs for using a particular route
C. the MODI cost values (Ri, Kj)
D. the degeneracy index
52. The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’
columns (destination) is feasible if number of positive allocations are
A. m+n B. m*n
C. m+n-1 D. m+n+1
53. Which of the following methods is used to verify the optimality of the
current solution of the transportation problem
A. Least cost method
B. Vogel’s approximation method
C. Modified distribution method
D. All of the above