WOLKITE UNIVERSITY
DEPARTMENT OF MANAGEMANT
OPERATIONS RESEARCH
Model examination
Choose the best answer from the given alternative
1. The first step in solving Operations Research problem is:
A. Model building C. Obtain alternate solutions
B. Formulation of the problem D. Obtain basic feasible solutions
2. The constraints of Maximization problem are of:
A. Greater than or equal type C. Less than type
B. Less than or equal type D. Greater than type
3. The slack variables indicate:
A. Excess resource available C. Nil resources
B. Shortage of resource available D. Idle resource
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. The key row indicates:
A. Incoming variable C. Slack variable
B. outgoing variable D. Surplus variable
7. The key column indicates:
A. Outgoing variable C. Independent variable
B. Incoming variable B. Dependent variable
A. 𝐶𝑗−𝑍𝑗≤0
8. In solving maximization LP models using simplex algorithm, the iteration is terminated when
B. 𝐶𝑗−𝑍𝑗=0
C. 𝐶𝑗−𝑍𝑗≥0
D. 𝑍𝑗≤0
9. The solution of the Linear programming problem in graphical solution lies in:
A. First quadrant C. Third quadrant
B. Second quadrant D. Fourth quadrant
10. The number at the intersection of key row and key column is known as:
A. Column number C. Key number/Element
B. Row number D. Cross number
11. If an artificial variable exists in the final simplex tableau, the type of solution is
A. Unbounded C. Infeasible
B. Non optimal D. Degeneracy
12. _________________deals with the distribution of goods from several points of supplies (sources)
to a number of points of demands (destinations).
A. transportation problem
B. assignment problem
C. simplex approach
D. Dual leaner problem
13. Which one is odd approach?
A. north west corner method (NWCM)
B. least cost method (LCM)
C. Vogel’s approximation method (VAM)
D. Hungarian Method
14. Among type of decision making criterion ––––––––––––is very optimistic.
A. Maximin B. Minimax C. Maximax D. Laplace
15. 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
16. The total number of allocation in a basic feasible solution of transportation problem of m- rows
and × n –column size is equal to:
A. m × n C. m + n +1
B. (m / n ) – 1 D. m + n – 1
17. 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
18. The decision making criterion follow selecting the alternative that has the best (maximum) of the
worst payoffs is called.
A. Maximin B. Minimax C. Maximax D. Regret
19. The beginning and end points of an activity are called;
A. Events C. Dangling
B. Nodes D. A & B
20. Activities that cannot be started until one or more of other activities are completed are called:
A. Successor activities B. Predecessor activities C. Concurrent activities D. None
21. In transportation problem the solution is optimal when all of the unoccupied or empty cell evaluation result
is
A. Positive or/and zero C. positive and negative
B. Negative D. zero or/and negative
22. _______method of evaluating a transportation solution for optimality involves the use of index numbers
that are established for the rows and columns.
A. Modi method B. stepping stone method C. Least cost method D. VAM
[Link] one is not considered as
Additional variable in solving linear programming problem especially simplex method
A. Slack variable(S)
B. Artificial variable(A)
C. Basic variable
D. Surplus variable(-S)
24. Operations Research came into existence during:
A. World War I C. World War II
B. India and Pakistan War D. Stone Age
25. ____________ is the variable that has the most positive value in the Cj - Zj row in simplex method
A. leaving variable
B. Entering variable
C. Iterative variable
D. Non basic variable
