INJIBARA UNIVERSITY

COLLEGE OF BUSINESS AND ECONOMICS

DEPARTMENT OF MANAGEMENT
OPERATIONS RESEARCH EXAM

Part I: Multiple Choice Questions

1. Operations Research is the outcome of:
A. National emergency C. Combined efforts of talents of all fields
B. Political problems D. Economics and Engineering
2. Operations Research came into existence during:
A. World War I C. World War II
B. India and Pakistan War D. None of the above
3. The name of the subject Operations Research is due to the fact that:
A. Problems can be solved by war approach
B. The researchers do the operations
C. The war problems are generally known as operations and inventing a new way of solving such problems
D. Mathematical operations are used in solving the problems
4. The first country to use Operations Research method to solve problems is:
A. India C. United Kingdom
B. China D. United State of America
5. The name Operations Research is first coined in the year:
A. 1945 B. 1950 C. 1935 D. 1940
6. The person who coined the name Operations Research is:
A. Bellman C. Newman,
B. Mc Closky and Trefrhen D. None of the above
7. The objective of Operations Research is:
A. To find new methods of solving Problems C. Optimal utilization of existing resources
B. To derive formulas D. To utilize the services of scientists
8. Operations Research is:
A. Independent thinking approach C. Inter-disciplinary team approach

B. Group thinking approach D. None of the above

Self-Assessment Exercises On Chapter 2
1. The constraints of Maximisation problem are of:
A. Greater than or equal type C. Less than type
B. Less than or equal type D. Greater than type

BY Wondimalem Dagnaw
2. The slack variables indicate:
A. Excess resource available C. Nil resources
B. Shortage of resource available D. Idle resource
3. In graphical solution of solving Linear Programming problem, to convert inequalities into equations, we:
A. Use Slack variables C. Use Artificial surplus variables
B. Use Surplus variables D. Simply assume them to be equations
4. To convert ≤ type of inequality into equations, we have to:
A. Assume them to be equations C. Subtract slack variables
B. Add surplus variables D. Add slack variables
5. To convert ≥ type of inequality into equations, we have to:
A. Add slack variable C. Subtract surplus variable
B. Subtract slack Variable D. Add surplus variable
6. In Graphical solution of maximisation problem, the line, which we move from origin to the extreme point of
the polygon is:
A. Any one side of the polygon C. Iso profit line
B. Iso cost line D. An imaginary line
7. The key row indicates:
A. Incoming variable C. Slack variable
B. outgoing variable D. Surplus variable
8. The key column indicates:
A. Outgoing variable C. Independent variable
B. Incoming variable B. Dependent variable
9. To transfer the key row in simplex table we have to:
A. Add the elements of key row to key number
B. Subtract the elements of key row from topmost no key row
C. Divide the elements of key row by key number
D. None of the above
10. The solution of the Linear programming problem in graphical solution lies in:
A. First quadrant C. Third quadrant
B. Second quadrant D. Fourth quadrant
11. When we solve maximization problem by simplex method the elements of net evaluation row of optimal
solution must be
A. Either zeros or positive numbers C. All are negative numbers
2|Page
 B. Either zeros or negative numbers D. All are zeros
12. When the elements of net evaluation row of simplex table are equal, the situation is known as:
A. Tie C. Break
B. Degeneracy D. Shadow Price

13. The number at the intersection of key row and key column is known as:

A. Column number C. Key number

B. Row number D. Cross number

14. The cost coefficient of slack variable is:

A. Zero C. > than one

B. One D. < than one

15. The cost coefficient of surplus variable is:

A. 0 B. 1 C. M D. > than 1

3|Page
 Part I: Exercises on chapter Three
Multiple Choices
1. Transportation problem is basically a:
A. Maximisation model C. Transhipment problem
B. Minimisation model D. Iconic model
2. The column, which is introduced in the matrix to balance the rim requirements, is known
as:
A. Key column C. Slack column
B. Idle column D. Dummy Column
3. The row, which is introduced in the matrix to balance the rim requirement, is known as:
A. Key row C. Dummy row
B. Idle row D. Slack row
4. One of the differences between the Resource allocation model and Transportation Model
is:
A. The coefficients of problem variables in Resource allocation model may be any number
and in transportation model it must be either zeros or ones
B. The coefficients of problem variable in Resource allocation model must be either zeros
or ones and in Transportation model they may be any number
C. In both models they must be either zeros or ones only
D. In both models they may be any number
5. To convert the transportation problem into a maximisation model we have to:
A. Write the inverse of the matrix.
B. Multiply the rim requirements by –1
C. To multiply the matrix by –1
D. We cannot convert the transportation problem into a maximisation problem, as it is
basically a minimisation problem
6. In a transportation problem where the demand or requirement is equal to the available
resource is known as:
A. Balanced transportation problem
B. Regular transportation problem
C. Resource allocation transportation problem
D. Simple transportation model

4|Page
7. The total number of allocation in a basic feasible solution of transportation problem of m
× n size is equal to:
A. m × n C. m + n +1
B. (m / n ) – 1 D. m + n – 1
8. When the total allocations in a transportation model of m x n size is not equals to m + n –
1 the situation is known as:
A. Unbalanced situation C. Degeneracy
B. Tie situation D. None of the above
9. The opportunity cost of a row in a transportation problem is obtained by:
A. Deducting the smallest element in the row from all other elements of the row
B. Adding the smallest element in the row to all other elements of the row
C. Deducting the smallest element in the row from the next highest element of the row
D. Deducting the smallest element in the row from the highest element in that row
10. In Northwest corner method the allocations are made:
A. Starting from the left hand side top corner
B. Starting from the right hand side top corner
C. Starting from the lowest cost cell
D. Starting from the lowest requirement and satisfying first
11. VAM stands for:
A. Value added method C. Vogel Adam method
B. Value assessment method D. Vogel’s approximation method
12. MODI stands for:
A. Modern distribution C. Modified distribution method
B. Mendel's distribution method D. Model index method
13. In the optimal solution, more than one empty cells have their opportunity cost as zero, it
indicates:
A. The solution is not optimal C. Something wrong in the solution
B. The problem has alternate solution D. The problem will cycle
14. In case the cost elements of one or two cells are not given in the problem, it means:
A. The given problem is wrong
B. We can allocate zeros to those cells
C. Allocate very high cost element to those cells

5|Page
 D. To assume that the route connected by those cells are not available
15. To solve degeneracy in the transportation problem we have to:
A. Put allocation in one of the empty cells as zero
B. Put a small element epsilon in any one of the empty cells
C. Allocate the smallest element epsilon in such a cell, which will not form a closed loop
with other loaded cells
D. Allocate the smallest element epsilon in such a cell, which will form a closed loop
with other loaded cells
16. A problem where the produce of a factory is stored in warehouses and then they are
transported to various demand points as and when the demand arises is known as
A. Transhipment problem C. Storing and transport problem
B. Warehouse problem D. None of the above
17. Implied Cost in transportation problem sets (in the existing program):
A. The lowest limit for the empty cell beyond which it is not advisable to include in the
programme
B. The highest limit for the empty cell beyond which it is not advisable to include in the
programme
C. The opportunity cost of the empty cell
D. None of the above
18. In transportation model, the opportunity cost is given by
A. Implied cost + Actual cost of the cell C. Implied cost – Actual cost of the cell
B. Actual cost of the cell – Implied cost D. Implied cost × Actual cost of the cell
19. If ui and vj are row and column numbers respectively, then the implied cost is given by:
A. ui + vj C. ui × vj
B. ui – vj D. ui / vj

6|Page
20. Assignment Problem is basically a
A. Maximisation Problem C. Transportation Problem
B. Minimisation Problem D. Primal problem
21. The Assignment Problem is solved by:
A. Simplex method C. Vector method
B. Graphical method D. Hungarian method
22. In Index method of solving assignment problem:
A. The whole matrix is divided by smallest element
B. The smallest element is subtracted from whole matrix
C. Each row or column is divided by smallest element
D. The whole matrix is multiplied by -1
23. In Hungarian method of solving assignment problem, the row opportunity cost matrix is
obtained by:
A. Dividing each row by the elements of the row above it
B. Subtracting the elements of the row from the elements of the row above it
C. Subtracting the smallest element from all other elements of the row
D. Subtracting all the elements of the row from the highest element in the matrix
24. The property of total opportunity cost matrix is
A. It will have zero as elements of one diagonal
B. It will have zero as the elements of both diagonals
C. It will have at least one zero in each column and each row
D. It will not have zeros as its elements
25. The horizontal and vertical lines drawn to cover all zeros of total opportunity matrix must
be:
A. Equal to each other,
B. Equal to m × n (where m and n are number of rows and columns)
C. m + n (where m and n are number of rows and columns)
D. Number of rows or columns
26. The assignment matrix is always a:
A. Rectangular matrix
B. Square matrix
C. Identity matrix

7|Page
 D. None of the above
27. To balance the assignment matrix we have to:
A. Open a Dummy row
B. Open a Dummy column
C. Open either a dummy row or column depending on the situation
D. You cannot balance the assignment matrix
28. To convert the assignment problem into a maximization problem:
A. Deduct smallest element in the matrix from all other elements
B. All elements of the matrix are deducted from the highest element in the matrix
C. Deduct smallest element in any row from all other elements of the row
D. Deduct all elements of the row from highest element in that row
29. The similarity between Assignment Problem and Transportation Problem is:
A. Both are rectangular matrices
B. Both are square matrices
C. Both can be solved by graphical method
D. Both have objective function and non-negativity constraints
30. The following statement applies to both transportation model and assignment model:
A. The inequalities of both problems are related to one type of resource
B. Both use VAM for getting basic feasible solution
C. Both are tested by MODI method for optimality
D. Both have objective function, structural constraint and non-negativity constraints
31. To test whether allocations can be made or not (in assignment problem), minimum
number of horizontal and vertical lines are drawn. In case the lines drawn is not equal to
the number of rows (or columns), to get additional zeros, the following operation is done:
A. Add smallest element of the uncovered cells to the elements to the line
B. Subtract smallest element of uncovered rows from all other elements of uncovered
cells
C. Subtract the smallest element from the next highest number in the element
D. Subtract the smallest element from the element at the intersection of horizontal and
vertical lines
32. The following character dictates that assignment matrix is a square matrix:
A. The allocations in assignment problem are one to one

8|Page
 B. Because we find row opportunity cost matrix
C. Because we find column opportunity matrix
D. Because make allocations, one has to draw horizontal and Vertical lines

Part I: Choose the best answer from the following alternatives. (1.5 points each)
1. When resources required by activities are deterministic the method used in Project
Management is called
A. PERT B. AOA C. CPM D. Event Management
33. The assignment matrix is always a:
E. Rectangular matrix G. Identity matrix
F. Square matrix H. None of the above
34. In which method the cost of transportation is not considered while allocating units?
A. North West Corner Method. C. Vogel's Approximation Method.
B. Least Cost Cell Method. D. None of the above
35. The following one is Not method used in Decision making under Risk?
A. Expected monetary value criterion C. Expected value of perfect information
B. Expected opportunity loss criterion D. Hurwitz criterion

9|Page
36. An optimal assignment requires that the maximum number of lines that can be drawn through squares with
zero opportunity cost be equal to the number of ---------?
A. Rows or columns C. Rows + columns – 1
B. Rows + columns D. None of the above
37. When total supply is equal to total demand in a transportation problem, the problem is said to be---------?
A. Balanced. B. Unbalanced C. Degenerate D. None of the above
38. The purpose of a dummy row or column in an assignment problem is to ----------------?
A. Obtain balance between total activities and total resources
B. Prevent a solution from becoming degenerate
C. Provide a means of representing a dummy problem
D. none of the above
39. The activities with none zero slack times are called-------------?
A. Critical activity C. Non critical activity
B. Critical event D. Critical path
40. The sequence of critical activities in a network is called -----------?
A. Critical activity C. Non critical activity
B. Critical event D. Critical path
41. In Northwest corner method the allocations are made:
A. Starting from the left hand side top corner
B. Starting from the right hand side top corner
C. Starting from the lowest cost cell
D. Starting from the lowest requirement and satisfying first
42. The solution to a transportation problem with m-rows (supplies) and n-columns (destination) is feasible if
number of positive allocations are:
A. m + n C. m + n – 1
B. m × n D. m + n + 1
43. The column, which is introduced in the matrix to balance in assignments method, is known as:
A. Key column C. Slack column
B. Idle column D. Dummy Column
44. In the optimal solution, more than one empty cells have their opportunity cost as zero, it indicates:
A. The solution is not optimal C. Something wrong in the solution
B. The problem has alternate solution D. The problem will cycle
45. Which network-oriented techniques shown as a network of precedence relationships using activity-on-node?
A. Critical Path method C. Project evaluation review technique
B. Program evaluation review technique D. Gantt chart
46. While using Hurwiez criterion, the coefficient of (1 - ) refer to ------------?
A. Represents the degree of optimism C. Is the probability of a state of nature
B. Represents the degree of pessimisms D. None of the above
47. An activity which only determines the dependency of one activity on the other, but does not consume any
time is called;
A. Dangling B. Dummy C. Looping D. Event
48. The objective of network analysis is to

10 | P a g e
 INJIBARA UNIVERSITY
COLLEGE OF BUSINESS AND ECONOMICS
DEPARTMENT OF MANAGEMENT
OPERATIONS RESEARCH EXAM

A. Minimize total project duration C. Minimize production delays

B. Minimize total project cost D. All of the above
49. If an activity has zero slack, it implies that
A. It lies on the critical path C. The project is progressing well
B. It is a dummy activity D. None of the above
50. The slack for an activity is equal to:
A. LF – LS
B. EF – ES
C. LS – ES
D. None of the above

BY Wondimalem Dagnaw
20. The disconnection of an activity before the completion of all the activities in a network diagram
is known as;

A. Dangling C. Dummy C. Looping D.

Event

12 | P a g e