Anda di halaman 1dari 5

Fifth Semester B.B.

A Degree Examination, Model Question Paper


Career Related First Degree Programme under CBCSS
Group 2(b)

Core Course BM 1541OPERATIONS RESEARCH


(2010 Admission Onwards)
Time: 3 Hours

Max. Wt.: 30
SECTION A

This section consists of four bunches of four questions each.


Each bunch carries a weight of 1. Answer all questions.

I.

Choose the most appropriate answer from the following:

1. The value of

a b c
d e f
a b c

is

2 2
a) 0
c) a -b
b) 1
d) aec - bdf
2. The sum of the elements of a leading diagonal in a matrix is called
a) Trace
c) Unit
b) Order
d) None of these
3. A square matrix is said to be singular if its determinant value is
a) 1
c) Not equal to zero
b) 0
d) Not equal to one
T
T
T
4. If AA = A .A=I where A is the transpose of the matrix A, then A is called
a) Orthogonal matrix
c) Skew symmetric matrix
b) Symmetric matrix
d) Hermitian matrix

II.

Choose the most appropriate answer from the following


5. If maximum value of an objective function Z occurs at infinity then the problem has
a) Infeasible solution
c) Alternative solution
b) Unbounded solution
d) None of theseE
6. Activities which can be accomplished concurrently are known as
a) Preceding activity
c) Concurrent activity
b) Succeeding activity
d) None of these
7. Fulkerson Rule is used for using ..
a) Naming activity
c) Identify the float
b) Numbering the events
d) None of these
8. In a game the number of competitors is
a) Finite
b) Less than 2
c) Infinite
d) None of these

III.

IV.

Match the following:


A
9. Game theory
10. LPP
11. Simplex table
12. Transportation problem

B
Objective function
Northwest corner rule
Strategy
Minimum ratio

Answer the following questions in a word.


13. What happened to the game if minimax value = maximin value = 0
14. What is the name of the activity whose total float is 0
15. What is the name of the method in Assignment problem for getting the optimum
assignment?
16. Which is the best method in Transportation problem for obtaining initial basic
feasible solution?
(4x 1= 4wts.)
SECTION - B
Write short answers to any eight questions in one or two sentences each.
Each question carries a weight of 1

17. Define Scope of Operation Research.


18. Define a. Unit matrix b. Singular matrix
19. Define Slack and Surplus variables.
20. Define an optimal solution in L.P.P.
21. Fine value of

-3

-1

22. State the necessary and sufficient condition for the existence of a feasible
solution to the transportation problem.
23. When can we apply Johnsons algorithm in finding the optimal ordering of n jobs
through three machines?
24. What are the three main phases of a project?
25. Define group replacement.
26. Define Zero-Sum game.
27. What is iconic model?
28. What is the purpose of MODI method?

(8 x 1= 8wts)

SECTION C
Answer any five questions in not exceeding one paragraph each.
Each question carries a weight of 2

Solve the following simultaneous equation using Crammers rule

29.

5x-6y+4z=15
7x+4y-3z=19
2x+y+6z=46
30.

A toy company manufactures two types of dolls, a basic version doll A


and a deluxe version doll B. Each doll of type B takes twice as long to produce as
one type A and the company would have time to make a maximum of 2,000 per
day if it produced only the basic version. The supply of plastic is sufficient to
produce 1500 dolls per day.(Both A and B combined). The deluxe version
requires a fancy dress of whch ther are 600 per day available. If the company
makes profit of Rs 3.00 and Rs 5.00 per doll respectively on doll A and B, how
many of each should be produced per day in order to maximize profit. Solve it
graphically.

31.

Difference between transportation problem and assignment problem.

32. There are five jobs each of which must go through the two machines A and B in
order AB. Processing time are given below.
Job

Machine A

10

Machine B

33. Use simplex method to solve the L.P.P


Max: z=3x1+2x2
s.t

x1+x24
x1-x22
x1, x20

34. Following is the pay off matrix for players A and B


Player B
I

II

III

IV

Player A 2

Use dominance property, obtain the optimum strategies for both the players
and determine the value of game
35. Difference between CPM and PERT.
36. Write any four application of Operation Research.
(5 x 2=10 wts.)
SECTION D
Answer any two questions in not exceeding four pages each.
Each question carries a weight of 4

37.

Solve the following transportation problem.


To

From

Demand

II

III

Supply

14

18

38. A manufacture is offered two machines A and B. A is priced at Rs 5000 and


running costs are estimated at Rs 800 for each of the first five years, increasing
by Rs 200 per year in the 6th and subsequent years. Machine B, which has the
same capacity as A, Costs Rs 2500 but will have running cost of Rs 1200 per
year for 6 years increasing by Rs 200 per year there after which machine should
be purchased (Assume that machine will eventually be sold for scrap at negligible
price)

39. The following table lists the jobs of network along with their estimates.
Jobs

Duration(days)

Optimistic

Most likely

Pessimistic

15

14

12

30

11

17

15

27

19

28

a. Draw the project network


b. Calculate the length and variance of critical path
c. What is the approximate probability that the job on the critical path will
be completed in 41 days

(2x4= 8 Wts)