OPERATIONS RESEARCH AND NUMERICAL METHODS

Choose the best Answer:

1. If Σai ≠ Σaj , then the transportation problem is said to be ______
a)Balanced b)Unbalanced c)Infinity d)Optimal
2. Another name of Unit Cost penalty method is______ method.
a)North-West corner b)Matrix Maxima c)Vogel’s approximation
d)Least-Cost
3. Assignment problem is always a degenerate form of a
______problem.
a)Transportation b)Salesman c)Integer programming d)Dynamic
4. If for an assignment problem all Cij >0, then an assignment schedule
(Xij) which satisfies Σ Cij Xij=0 must be ______
a) Zero b) Infinite c)Optimal d)One
5. The transportation time in moving jobs from one machine to another
is_____
a)Un limit b)One hour c)Negligible d)Counted
6. Graphical method is used to solve the sequencing problem of
processing _____ jobs on n machines.
a)1 b)2 c)3 d)4
7. Gauss-Jordan elimination method is a modification of the ____
elimination method.
a)Gauss b) Jordan c)Crout d)Triangular
8. The convergence is rabid in Gauss-Seidel method when compared to
______method.
a)Gauss-Jacobi b) Gauss-Jordan c)Crout d)Triangular
9. The solution to a transportation problem with m sources and n
destinations is feasible ,if the number of allocations are____
a)m+n-1 b)m+n+1 c)m+n d)m×n
10. The dummy source or destination in a T.P is introduced to____
a)prevent solution to become degenerate
b)to satisfy rim condition
c)ensure that total cost does not exceed a limit
d)solve the balanced transportation problem
11. The method used for solving an assignment problem is
called______
a)MODI method b)Reduced matrix method c)Hungarian method
d)None
12. For a salesman, who has to visit n cities, following are the ways of
his tour plan a)n b)n! c) (n+1) ! d)(n-1) !
13. To find the optimal solution we apply _____
a)LPP B)VAM C)MODI D)Rim
14. Sequencing problems involving processing of two jobs on n
machines
a) Can be solved graphically
b) Cannot be solved graphically
c) Have a condition that the processing of two jobs must be in the
same order
d) None
15. In Gauss elimination method the given system of simultaneous
equation is transformed into______
a) Lower triangular matrix
b)Unit matrix
c) Transpose matrix
d)Upper triangular matrix
16. Gauss seidal iteration converges only if the coefficient matrix
is____
a) Upper triangular b) lower triangular c) diagonally dominant
d) banded matrix
17. The order of convergence in Newton-Raphson method is______
a)2 b)3 c)0 d)1
18. Interpolation is helpful in estimating ________
a) Missing values of a series
b) An intermediary value for a given argument
c) The argument for a given entry
d) All the above
19. In Vogels approximation method
a) the cost difference indicate the penalties for not using the
respective last cost routes
b) Initial solution to transportation problem is not applicable, if some
routes are prohibited.
c) Degeneracy never occurs
d) None of the above
20. An assignment problem can be solved by
a) Transportation method
b) Simplex method
c) Both (a) and (b)
d) None of the above
21. A sequencing problem involving six jobs and three machines
requires evaluation of
a) [6! + 6! + 6!] sequences
b) (6!)3 sequences
c) (6 × 6 × 6) sequences
d) (6 + 6 + 6) sequences
22. The general assumption which is not correct in solving a
sequencing problem is that
a) The time taken by different jobs in moving from one machine to
another is negligible
b) The processing times on various machines are independent of the
order in which different jobs are processed on them
c) A job once started on a machine would be performed to the point
of completion uninterrupted
d) A machine can process more than one job at a given point of time.
23. What is the form of inverse matrix?
a) AX = I b) AX = B c) A-1 X = B d) AB = I
24. Assignment problem is always a ______ form of a transportation
problem.
a) Generate b) Degenerate c) Integer d) Dynamic
25. _____ time on a machine is the time the machine remains idle
during the total elapsed time.
a) Elapsed b) idle c) current d) service
26. The convergence is rapid in _____ method when compared to
Gauss-Jacobi method
a) Crout b) Gauss-Jordan c) Gauss-seidel
d) Triangular
27. ____ elimination method is a modification of the Gauss-
elimination method
a) Gauss-Jordan b) Jordan c) Crout d) Triangular
28. The transportation problem is balanced if____
a) Total demand and Total supply are equal and the number of
sources equals the number of destination.
b) Total demand equals total supply irrespective of the number of
sources and destinations
c) Number of sources matches with the number of destination
 d) None of the roots in prohibited.
29. The solution to a transportation problem with m-sources and n
destination is feasible, if the number of allocation are
a) m+n-1 b) m+n+1 c) m+n d) m×n
30. If there are n workers and n jobs, there would be a _____
a) n solutions b) n! Solutions c) (n-1)! Solutions d) (n!)n
solutions
31. The system of n equations is given by AX = B where A is the ____
a) Augmented Matrix b) inverse of matrix
c) co-efficient matrix d) triangular matrix
32. Which method usually gives a very good solution to the
transportation problem
a) North-West corner rule b)Vogel’s approximation method
c) cost method d)least cost
33. The application of assignment problem is to obtain____
a) Only minimum cost b) only maximum cost c) minimum cost or
maximum profit d) assign the job
34. In Gaussian elimination method, the given system of equation
represented by AX=B is converted to another system Ux=y where U
is_____
a)diagonal matrix b)null matrix c)identity matrix d)upper triangular
matrix
35. Which of the following is an iterative method?
a)Gauss Elimination method b)Gauss Jordan method c)LU method
d)Gauss seidel method
36. The Lagrange’s interpolation formula is used for the argument
which is ____spaced
a)equally b)distinct c)unequally d)none
37. A balanced transportation problem will always have a
_____solution.
a) Feasible b) unfeasible c) empty d) infinity
38. Another name of Assignment method is ____________method
a)Hungarian b)travelling c)dynamic d)dot
39.___________operation is carried out on a machine at a time
a)only one b)only two c)nothing d)un limit
40.In the Gauss Jordan elimination method the values of roots are got
immediately without using the process of __________substitutions.
a)forward b)backward c)direct d)straight.

ANSWERS
1.b 2.c 3.a 4.c 5.c 6.b 7.a 8.a 9.a 10.b
11.c 12.d 13.c 14.a 15.d 16.c 17.a 18.d 19.a 20.c
21.b 22.d 23.a 24.b 25.b 26.c 27.a 28.a 29.a 30. b
31.c 32.b 33.d 34.d 35.d 36. c 37.a 38.a 39. a 40. b